Submission #1872856
Source Code Expand
#define _CRT_SECURE_NO_WARNINGS #include <vector> #include <iostream> #include <string.h> #include <set> #include <algorithm> #include <cmath> #include <string> using namespace std; typedef double LD; typedef long long LL; typedef pair<int, int> PII; #define MP make_pair #define PB push_back #define FOR(i,a,b) for(int i = (a); i < (b); ++i) #define RFOR(i,b,a) for(int i = (b) - 1; i >= (a); --i) #define REP(i, t) FOR(i,0,t) #define ALL(a) a.begin(), a.end() #define SZ(a) (int)((a).size()) const LL MOD = 1000000007; const int INF = 1e9; const LL LINF = 1LL * INF * INF; const int MAXN = 200007; const LD EPS = 1e-7; string S; bool L[MAXN]; void brute(string &T) { int pos = 0, w = 1; while (pos >= 0 && pos < SZ(T)) { if (T[pos] == 'A') { T[pos] = 'B'; w *= -1; } else T[pos] = 'A'; pos += w; } } int main() { ios_base::sync_with_stdio(0); //freopen("In.txt", "r", stdin); int n, k; cin >> n >> k >> S; bool o = k & 1; k = min(k, 2 * n + 2); if ((k ^ o) & 1) k ^= 1; int it = 0; while (k && it++ < 7) { --k; brute(S); } while (k && (S[0] == 'A' || S[n - 1] == 'B')) { --k; brute(S); } if (k == 0) { cout << S; return 0; } string T = S; brute(T); brute(T); if (T == S) k &= 1; int p = 0, cnt = 0; REP(i, n) { L[i] = (i == n - 1 || S[i + 1] != S[i]); cnt += L[i]; } while (p < n && k--) { if (cnt & 1) { if (L[p]) --cnt; else ++cnt; L[p] ^= 1; continue; } if (!L[p++]) ++cnt; } int pr = 0; while (p < n) { cout << ((cnt & 1) ? 'A' : 'B'); if (L[p++]) --cnt; ++pr; } while (pr < n) { cout << (((n - pr) & 1) ? 'A' : 'B'); ++pr; } //cout << endl; system("pause"); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Half Reflector |
User | vjudge3 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1705 Byte |
Status | WA |
Exec Time | 23 ms |
Memory | 1176 KB |
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 | 256 KB |
in10.txt | WA | 14 ms | 1172 KB |
in11.txt | AC | 21 ms | 1172 KB |
in12.txt | AC | 13 ms | 1172 KB |
in13.txt | AC | 14 ms | 1172 KB |
in14.txt | AC | 23 ms | 1172 KB |
in15.txt | AC | 14 ms | 1172 KB |
in16.txt | AC | 17 ms | 1172 KB |
in17.txt | AC | 21 ms | 1172 KB |
in18.txt | AC | 12 ms | 1172 KB |
in19.txt | AC | 17 ms | 1172 KB |
in2.txt | AC | 10 ms | 720 KB |
in20.txt | AC | 17 ms | 1172 KB |
in21.txt | AC | 12 ms | 1172 KB |
in22.txt | AC | 16 ms | 1172 KB |
in23.txt | AC | 19 ms | 1172 KB |
in24.txt | AC | 17 ms | 1172 KB |
in25.txt | AC | 21 ms | 1172 KB |
in26.txt | WA | 23 ms | 1172 KB |
in27.txt | AC | 19 ms | 1172 KB |
in28.txt | AC | 16 ms | 1172 KB |
in29.txt | AC | 18 ms | 1172 KB |
in3.txt | AC | 19 ms | 1172 KB |
in30.txt | AC | 18 ms | 1172 KB |
in31.txt | AC | 19 ms | 1172 KB |
in32.txt | AC | 19 ms | 1172 KB |
in33.txt | AC | 17 ms | 1172 KB |
in34.txt | AC | 19 ms | 1172 KB |
in35.txt | AC | 21 ms | 1172 KB |
in36.txt | AC | 21 ms | 1172 KB |
in37.txt | AC | 17 ms | 1172 KB |
in38.txt | AC | 19 ms | 1172 KB |
in39.txt | AC | 20 ms | 1172 KB |
in4.txt | AC | 21 ms | 1172 KB |
in40.txt | AC | 19 ms | 1172 KB |
in41.txt | AC | 18 ms | 1172 KB |
in42.txt | AC | 21 ms | 1172 KB |
in5.txt | AC | 21 ms | 1176 KB |
in543.txt | AC | 20 ms | 1172 KB |
in557.txt | AC | 18 ms | 1172 KB |
in6.txt | AC | 1 ms | 256 KB |
in7.txt | AC | 21 ms | 1172 KB |
in8.txt | AC | 18 ms | 1172 KB |
in9.txt | AC | 19 ms | 1172 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |