Submission #409047
Source Code Expand
#include <iostream> #include <vector> using namespace std; int N; int main(int argc, const char * argv[]) { bool b=1; cin>>N; vector <char> str(N,0); for(int i=0;i<N;i++){ cin>>str[i]; } if(N%2==0){ cout<<-1<<"\n"; return 0; } int mid=(N-1)/2; for(int i=0;i<=mid;i++){ if(i%3==0){ if(str[mid+i]!='b' || str[mid-i]!='b'){ b=0; } } if(i%3==1){ if(str[mid+i]!='c' || str[mid-i]!='a'){ b=0; } } if(i%3==2){ if(str[mid+i]!='a' || str[mid-i]!='c'){ b=0; } } } if(b){ cout<<mid<<"\n"; } else{ cout<<"-1\n"; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 手芸王 |
User | saboten012 |
Language | C++ (GCC 4.9.2) |
Score | 100 |
Code Size | 835 Byte |
Status | AC |
Exec Time | 29 ms |
Memory | 928 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt, subtask0-sample04.txt |
All | subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt, subtask0-sample04.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, subtask1-14.txt, subtask1-15.txt, subtask1-16.txt, subtask1-17.txt, subtask1-18.txt, subtask1-19.txt, subtask1-20.txt, subtask1-21.txt, subtask1-22.txt, subtask1-23.txt, subtask1-24.txt, subtask1-25.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0-sample01.txt | AC | 25 ms | 924 KB |
subtask0-sample02.txt | AC | 24 ms | 800 KB |
subtask0-sample03.txt | AC | 29 ms | 928 KB |
subtask0-sample04.txt | AC | 25 ms | 920 KB |
subtask1-01.txt | AC | 24 ms | 800 KB |
subtask1-02.txt | AC | 28 ms | 924 KB |
subtask1-03.txt | AC | 25 ms | 736 KB |
subtask1-04.txt | AC | 24 ms | 928 KB |
subtask1-05.txt | AC | 26 ms | 920 KB |
subtask1-06.txt | AC | 26 ms | 792 KB |
subtask1-07.txt | AC | 23 ms | 924 KB |
subtask1-08.txt | AC | 23 ms | 924 KB |
subtask1-09.txt | AC | 23 ms | 928 KB |
subtask1-10.txt | AC | 23 ms | 796 KB |
subtask1-11.txt | AC | 25 ms | 676 KB |
subtask1-12.txt | AC | 25 ms | 800 KB |
subtask1-13.txt | AC | 25 ms | 796 KB |
subtask1-14.txt | AC | 23 ms | 808 KB |
subtask1-15.txt | AC | 25 ms | 924 KB |
subtask1-16.txt | AC | 25 ms | 928 KB |
subtask1-17.txt | AC | 23 ms | 796 KB |
subtask1-18.txt | AC | 25 ms | 916 KB |
subtask1-19.txt | AC | 24 ms | 840 KB |
subtask1-20.txt | AC | 24 ms | 920 KB |
subtask1-21.txt | AC | 25 ms | 804 KB |
subtask1-22.txt | AC | 24 ms | 924 KB |
subtask1-23.txt | AC | 23 ms | 924 KB |
subtask1-24.txt | AC | 23 ms | 748 KB |
subtask1-25.txt | AC | 23 ms | 928 KB |