Submission #345261
Source Code Expand
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }
template<typename T>
vector<pair<T,int> > runLength(const T a[], int n) {
vector<pair<T,int> > r;
if(n <= 0) return r;
int cnt = 0;
for(int i = 0; i <= n; i ++) {
if(i == n || (i != 0 && a[i] != a[i-1])) {
r.push_back(make_pair(a[i-1], cnt));
cnt = 0;
}
cnt ++;
}
return r;
}
int main() {
string s;
cin >> s;
vector<pair<char,int> > runs = runLength(&s[0], s.size());
each(i, runs)
cout << i->first << i->second;
cout << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
B - 高橋くんと文字列圧縮 |
User |
anta |
Language |
C++ (G++ 4.6.4) |
Score |
100 |
Code Size |
1698 Byte |
Status |
AC |
Exec Time |
25 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 |
23 ms |
924 KB |
1.txt |
AC |
25 ms |
920 KB |
10.txt |
AC |
24 ms |
928 KB |
11.txt |
AC |
24 ms |
800 KB |
12.txt |
AC |
24 ms |
932 KB |
13.txt |
AC |
23 ms |
804 KB |
14.txt |
AC |
22 ms |
796 KB |
15.txt |
AC |
22 ms |
924 KB |
16.txt |
AC |
22 ms |
808 KB |
17.txt |
AC |
22 ms |
800 KB |
18.txt |
AC |
22 ms |
804 KB |
19.txt |
AC |
23 ms |
800 KB |
2.txt |
AC |
24 ms |
928 KB |
20.txt |
AC |
22 ms |
800 KB |
21.txt |
AC |
23 ms |
800 KB |
22.txt |
AC |
25 ms |
796 KB |
23.txt |
AC |
24 ms |
924 KB |
24.txt |
AC |
23 ms |
796 KB |
25.txt |
AC |
24 ms |
720 KB |
26.txt |
AC |
24 ms |
804 KB |
27.txt |
AC |
23 ms |
804 KB |
28.txt |
AC |
24 ms |
744 KB |
29.txt |
AC |
22 ms |
800 KB |
3.txt |
AC |
24 ms |
932 KB |
4.txt |
AC |
22 ms |
804 KB |
5.txt |
AC |
24 ms |
924 KB |
6.txt |
AC |
24 ms |
760 KB |
7.txt |
AC |
22 ms |
928 KB |
8.txt |
AC |
24 ms |
916 KB |
9.txt |
AC |
24 ms |
920 KB |
subtask0_1.txt |
AC |
23 ms |
800 KB |
subtask0_2.txt |
AC |
23 ms |
804 KB |
subtask0_3.txt |
AC |
23 ms |
792 KB |