Submission #1245437
Source Code Expand
#include<iostream> using namespace std; int main(){ int n; string s; cin >> n >> s; int st; if(s[0]=='a')st=0; if(s[0]=='b')st=1; if(s[0]=='c')st=2; for(int i = 1;i<n;i++){ if(st==0&&s[i]=='b'){ st=1; }else if(st==1&&s[i]=='c'){ st=2; }else if(st==2&&s[i]=='a'){ st=0; }else{ cout << -1 << endl; return 0; } } if(n%2==0){ cout << -1 << endl; return 0; } if(s[0]=='a'&&s[n-1]=='a'){ cout << -1 << endl; return 0; } if(s[0]=='c'&&s[n-1]=='c'){ cout << -1 << endl; return 0; } if(s[0]=='b'&&s[n-1]=='a'){ cout << -1 << endl; return 0; } if(s[0]=='b'&&s[n-1]=='c'){ cout << -1 << endl; return 0; } if(s[0]=='a'&&s[n-1]=='b'){ cout << -1 << endl; return 0; } if(s[0]=='c'&&s[n-1]=='b'){ cout << -1 << endl; return 0; } cout << n/2 << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 手芸王 |
User | shichinomiya |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 908 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 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 | 1 ms | 256 KB |
subtask0-sample02.txt | AC | 1 ms | 256 KB |
subtask0-sample03.txt | AC | 1 ms | 256 KB |
subtask0-sample04.txt | AC | 1 ms | 256 KB |
subtask1-01.txt | AC | 1 ms | 256 KB |
subtask1-02.txt | AC | 1 ms | 256 KB |
subtask1-03.txt | AC | 1 ms | 256 KB |
subtask1-04.txt | AC | 1 ms | 256 KB |
subtask1-05.txt | AC | 1 ms | 256 KB |
subtask1-06.txt | AC | 1 ms | 256 KB |
subtask1-07.txt | AC | 1 ms | 256 KB |
subtask1-08.txt | AC | 1 ms | 256 KB |
subtask1-09.txt | AC | 1 ms | 256 KB |
subtask1-10.txt | AC | 1 ms | 256 KB |
subtask1-11.txt | AC | 1 ms | 256 KB |
subtask1-12.txt | AC | 1 ms | 256 KB |
subtask1-13.txt | AC | 1 ms | 256 KB |
subtask1-14.txt | AC | 1 ms | 256 KB |
subtask1-15.txt | AC | 1 ms | 256 KB |
subtask1-16.txt | AC | 1 ms | 256 KB |
subtask1-17.txt | AC | 1 ms | 256 KB |
subtask1-18.txt | AC | 1 ms | 256 KB |
subtask1-19.txt | AC | 1 ms | 256 KB |
subtask1-20.txt | AC | 1 ms | 256 KB |
subtask1-21.txt | AC | 1 ms | 256 KB |
subtask1-22.txt | AC | 1 ms | 256 KB |
subtask1-23.txt | AC | 1 ms | 256 KB |
subtask1-24.txt | AC | 1 ms | 256 KB |
subtask1-25.txt | AC | 1 ms | 256 KB |