Submission #1774200
Source Code Expand
#include<cstdio> #include<cstring> using namespace std; char str[800100]; int n,k; void solve(){ int p=1,dr=1; while(p>0&&p<=n){ if(str[p]=='A'){ str[p]='B'; dr=-dr; p+=dr; } else{ str[p]='A'; p+=dr; } } } int main(){ // freopen("D.in","r",stdin); scanf("%d%d",&n,&k); scanf("%s",str+1); for(int i=n+1;i<=n*4;i++) str[i]='A'+((i-n)&1); if(k<=n*2){ int res=0,p=1,cnt=0; for(int i=1;i<=k;i++){ if(str[p]-'A'==((res+(cnt&1))&1)) res^=1; else{ cnt++,p++; res=0; } } for(int j=1;j<=n;j++){ if(cnt&1) str[j]='A'+'B'-str[j+cnt]; else str[j]=str[j+cnt]; } if(res) solve(); } else{ int res=0,p=1,cnt=0; for(int i=1;i<=k;i++){ if(str[p]-'A'==((res+(cnt&1))&1)) res^=1; else{ cnt++,p++; res=0; } } for(int j=1;j<=n;j++){ if(cnt&1) str[j]='A'+'B'-str[j+cnt]; else str[j]=str[j+cnt]; } if(res) solve(); k-=n*2; if((n&1)&&(k&1)) str[1]='A'+'B'-str[1]; } for(int i=1;i<=n;i++) printf("%c",str[i]); printf("\n"); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Half Reflector |
User | xzkflowey |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1101 Byte |
Status | RE |
Exec Time | 120 ms |
Memory | 1152 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:23:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d",&n,&k); ^ ./Main.cpp:24:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%s",str+1); ^
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 900 | ||||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample1.txt, sample2.txt, sample3.txt |
All | sample1.txt, sample2.txt, sample3.txt, in1.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in2.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in3.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in4.txt, in40.txt, in41.txt, in42.txt, in5.txt, in543.txt, in557.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt, sample3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
in1.txt | AC | 1 ms | 128 KB |
in10.txt | AC | 4 ms | 1152 KB |
in11.txt | AC | 5 ms | 1152 KB |
in12.txt | AC | 4 ms | 1152 KB |
in13.txt | AC | 4 ms | 1152 KB |
in14.txt | AC | 5 ms | 1152 KB |
in15.txt | AC | 4 ms | 1152 KB |
in16.txt | AC | 4 ms | 1152 KB |
in17.txt | AC | 5 ms | 1152 KB |
in18.txt | AC | 4 ms | 1152 KB |
in19.txt | AC | 4 ms | 1152 KB |
in2.txt | AC | 2 ms | 640 KB |
in20.txt | AC | 5 ms | 1152 KB |
in21.txt | AC | 4 ms | 1152 KB |
in22.txt | RE | 120 ms | 896 KB |
in23.txt | RE | 101 ms | 896 KB |
in24.txt | RE | 101 ms | 896 KB |
in25.txt | RE | 102 ms | 896 KB |
in26.txt | RE | 102 ms | 896 KB |
in27.txt | RE | 101 ms | 896 KB |
in28.txt | AC | 4 ms | 1152 KB |
in29.txt | AC | 4 ms | 1152 KB |
in3.txt | AC | 5 ms | 1152 KB |
in30.txt | AC | 4 ms | 1152 KB |
in31.txt | AC | 4 ms | 1152 KB |
in32.txt | AC | 4 ms | 1152 KB |
in33.txt | AC | 4 ms | 1152 KB |
in34.txt | AC | 5 ms | 1152 KB |
in35.txt | AC | 5 ms | 1152 KB |
in36.txt | AC | 5 ms | 1152 KB |
in37.txt | AC | 5 ms | 1152 KB |
in38.txt | AC | 5 ms | 1152 KB |
in39.txt | AC | 4 ms | 1152 KB |
in4.txt | RE | 101 ms | 896 KB |
in40.txt | AC | 4 ms | 1152 KB |
in41.txt | AC | 4 ms | 1152 KB |
in42.txt | AC | 4 ms | 1152 KB |
in5.txt | RE | 103 ms | 896 KB |
in543.txt | AC | 4 ms | 1152 KB |
in557.txt | AC | 4 ms | 1152 KB |
in6.txt | RE | 100 ms | 128 KB |
in7.txt | AC | 4 ms | 1152 KB |
in8.txt | RE | 101 ms | 896 KB |
in9.txt | AC | 4 ms | 1152 KB |
sample1.txt | AC | 1 ms | 128 KB |
sample2.txt | AC | 1 ms | 128 KB |
sample3.txt | RE | 100 ms | 128 KB |