Submission #1159013

Source Code Expand

#include <bits/stdc++.h>

#define x first
#define y second

using namespace std;

typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> ii;
typedef pair<ll,ll> pll;

const int mod=1000000000+7;

int addm(int& a,int b) {return (a+=b)<mod?a:a-=mod;}

template<class T,class U> bool smin(T& a,U b) {return a>b?(a=b,1):0;}
template<class T,class U> bool smax(T& a,U b) {return a<b?(a=b,1):0;}

int N,K,opc;
string s;

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);

	cin >> N >> K >> s;
	int i=0;
	bool f;
	int shif;
	for (int i=0;i<N && opc<K;i++) {
		if ((s[i]=='A')==(i%2==0)) {
			f=1;
			opc++;
			if (opc==K) break;
		}
		else f=0;
		opc++;
		shif++;

		//cerr << '1' << endl;
	}

	K-=opc;
	stringstream ans;

	if (K) {
	   if (N%2 && K%2) f=1;
	   else f=0;
	}
	//if (K==0) {
		for (;i<N;i++) {if ((shif%2==0)==(s[i]=='A')) ans << 'A';
		else ans << 'B';
		//cerr << "2" << endl;
		}
		for (int j=N-shif;j<N;j++) {if ((N-j)%2==1) ans << 'A';
		else ans << 'B';
		//cerr << "3" << endl;
		}
		string ss;
		ans >> ss;
		if (f==(ss[0]=='A')) ss[0]='B';
		else ss[0]='A';

		cout << ss.substr(ss.size()-N-1) << endl;
		return 0;
	//}


}

Submission Info

Submission Time
Task D - Half Reflector
User Whalanator
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1274 Byte
Status RE
Exec Time 104 ms
Memory 1688 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 900
Status
WA × 2
RE × 1
WA × 48
RE × 2
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 WA 1 ms 256 KiB
in10.txt WA 11 ms 1684 KiB
in11.txt WA 12 ms 1684 KiB
in12.txt WA 11 ms 1684 KiB
in13.txt WA 11 ms 1684 KiB
in14.txt WA 12 ms 1684 KiB
in15.txt WA 11 ms 1684 KiB
in16.txt WA 11 ms 1684 KiB
in17.txt WA 11 ms 1556 KiB
in18.txt WA 11 ms 1684 KiB
in19.txt WA 11 ms 1684 KiB
in2.txt WA 4 ms 848 KiB
in20.txt WA 11 ms 1556 KiB
in21.txt WA 11 ms 1684 KiB
in22.txt WA 12 ms 1684 KiB
in23.txt WA 12 ms 1684 KiB
in24.txt WA 12 ms 1684 KiB
in25.txt WA 12 ms 1684 KiB
in26.txt WA 12 ms 1684 KiB
in27.txt WA 12 ms 1684 KiB
in28.txt WA 9 ms 1428 KiB
in29.txt WA 9 ms 1428 KiB
in3.txt WA 10 ms 1556 KiB
in30.txt WA 9 ms 1428 KiB
in31.txt WA 10 ms 1556 KiB
in32.txt WA 10 ms 1556 KiB
in33.txt WA 10 ms 1556 KiB
in34.txt WA 11 ms 1556 KiB
in35.txt WA 12 ms 1684 KiB
in36.txt WA 12 ms 1684 KiB
in37.txt WA 12 ms 1684 KiB
in38.txt WA 12 ms 1684 KiB
in39.txt WA 10 ms 1428 KiB
in4.txt WA 12 ms 1684 KiB
in40.txt WA 9 ms 1428 KiB
in41.txt WA 9 ms 1428 KiB
in42.txt WA 10 ms 1428 KiB
in5.txt WA 12 ms 1688 KiB
in543.txt WA 7 ms 1300 KiB
in557.txt WA 7 ms 1300 KiB
in6.txt WA 1 ms 256 KiB
in7.txt WA 11 ms 1556 KiB
in8.txt WA 12 ms 1684 KiB
in9.txt WA 10 ms 1556 KiB
sample1.txt RE 104 ms 384 KiB
sample2.txt WA 1 ms 256 KiB
sample3.txt WA 1 ms 256 KiB