Submission #1873447
Source Code Expand
#define _CRT_SECURE_NO_WARNINGS #include <vector> #include <iostream> #include <string.h> #include <set> #include <algorithm> #include <cmath> #include <queue> 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; deque <char> D; int main() { ios_base::sync_with_stdio(0); //freopen("In.txt", "r", stdin); int n, k, neg = 0; cin >> n >> k; REP(i, n) { char c; cin >> c; D.push_back(c); } bool o = k & 1; k = min(k, 2 * n); if ((k ^ o) & 1) k ^= 1; REP(i, k) { if ((D.front() == 'A') ^ (neg & 1)) { D.pop_front(); if (neg & 1) D.push_front('A'); else D.push_front('B'); continue; } ++neg; D.pop_front(); if (neg & 1) D.push_back('B'); else D.push_back('A'); } if (neg & 1) { REP(i, n) { if (D.front() == 'A') cout << 'B'; else cout << 'A'; D.pop_front(); } } else REP(i, n) { cout << D.front(); D.pop_front(); } //cout << endl; system("pause"); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Half Reflector |
User | vjudge2 |
Language | C++14 (GCC 5.4.1) |
Score | 900 |
Code Size | 1359 Byte |
Status | AC |
Exec Time | 12 ms |
Memory | 640 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 | 10 ms | 640 KB |
in11.txt | AC | 11 ms | 640 KB |
in12.txt | AC | 10 ms | 640 KB |
in13.txt | AC | 11 ms | 640 KB |
in14.txt | AC | 11 ms | 640 KB |
in15.txt | AC | 10 ms | 640 KB |
in16.txt | AC | 10 ms | 640 KB |
in17.txt | AC | 11 ms | 640 KB |
in18.txt | AC | 11 ms | 640 KB |
in19.txt | AC | 10 ms | 640 KB |
in2.txt | AC | 5 ms | 512 KB |
in20.txt | AC | 11 ms | 640 KB |
in21.txt | AC | 11 ms | 640 KB |
in22.txt | AC | 12 ms | 640 KB |
in23.txt | AC | 12 ms | 640 KB |
in24.txt | AC | 12 ms | 640 KB |
in25.txt | AC | 12 ms | 640 KB |
in26.txt | AC | 12 ms | 640 KB |
in27.txt | AC | 12 ms | 640 KB |
in28.txt | AC | 10 ms | 640 KB |
in29.txt | AC | 10 ms | 640 KB |
in3.txt | AC | 11 ms | 640 KB |
in30.txt | AC | 10 ms | 640 KB |
in31.txt | AC | 10 ms | 640 KB |
in32.txt | AC | 11 ms | 640 KB |
in33.txt | AC | 11 ms | 640 KB |
in34.txt | AC | 11 ms | 640 KB |
in35.txt | AC | 11 ms | 640 KB |
in36.txt | AC | 11 ms | 640 KB |
in37.txt | AC | 12 ms | 640 KB |
in38.txt | AC | 12 ms | 640 KB |
in39.txt | AC | 10 ms | 640 KB |
in4.txt | AC | 12 ms | 640 KB |
in40.txt | AC | 10 ms | 640 KB |
in41.txt | AC | 10 ms | 640 KB |
in42.txt | AC | 10 ms | 640 KB |
in5.txt | AC | 12 ms | 640 KB |
in543.txt | AC | 9 ms | 640 KB |
in557.txt | AC | 10 ms | 640 KB |
in6.txt | AC | 1 ms | 256 KB |
in7.txt | AC | 11 ms | 640 KB |
in8.txt | AC | 12 ms | 640 KB |
in9.txt | AC | 10 ms | 640 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |