Submission #345267
Source Code Expand
//include //------------------------------------------ #include <vector> #include <list> #include <map> #include <set> #include <deque> #include <stack> #include <bitset> #include <algorithm> #include <functional> #include <numeric> #include <utility> #include <sstream> #include <iostream> #include <iomanip> #include <cstdio> #include <cmath> #include <cstdlib> #include <cctype> #include <string> #include <cstring> #include <ctime> #include <climits> #include <queue> using namespace std; //typedef //------------------------------------------ typedef vector<int> VI; typedef vector<VI> VVI; typedef vector<string> VS; typedef pair<int, int> PII; typedef long long LL; //container util //------------------------------------------ #define ALL(a) (a).begin(),(a).end() #define RALL(a) (a).rbegin(), (a).rend() #define PB push_back #define MP make_pair #define SZ(a) int((a).size()) #define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i) #define EXIST(s,e) ((s).find(e)!=(s).end()) #define SORT(c) sort((c).begin(),(c).end()) //repetition //------------------------------------------ #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) //constant //-------------------------------------------- const double EPS = 1e-10; const double PI = acos(-1.0); int main(){ cin.tie(0); ios_base::sync_with_stdio(false); string s; cin >> s; string ans; char ch = s[0], buf[16]; int cnt = 0; for(int i=0;i<SZ(s);++i){ if(ch == s[i]) ++cnt; else{ ans += string(1, ch); sprintf(buf, "%d", cnt); ans += buf; cnt = 1; ch = s[i]; } } if(cnt > 0){ ans += string(1, ch); sprintf(buf, "%d", cnt); ans += buf; } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 高橋くんと文字列圧縮 |
User | okaduki |
Language | C++11 (GCC 4.8.1) |
Score | 100 |
Code Size | 1807 Byte |
Status | AC |
Exec Time | 27 ms |
Memory | 932 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_1.txt, subtask0_2.txt, subtask0_3.txt |
All | 0.txt, 1.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 2.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 3.txt, 4.txt, 5.txt, 6.txt, 7.txt, 8.txt, 9.txt, subtask0_1.txt, subtask0_2.txt, subtask0_3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0.txt | AC | 24 ms | 800 KB |
1.txt | AC | 24 ms | 800 KB |
10.txt | AC | 27 ms | 812 KB |
11.txt | AC | 24 ms | 804 KB |
12.txt | AC | 24 ms | 800 KB |
13.txt | AC | 23 ms | 800 KB |
14.txt | AC | 22 ms | 928 KB |
15.txt | AC | 26 ms | 916 KB |
16.txt | AC | 24 ms | 920 KB |
17.txt | AC | 24 ms | 924 KB |
18.txt | AC | 24 ms | 804 KB |
19.txt | AC | 24 ms | 924 KB |
2.txt | AC | 26 ms | 796 KB |
20.txt | AC | 24 ms | 928 KB |
21.txt | AC | 25 ms | 800 KB |
22.txt | AC | 24 ms | 928 KB |
23.txt | AC | 24 ms | 928 KB |
24.txt | AC | 24 ms | 804 KB |
25.txt | AC | 24 ms | 800 KB |
26.txt | AC | 24 ms | 808 KB |
27.txt | AC | 24 ms | 928 KB |
28.txt | AC | 24 ms | 748 KB |
29.txt | AC | 22 ms | 924 KB |
3.txt | AC | 24 ms | 748 KB |
4.txt | AC | 24 ms | 748 KB |
5.txt | AC | 23 ms | 924 KB |
6.txt | AC | 24 ms | 744 KB |
7.txt | AC | 24 ms | 924 KB |
8.txt | AC | 24 ms | 928 KB |
9.txt | AC | 25 ms | 928 KB |
subtask0_1.txt | AC | 24 ms | 928 KB |
subtask0_2.txt | AC | 23 ms | 796 KB |
subtask0_3.txt | AC | 24 ms | 932 KB |