Submission #348066


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define REPR(i,n) for (int i=(int)(n)-1;i>=0;--i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
#define valid(y,x,h,w) (0<=y&&y<h&&0<=x&&x<w)
#define tpl(...) make_tuple(__VA_ARGS__)
const int INF = 0x3f3f3f3f;
const double EPS = 1e-8;
const double PI = acos(-1);
const int dy[] = {-1,0,1,0};
const int dx[] = {0,1,0,-1};
typedef long long ll;
typedef pair<int,int> pii;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename Ch,typename Tr,typename C,typename=decltype(begin(C()))>basic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>&os,
const C& c){os<<'[';for(auto i=begin(c);i!=end(c);++i)os<<(i==begin(c)?"":" ")<<*i;return os<<']';}
template<class S,class T>ostream&operator<<(ostream &o,const pair<S,T>&t){return o<<'('<<t.first<<','<<t.second<<')';}
template<int N,class Tp>void output(ostream&,const Tp&){}
template<int N,class Tp,class,class ...Ts>void output(ostream &o,const Tp&t){if(N)o<<',';o<<get<N>(t);output<N+1,Tp,Ts...>(o,t);}
template<class ...Ts>ostream&operator<<(ostream&o,const tuple<Ts...>&t){o<<'(';output<0,tuple<Ts...>,Ts...>(o,t);return o<<')';}
template<class T>void output(T t,char z=10){if(t<0)t=-t,putchar(45);int c[20];
int k=0;while(t)c[k++]=t%10,t/=10;for(k||(c[k++]=0);k;)putchar(c[--k]^48);putchar(z);}
template<class T>void outputs(T t){output(t);}
template<class S,class ...T>void outputs(S a,T...t){output(a,32);outputs(t...);}
template<class T>void output(T *a,int n){REP(i,n)cout<<a[i]<<(i!=n-1?',':'\n');}
template<class T>void output(T *a,int n,int m){REP(i,n)output(a[i],m);}
template<class T>bool input(T &t){int n=1,c;for(t=0;!isdigit(c=getchar())&&~c&&c-45;);
if(!~c)return 0;for(c-45&&(n=0,t=c^48);isdigit(c=getchar());)t=10*t+c-48;t=n?-t:t;return 1;}
template<class S,class ...T>bool input(S&a,T&...t){input(a);return input(t...);}
template<class T>bool inputs(T *a, int n) { REP(i,n) if(!input(a[i])) return 0; return 1;}

int main() {
  string s;
  while(cin >> s) {
    char pre = ' ';
    int n = 0;
    stringstream ans;
    for (char c : s) {
      if (pre != c) {
        if (n) {
          ans << pre << n;
        }
        n = 0;
        pre = c;
      }
      ++n;
    }
    ans << pre << n;
    cout << ans.str() << endl;
  }
}

Submission Info

Submission Time
Task B - 高橋くんと文字列圧縮
User sune2
Language C++11 (GCC 4.8.1)
Score 100
Code Size 2542 Byte
Status AC
Exec Time 28 ms
Memory 928 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 33
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 27 ms 916 KB
1.txt AC 24 ms 916 KB
10.txt AC 24 ms 920 KB
11.txt AC 26 ms 916 KB
12.txt AC 24 ms 920 KB
13.txt AC 25 ms 920 KB
14.txt AC 26 ms 920 KB
15.txt AC 24 ms 916 KB
16.txt AC 25 ms 792 KB
17.txt AC 28 ms 920 KB
18.txt AC 25 ms 916 KB
19.txt AC 24 ms 916 KB
2.txt AC 24 ms 920 KB
20.txt AC 25 ms 796 KB
21.txt AC 26 ms 920 KB
22.txt AC 26 ms 920 KB
23.txt AC 27 ms 856 KB
24.txt AC 26 ms 916 KB
25.txt AC 26 ms 912 KB
26.txt AC 26 ms 916 KB
27.txt AC 25 ms 804 KB
28.txt AC 27 ms 920 KB
29.txt AC 25 ms 920 KB
3.txt AC 25 ms 928 KB
4.txt AC 25 ms 804 KB
5.txt AC 25 ms 924 KB
6.txt AC 26 ms 924 KB
7.txt AC 26 ms 916 KB
8.txt AC 27 ms 924 KB
9.txt AC 25 ms 920 KB
subtask0_1.txt AC 25 ms 916 KB
subtask0_2.txt AC 25 ms 920 KB
subtask0_3.txt AC 26 ms 920 KB