Submission #5023348
Source Code Expand
#define _CRT_SECURE_NO_WARNINGS #include "bits/stdc++.h" using namespace std; #define rep(i, n) for(int i=0; i<(n); ++i) #define FOR(i, m, n) for(int i=(m); i<(n); ++i) #define sz(x) ((int)(x).size()) #define all(x) (x).begin(),(x).end() #define mp make_pair #define pb push_back #define Cout(x) cout << (x) << endl #define dump(x) cerr << #x << " = " << (x) << endl; typedef long long LL; typedef vector<int> VI; typedef vector<long long> VL; typedef vector<string> VS; typedef vector<vector<int>> VVI; typedef pair<int, int> PII; const int inf = (int)1e9; const long long mod = (long long)1e9 + 7; const double pi = acos(-1.0); int check(string s) { int re = 0; if (s[0] == 'O')s.erase(0, 1); if (sz(s) > 1 && s[sz(s) - 1] == 'O')s.erase(sz(s) - 1, 1); if (sz(s) > 2 && count(all(s), 'O') && s[0] == 'I' && s[sz(s) - 1]) { return sz(s); } else { return 0; } } int main() { string s; cin >> s; s.erase(unique(all(s)), s.end()); Cout(check(s)); }
Submission Info
Submission Time | |
---|---|
Task | A - IOI列車で行こう2 |
User | yuruhiya |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1003 Byte |
Status | WA |
Exec Time | 3 ms |
Memory | 384 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 30 | 0 / 70 | ||||||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | sample_1.txt, sample_2.txt, sample_3.txt |
Subtask1 | sample_1.txt, sample_2.txt, sample_3.txt, sub1_1.txt, sub1_2.txt, sub1_3.txt, sub1_4.txt, sub1_5.txt, sub1_6.txt, sub1_7.txt, sub1_8.txt, sub1_9.txt |
Subtask2 | sample_1.txt, sample_2.txt, sample_3.txt, sub1_1.txt, sub1_2.txt, sub1_3.txt, sub1_4.txt, sub1_5.txt, sub1_6.txt, sub1_7.txt, sub1_8.txt, sub1_9.txt, sub2_1.txt, sub2_2.txt, sub2_3.txt, sub2_4.txt, sub2_5.txt, sub2_6.txt, sub2_7.txt, sub2_8.txt, sub2_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_1.txt | AC | 1 ms | 256 KB |
sample_2.txt | AC | 1 ms | 256 KB |
sample_3.txt | AC | 1 ms | 256 KB |
sub1_1.txt | AC | 1 ms | 256 KB |
sub1_2.txt | AC | 1 ms | 256 KB |
sub1_3.txt | AC | 1 ms | 256 KB |
sub1_4.txt | AC | 1 ms | 256 KB |
sub1_5.txt | AC | 1 ms | 256 KB |
sub1_6.txt | WA | 1 ms | 256 KB |
sub1_7.txt | AC | 1 ms | 256 KB |
sub1_8.txt | AC | 1 ms | 256 KB |
sub1_9.txt | WA | 1 ms | 256 KB |
sub2_1.txt | AC | 1 ms | 256 KB |
sub2_2.txt | AC | 1 ms | 256 KB |
sub2_3.txt | AC | 1 ms | 256 KB |
sub2_4.txt | AC | 1 ms | 256 KB |
sub2_5.txt | AC | 1 ms | 256 KB |
sub2_6.txt | AC | 2 ms | 256 KB |
sub2_7.txt | AC | 2 ms | 256 KB |
sub2_8.txt | AC | 2 ms | 256 KB |
sub2_9.txt | AC | 3 ms | 384 KB |