Submission #1771528
Source Code Expand
#include <cstdio> #include <cstring> #include <string> #include <cmath> #include <iostream> #include <algorithm> #include <map> #include <set> #include <queue> #include <vector> using namespace std; typedef long long ll; typedef unsigned int uint; typedef unsigned long long ull; typedef pair<int, int> PII; typedef vector<int> VI; #define fi first #define se second #define MP make_pair int read() { int v = 0, f = 1; char c = getchar(); while (c < 48 || 57 < c) {if (c == '-') f = -1; c = getchar();} while (48 <= c && c <= 57) v = (v << 3) + v + v + c - 48, c = getchar(); return v * f; } int n, k; char a[201000], ans[201000]; int main() { n = read(), k = read(); scanf("%s", a); int p = 0, flg = 0, s = 0; for (int i = 0; i < k; i++) { int q = (p + a[p] - 'A') % 2; s++; if (!q && !flg) { flg = 1; continue; } p++; flg = 0; if (p == n) break; } for (int i = p; i < n; i++) { ans[i - p] = a[i]; if (p & 1) if (ans[i - p] == 'A') ans[i - p] = 'B'; else ans[i - p] = 'A'; } if (flg) ans[0] = 'B'; for (int i = 0; i < p; i++) ans[n - i - 1] = 'A' + (i & 1); if (s < k && k % 2 != s % 2 && ans[0] == 'A') ans[0] = 'B'; printf("%s\n", ans); }
Submission Info
Submission Time | |
---|---|
Task | D - Half Reflector |
User | Misaka10032 |
Language | C++14 (GCC 5.4.1) |
Score | 900 |
Code Size | 1450 Byte |
Status | AC |
Exec Time | 3 ms |
Memory | 768 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:36:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%s", a); ^
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 | 2 ms | 768 KB |
in11.txt | AC | 3 ms | 768 KB |
in12.txt | AC | 2 ms | 768 KB |
in13.txt | AC | 2 ms | 768 KB |
in14.txt | AC | 3 ms | 768 KB |
in15.txt | AC | 2 ms | 768 KB |
in16.txt | AC | 2 ms | 768 KB |
in17.txt | AC | 3 ms | 768 KB |
in18.txt | AC | 3 ms | 768 KB |
in19.txt | AC | 2 ms | 768 KB |
in2.txt | AC | 2 ms | 512 KB |
in20.txt | AC | 3 ms | 768 KB |
in21.txt | AC | 3 ms | 768 KB |
in22.txt | AC | 3 ms | 768 KB |
in23.txt | AC | 3 ms | 768 KB |
in24.txt | AC | 3 ms | 768 KB |
in25.txt | AC | 3 ms | 768 KB |
in26.txt | AC | 3 ms | 768 KB |
in27.txt | AC | 3 ms | 768 KB |
in28.txt | AC | 2 ms | 768 KB |
in29.txt | AC | 2 ms | 768 KB |
in3.txt | AC | 3 ms | 768 KB |
in30.txt | AC | 3 ms | 768 KB |
in31.txt | AC | 3 ms | 768 KB |
in32.txt | AC | 3 ms | 768 KB |
in33.txt | AC | 3 ms | 768 KB |
in34.txt | AC | 3 ms | 768 KB |
in35.txt | AC | 3 ms | 768 KB |
in36.txt | AC | 3 ms | 768 KB |
in37.txt | AC | 3 ms | 768 KB |
in38.txt | AC | 3 ms | 768 KB |
in39.txt | AC | 2 ms | 768 KB |
in4.txt | AC | 3 ms | 768 KB |
in40.txt | AC | 3 ms | 768 KB |
in41.txt | AC | 3 ms | 768 KB |
in42.txt | AC | 2 ms | 768 KB |
in5.txt | AC | 3 ms | 768 KB |
in543.txt | AC | 2 ms | 768 KB |
in557.txt | AC | 3 ms | 768 KB |
in6.txt | AC | 1 ms | 256 KB |
in7.txt | AC | 3 ms | 768 KB |
in8.txt | AC | 3 ms | 768 KB |
in9.txt | AC | 3 ms | 768 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |