Submission #1371383
Source Code Expand
/* _ _ _______ _ _ | | / / | _____| | | / / | | / / | | | | / / | |/ / | |_____ | |/ / | |\ \ | _____| | |\ \ | | \ \ | | | | \ \ | | \ \ | |_____ | | \ \ |_| \_\ |_______| |_| \_\ */ /*#include <iostream> #include <cstdio> #include <set> #include <map> #include <stack> #include <queue> #include <vector> #include <cstring> #include <string> #include <iomanip> #include <cmath> #include <algorithm> #include <assert.h>*/ #include <bits/stdc++.h> using namespace std; typedef unsigned long long ull; typedef long long ll; typedef double ld; typedef pair <int, int> PII; typedef pair <ll, ll> PLL; #define F first #define S second #define pb push_back #define eb emplace_back #define right(x) x << 1 | 1 #define left(x) x << 1 #define forn(x, a, b) for (int x = a; x <= b; ++x) #define for1(x, a, b) for (int x = a; x >= b; --x) #define mkp make_pair #define sz(a) (int)a.size() #define all(a) a.begin(), a.end() #define y1 kekekek const ll ool = 1e18 + 9; const int oo = 1e9 + 9, base = 1e9 + 7; const ld eps = 1e-7; const int N = 2e6 + 6; int n, K; bool a[N]; int main() { ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> n >> K; forn(i, 1, n) { char x; cin >> x; a[i] = (x == 'B'); } int ptr = 1, q = 0; forn(it, 1, min(2 * n + (K > 2 * n && (K - 2 * n) & 1), K)) { if (!(a[ptr] ^ q)) { a[ptr] ^= 1; continue; } q ^= 1; a[ptr + n] = q; ++ptr; } forn(i, ptr, ptr + n - 1) { cout << (a[i] ^ q ? "B" : "A"); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Half Reflector |
User | krauch |
Language | C++14 (GCC 5.4.1) |
Score | 900 |
Code Size | 1709 Byte |
Status | AC |
Exec Time | 10 ms |
Memory | 896 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 | 9 ms | 896 KB |
in11.txt | AC | 10 ms | 896 KB |
in12.txt | AC | 9 ms | 896 KB |
in13.txt | AC | 9 ms | 896 KB |
in14.txt | AC | 10 ms | 896 KB |
in15.txt | AC | 9 ms | 896 KB |
in16.txt | AC | 9 ms | 896 KB |
in17.txt | AC | 9 ms | 768 KB |
in18.txt | AC | 9 ms | 896 KB |
in19.txt | AC | 9 ms | 896 KB |
in2.txt | AC | 5 ms | 512 KB |
in20.txt | AC | 9 ms | 768 KB |
in21.txt | AC | 9 ms | 896 KB |
in22.txt | AC | 10 ms | 896 KB |
in23.txt | AC | 10 ms | 896 KB |
in24.txt | AC | 10 ms | 896 KB |
in25.txt | AC | 10 ms | 896 KB |
in26.txt | AC | 10 ms | 896 KB |
in27.txt | AC | 10 ms | 896 KB |
in28.txt | AC | 9 ms | 768 KB |
in29.txt | AC | 9 ms | 768 KB |
in3.txt | AC | 9 ms | 768 KB |
in30.txt | AC | 9 ms | 768 KB |
in31.txt | AC | 9 ms | 768 KB |
in32.txt | AC | 9 ms | 768 KB |
in33.txt | AC | 9 ms | 768 KB |
in34.txt | AC | 9 ms | 768 KB |
in35.txt | AC | 9 ms | 896 KB |
in36.txt | AC | 10 ms | 896 KB |
in37.txt | AC | 10 ms | 896 KB |
in38.txt | AC | 10 ms | 896 KB |
in39.txt | AC | 9 ms | 768 KB |
in4.txt | AC | 10 ms | 896 KB |
in40.txt | AC | 9 ms | 768 KB |
in41.txt | AC | 9 ms | 768 KB |
in42.txt | AC | 9 ms | 768 KB |
in5.txt | AC | 10 ms | 896 KB |
in543.txt | AC | 8 ms | 640 KB |
in557.txt | AC | 8 ms | 640 KB |
in6.txt | AC | 1 ms | 256 KB |
in7.txt | AC | 9 ms | 768 KB |
in8.txt | AC | 10 ms | 896 KB |
in9.txt | AC | 9 ms | 768 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |