Submission #323468
Source Code Expand
#include <iostream> #include <sstream> #include <fstream> #include <string> #include <vector> #include <deque> #include <queue> #include <stack> #include <set> #include <map> #include <algorithm> #include <utility> #include <bitset> #include <cmath> #include <cstdlib> #include <ctime> #include <cstring> #include <cstdio> using namespace std; #define REP(i,n) for((i)=0;(i)<(int)(n);(i)++) #define foreach(c,itr) for(__typeof((c).begin()) itr=(c).begin();itr!=(c).end();itr++) int add(int len) { int elems = len/2; return (elems * (elems+1) / 2); } int main() { string s; while (cin>>s) { int ans = 0; char c = '_'; int len = 0; const int N = s.size(); for (int i = 0; i < N; i++) { char load = s[i]; //printf("len=%d\n", len); if (c == '_') { if (load != '2') continue; c = load; len++; } else { if (c == '2') { if (load == '5') { len++; c = load; } else { if (len) { ans += add(len); } c = '_'; len = 0; } } else if (c == '5') { if (load == '2') { c = load; len++; } else { if (len) { ans += add(len); } c = '_'; len = 0; } } if (c == '_' && load == '2') { len++; c = '2'; } } } if (len) { ans += add(len); } cout << ans << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - ニコニコ文字列 |
User | brly |
Language | C++ (G++ 4.6.4) |
Score | 30 |
Code Size | 1681 Byte |
Status | WA |
Exec Time | 31 ms |
Memory | 1056 KB |
Judge Result
Set Name | Sample | Subtask1 | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 30 / 30 | 0 / 70 | ||||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask0_sample_05.txt |
Subtask1 | subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask0_sample_05.txt |
All | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask0_sample_05.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample_01.txt | AC | 25 ms | 804 KB |
subtask0_sample_02.txt | AC | 24 ms | 792 KB |
subtask0_sample_03.txt | AC | 27 ms | 800 KB |
subtask0_sample_04.txt | AC | 24 ms | 804 KB |
subtask0_sample_05.txt | AC | 24 ms | 796 KB |
subtask1_01.txt | AC | 24 ms | 748 KB |
subtask1_02.txt | AC | 24 ms | 812 KB |
subtask1_03.txt | AC | 25 ms | 920 KB |
subtask1_04.txt | AC | 24 ms | 928 KB |
subtask1_05.txt | AC | 24 ms | 744 KB |
subtask1_06.txt | AC | 25 ms | 800 KB |
subtask1_07.txt | AC | 25 ms | 920 KB |
subtask1_08.txt | AC | 24 ms | 804 KB |
subtask1_09.txt | AC | 25 ms | 924 KB |
subtask1_10.txt | AC | 25 ms | 920 KB |
subtask1_11.txt | AC | 24 ms | 800 KB |
subtask1_12.txt | AC | 25 ms | 928 KB |
subtask1_13.txt | AC | 24 ms | 924 KB |
subtask2_01.txt | AC | 31 ms | 928 KB |
subtask2_02.txt | AC | 29 ms | 1056 KB |
subtask2_03.txt | AC | 31 ms | 936 KB |
subtask2_04.txt | AC | 30 ms | 932 KB |
subtask2_05.txt | AC | 31 ms | 932 KB |
subtask2_06.txt | AC | 31 ms | 928 KB |
subtask2_07.txt | WA | 31 ms | 936 KB |
subtask2_08.txt | AC | 30 ms | 928 KB |
subtask2_09.txt | AC | 25 ms | 924 KB |
subtask2_10.txt | AC | 25 ms | 928 KB |
subtask2_11.txt | AC | 24 ms | 800 KB |
subtask2_12.txt | AC | 25 ms | 928 KB |