Submission #1864428


Source Code Expand

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define forE(i,x) for(int i=head[x];i!=-1;i=ne[i])
using namespace std;
typedef long long i64;
typedef unsigned long long u64;
typedef unsigned u32;
typedef pair<int,int> pin;
#define mk(a,b) make_pair(a,b)
#define lowbit(x) ((x)&(-(x)))
#define sqr(a) ((a)*(a))
#define clr(a) (memset((a),0,sizeof(a)))
#define ls ((x)<<1)
#define rs (((x)<<1)|1)
#define mid (((l)+(r))>>1)
#define pb push_back
#define w1 first
#define w2 second
inline void read(int &x){
	x=0;int f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	x*=f;
}
inline void judge(){
	freopen("in.txt","r",stdin);
	freopen("out.txt","w",stdout);
}
/*******************************head*******************************/
const int maxn=1000005;
char s[maxn];
int a[maxn],q[maxn],n,m;
inline void solve(int k){
	int l=1,r=n,tag=0;
	rep(i,1,n)q[i]=s[i]-'A';
	rep(i,1,k){
		if((tag^q[l])==0)
			q[l]^=1;
		else{
			l++;tag^=1;
			q[++r]=tag;
		}
	}
	rep(i,1,n)a[i]=q[l+i-1]^tag;
}
int main(){
//	judge();
	read(n);read(m);scanf("%s",s+1);
	if(m<=2*n)
		solve(m);
	else 
		if(m&1)
			solve(2*n-1);
		else
			solve(2*n);
	rep(i,1,n)putchar('A'+a[i]);
	return 0;
}

Submission Info

Submission Time
Task D - Half Reflector
User Scape
Language C++14 (GCC 5.4.1)
Score 900
Code Size 1371 Byte
Status AC
Exec Time 7 ms
Memory 8576 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:49:33: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  read(n);read(m);scanf("%s",s+1);
                                 ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 900 / 900
Status
AC × 3
AC × 50
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 2 ms 4352 KB
in10.txt AC 6 ms 8192 KB
in11.txt AC 7 ms 8192 KB
in12.txt AC 6 ms 8192 KB
in13.txt AC 6 ms 8192 KB
in14.txt AC 7 ms 8192 KB
in15.txt AC 6 ms 8192 KB
in16.txt AC 6 ms 8192 KB
in17.txt AC 6 ms 7936 KB
in18.txt AC 6 ms 8192 KB
in19.txt AC 6 ms 8192 KB
in2.txt AC 4 ms 6912 KB
in20.txt AC 6 ms 7936 KB
in21.txt AC 7 ms 8192 KB
in22.txt AC 7 ms 8576 KB
in23.txt AC 7 ms 8576 KB
in24.txt AC 7 ms 8576 KB
in25.txt AC 7 ms 8320 KB
in26.txt AC 7 ms 8320 KB
in27.txt AC 7 ms 8320 KB
in28.txt AC 6 ms 7680 KB
in29.txt AC 6 ms 7680 KB
in3.txt AC 6 ms 7936 KB
in30.txt AC 6 ms 7680 KB
in31.txt AC 6 ms 7808 KB
in32.txt AC 6 ms 7808 KB
in33.txt AC 6 ms 7936 KB
in34.txt AC 7 ms 7936 KB
in35.txt AC 7 ms 8064 KB
in36.txt AC 7 ms 8192 KB
in37.txt AC 7 ms 8320 KB
in38.txt AC 7 ms 8576 KB
in39.txt AC 6 ms 7680 KB
in4.txt AC 7 ms 8576 KB
in40.txt AC 6 ms 7680 KB
in41.txt AC 6 ms 7680 KB
in42.txt AC 6 ms 7680 KB
in5.txt AC 7 ms 8576 KB
in543.txt AC 5 ms 7424 KB
in557.txt AC 5 ms 7424 KB
in6.txt AC 2 ms 4352 KB
in7.txt AC 6 ms 7936 KB
in8.txt AC 7 ms 8576 KB
in9.txt AC 6 ms 7808 KB
sample1.txt AC 2 ms 4352 KB
sample2.txt AC 2 ms 4352 KB
sample3.txt AC 2 ms 4352 KB