Submission #1880821
Source Code Expand
#define _CRT_SECURE_NO_WARNINGS #include <iostream> #include <sstream> #include <iomanip> #include <cstdio> #include <cstdlib> #include <cmath> #include <cctype> #include <cstring> #include <vector> #include <list> #include <queue> #include <deque> #include <stack> #include <map> #include <set> #include <algorithm> #include <iterator> #include <bitset> #include <ctime> #include<complex> using namespace std; #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 ITER(it,a) for (__typeof(a.begin()) it = a.begin(); it != a.end(); it++) #define FILL(a,value) memset(a, value, sizeof(a)) #define SZ(a) (int)a.size() #define ALL(a) a.begin(), a.end() #define PB push_back #define MP make_pair typedef long long LL; typedef vector<int> VI; typedef pair<int, int> PII; const double PI = acos(-1.0); const int INF = 1000 * 1000 * 1000 + 7; const LL LINF = INF * (LL)INF; const int MAX = 2 * 100000 + 47; const int MOD = 1000 * 1000 * 1000 + 7; int A[MAX]; void sim(string& s) { int p = 0; int d = 1; while (1) { if (p == -1 || p == SZ(s)) break; if (s[p] == 'A') { s[p] = 'B'; d *= -1; p += d; continue; } else { s[p] = 'A'; p += d; } } } void sim(string& s, int k) { FOR(i, 0, k) { sim(s); } } void calc(string& s, int k) { int rev = 0; int p = 0; int n = SZ(s); FOR(i, 0, n) A[i] = s[i] == 'B'; FOR(i, 0, min(k, 4 * n)) { if (A[p] ^ rev == 0) { A[p] ^= 1; continue; } rev ^= 1; A[p] = rev; p++; if (p == n) p = 0; } FOR(k, 0, n) { int i = p + k; if (i >= n) i -= n; s[k] = (A[i] ^ rev) + 'A'; } } int main() { //freopen("in.txt", "r", stdin); //freopen("out.txt", "w", stdout); ios::sync_with_stdio(false); cin.tie(0); string s; int k, n; cin >> n >> k >> s; calc(s, k); cout << s << endl; }
Submission Info
Submission Time | |
---|---|
Task | D - Half Reflector |
User | vjudge1 |
Language | C++14 (Clang 3.8.0) |
Score | 0 |
Code Size | 1850 Byte |
Status | WA |
Exec Time | 14 ms |
Memory | 1532 KB |
Compile Error
./Main.cpp:86:12: warning: ^ has lower precedence than ==; == will be evaluated first [-Wparentheses] if (A[p] ^ rev == 0) ^~~~~~~~~~ ./Main.cpp:86:12: note: place parentheses around the '==' expression to silence this warning if (A[p] ^ rev == 0) ^ ( ) ./Main.cpp:86:12: note: place parentheses around the ^ expression to evaluate it first if (A[p] ^ rev == 0) ^ ( ) 1 warning generated.
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 | 2 ms | 384 KB |
in10.txt | AC | 12 ms | 1532 KB |
in11.txt | AC | 12 ms | 1532 KB |
in12.txt | AC | 12 ms | 1532 KB |
in13.txt | AC | 12 ms | 1532 KB |
in14.txt | AC | 12 ms | 1532 KB |
in15.txt | AC | 12 ms | 1532 KB |
in16.txt | AC | 12 ms | 1532 KB |
in17.txt | AC | 12 ms | 1532 KB |
in18.txt | AC | 12 ms | 1532 KB |
in19.txt | AC | 12 ms | 1532 KB |
in2.txt | AC | 6 ms | 960 KB |
in20.txt | AC | 12 ms | 1532 KB |
in21.txt | AC | 12 ms | 1532 KB |
in22.txt | AC | 13 ms | 1532 KB |
in23.txt | AC | 13 ms | 1532 KB |
in24.txt | AC | 13 ms | 1532 KB |
in25.txt | WA | 14 ms | 1532 KB |
in26.txt | AC | 13 ms | 1532 KB |
in27.txt | WA | 13 ms | 1532 KB |
in28.txt | AC | 12 ms | 1532 KB |
in29.txt | AC | 12 ms | 1532 KB |
in3.txt | AC | 12 ms | 1532 KB |
in30.txt | AC | 13 ms | 1532 KB |
in31.txt | AC | 12 ms | 1532 KB |
in32.txt | AC | 13 ms | 1532 KB |
in33.txt | AC | 12 ms | 1532 KB |
in34.txt | AC | 12 ms | 1532 KB |
in35.txt | AC | 12 ms | 1532 KB |
in36.txt | AC | 13 ms | 1532 KB |
in37.txt | AC | 13 ms | 1532 KB |
in38.txt | AC | 13 ms | 1532 KB |
in39.txt | AC | 12 ms | 1532 KB |
in4.txt | AC | 14 ms | 1532 KB |
in40.txt | AC | 12 ms | 1532 KB |
in41.txt | AC | 12 ms | 1532 KB |
in42.txt | AC | 12 ms | 1532 KB |
in5.txt | AC | 13 ms | 1532 KB |
in543.txt | AC | 12 ms | 1532 KB |
in557.txt | AC | 11 ms | 1532 KB |
in6.txt | AC | 1 ms | 256 KB |
in7.txt | AC | 12 ms | 1532 KB |
in8.txt | AC | 13 ms | 1532 KB |
in9.txt | AC | 12 ms | 1532 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |