Submission #345169
Source Code Expand
#include <cstdlib> #include <cmath> #include <climits> #include <cfloat> #include <map> #include <utility> #include <set> #include <iostream> #include <memory> #include <string> #include <vector> #include <algorithm> #include <functional> #include <sstream> #include <deque> #include <complex> #include <stack> #include <queue> #include <cstdio> #include <cctype> #include <cstring> #include <ctime> #include <iterator> #include <bitset> #include <numeric> #include <list> #include <iomanip> #if __cplusplus >= 201103L #include <array> #include <tuple> #include <initializer_list> #include <unordered_set> #include <unordered_map> #include <forward_list> #define cauto const auto& #define ALL(v) begin(v),end(v) #else #define ALL(v) (v).begin(),(v).end() #endif using namespace std; namespace{ typedef long long LL; typedef pair<int,int> pii; typedef pair<LL,LL> pll; typedef vector<int> vint; typedef vector<vector<int> > vvint; typedef vector<long long> vll, vLL; typedef vector<vector<long long> > vvll, vvLL; #define VV(T) vector<vector< T > > template <class T> void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){ v.assign(a, vector<T>(b, t)); } template <class F, class T> void convert(const F &f, T &t){ stringstream ss; ss << f; ss >> t; } #define REP(i,n) for(int i=0;i<int(n);++i) #define RALL(v) (v).rbegin(),(v).rend() #define MOD 1000000007LL #define EPS 1e-8 void mainmain(){ string s; cin >> s; s += '$'; string t, u; for(size_t i = 0; i + 1 < s.size(); ){ size_t j; for(j = i; s[i] == s[j]; ++j); cerr<<i<<" "<<j<<endl; convert(j - i, u); t += s[i] + u; i = j; } cout << t << endl; } } int main() try{ // ios::sync_with_stdio(false); cout << fixed << setprecision(10); cerr << fixed << setprecision(4); mainmain(); } catch(...){}
Submission Info
Submission Time | |
---|---|
Task | B - 高橋くんと文字列圧縮 |
User | climpet |
Language | C++11 (GCC 4.8.1) |
Score | 100 |
Code Size | 1908 Byte |
Status | AC |
Exec Time | 32 ms |
Memory | 928 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 | 31 ms | 808 KB |
1.txt | AC | 32 ms | 788 KB |
10.txt | AC | 25 ms | 916 KB |
11.txt | AC | 27 ms | 800 KB |
12.txt | AC | 25 ms | 800 KB |
13.txt | AC | 25 ms | 800 KB |
14.txt | AC | 25 ms | 916 KB |
15.txt | AC | 25 ms | 800 KB |
16.txt | AC | 25 ms | 924 KB |
17.txt | AC | 25 ms | 800 KB |
18.txt | AC | 24 ms | 804 KB |
19.txt | AC | 26 ms | 804 KB |
2.txt | AC | 31 ms | 736 KB |
20.txt | AC | 23 ms | 908 KB |
21.txt | AC | 23 ms | 796 KB |
22.txt | AC | 25 ms | 676 KB |
23.txt | AC | 23 ms | 804 KB |
24.txt | AC | 22 ms | 928 KB |
25.txt | AC | 23 ms | 796 KB |
26.txt | AC | 25 ms | 792 KB |
27.txt | AC | 23 ms | 804 KB |
28.txt | AC | 25 ms | 796 KB |
29.txt | AC | 24 ms | 800 KB |
3.txt | AC | 30 ms | 920 KB |
4.txt | AC | 29 ms | 800 KB |
5.txt | AC | 30 ms | 800 KB |
6.txt | AC | 30 ms | 924 KB |
7.txt | AC | 30 ms | 800 KB |
8.txt | AC | 29 ms | 804 KB |
9.txt | AC | 29 ms | 704 KB |
subtask0_1.txt | AC | 24 ms | 920 KB |
subtask0_2.txt | AC | 24 ms | 692 KB |
subtask0_3.txt | AC | 23 ms | 800 KB |