Submission #1159131
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef signed long long ll; #undef _P #define _P(...) (void)printf(__VA_ARGS__) #define FOR(x,to) for(x=0;x<(to);x++) #define FORR(x,arr) for(auto& x:arr) #define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++) #define ALL(a) (a.begin()),(a.end()) #define ZERO(a) memset(a,0,sizeof(a)) #define MINUS(a) memset(a,0xff,sizeof(a)) //------------------------------------------------------- int N,K; string S; string T; void solve() { int i,j,k,l,r,x,y; string s; cin>>N>>K>>S; int pos=0,rev=0,revn=0; while(K-->0){ if((S[pos]=='A') ^ rev ^ revn) { revn^=1; } else { pos++; revn = 0; rev ^=1; } if(pos==N) break; } string R; if(pos==N) { while(R.size()<N) { if((N-R.size())%2==1) R+='A'; else R+='B'; } if(R[0]=='A' && K%2) R[0]='B'; } else { int first=1; while(pos<N) { if(rev ^ ((first==1)&&revn)) { R+='A'+'B'-S[pos]; } else { R+=S[pos]; } pos++; first=0; } while(R.size()<N) { if((N-R.size())%2==1) R+='A'; else R+='B'; } } cout<<R<<endl; /* T=S; FOR(i,100) { int x=0,side=0; while(x>=0 && x<N) { S[x]='A'+'B'-S[x]; if(side==0) { if(S[x]=='B') x--, side=1; else x++; } else { if(S[x]=='B') x++, side=0; else x--; } } if(T[0]=='A') T[0]='B'; else { T=T.substr(1); FORR(c,T) c='A'+'B'-c; T+='A'; } cout<<(i+1)<<"\t"<<S<<endl; } */ } int main(int argc,char** argv){ string s;int i; if(argc==1) ios::sync_with_stdio(false), cin.tie(0); FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin); solve(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Half Reflector |
User | kmjp |
Language | C++14 (GCC 5.4.1) |
Score | 900 |
Code Size | 1776 Byte |
Status | AC |
Exec Time | 4 ms |
Memory | 1048 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 900 / 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 | 256 KB |
in10.txt | AC | 3 ms | 1044 KB |
in11.txt | AC | 4 ms | 1044 KB |
in12.txt | AC | 3 ms | 1044 KB |
in13.txt | AC | 3 ms | 1044 KB |
in14.txt | AC | 4 ms | 1044 KB |
in15.txt | AC | 3 ms | 1044 KB |
in16.txt | AC | 3 ms | 1044 KB |
in17.txt | AC | 4 ms | 1044 KB |
in18.txt | AC | 3 ms | 1044 KB |
in19.txt | AC | 3 ms | 1044 KB |
in2.txt | AC | 2 ms | 720 KB |
in20.txt | AC | 3 ms | 1044 KB |
in21.txt | AC | 3 ms | 1044 KB |
in22.txt | AC | 4 ms | 1044 KB |
in23.txt | AC | 4 ms | 1044 KB |
in24.txt | AC | 4 ms | 1044 KB |
in25.txt | AC | 4 ms | 1044 KB |
in26.txt | AC | 4 ms | 1044 KB |
in27.txt | AC | 4 ms | 1044 KB |
in28.txt | AC | 3 ms | 1044 KB |
in29.txt | AC | 3 ms | 1044 KB |
in3.txt | AC | 3 ms | 1044 KB |
in30.txt | AC | 3 ms | 1044 KB |
in31.txt | AC | 3 ms | 1044 KB |
in32.txt | AC | 3 ms | 1044 KB |
in33.txt | AC | 4 ms | 1044 KB |
in34.txt | AC | 4 ms | 1044 KB |
in35.txt | AC | 4 ms | 1044 KB |
in36.txt | AC | 4 ms | 1044 KB |
in37.txt | AC | 4 ms | 1044 KB |
in38.txt | AC | 4 ms | 1044 KB |
in39.txt | AC | 3 ms | 1044 KB |
in4.txt | AC | 4 ms | 1044 KB |
in40.txt | AC | 3 ms | 1044 KB |
in41.txt | AC | 3 ms | 1044 KB |
in42.txt | AC | 3 ms | 1044 KB |
in5.txt | AC | 4 ms | 1048 KB |
in543.txt | AC | 2 ms | 1044 KB |
in557.txt | AC | 2 ms | 1044 KB |
in6.txt | AC | 1 ms | 256 KB |
in7.txt | AC | 4 ms | 1044 KB |
in8.txt | AC | 4 ms | 1044 KB |
in9.txt | AC | 3 ms | 1044 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |