# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
668826 | 2022-12-05T03:51:34 Z | as111 | Board (CEOI13_board) | C++14 | 200 ms | 1232 KB |
#include <iostream> #include <string> #define MAXN 100000 using namespace std; int bitA[MAXN + 5]; int bitB[MAXN + 5]; int main() { string A, B; cin >> A >> B; int startA = 0; int startB = 0; int endA = 0; int endB = 0; for (int i = 0; i < A.length(); i++) { if (A[i] == '1') { bitA[endA] = 0; endA++; } if (A[i] == '2') { bitA[endA] = 1; endA++; } if (A[i] == 'U') { endA--; } if (A[i] == 'L') { // subtract 1 if (bitA[endA] == 1)bitA[endA] = 0; if (bitA[endA] == 0) { int pos = endA; while (pos > 0) { if (bitA[pos] == 1) { bitA[pos] = 0; break; } bitA[pos] = 1; pos--; } } } if (A[i] == 'R') { // add 1 if (bitA[endA] == 0)bitA[endA] = 1; if (bitA[endA] == 1) { int pos = endA; while (pos > 0) { if (bitA[pos] == 0) { bitA[pos] = 1; break; } bitA[pos] = 0; pos--; } } } } for (int i = 0; i < B.length(); i++) { if (B[i] == '1') { bitB[endB] = 0; endB++; } if (B[i] == '2') { bitB[endB] = 1; endB++; } if (B[i] == 'U') { endB--; } if (B[i] == 'L') { // subtract 1 if (bitB[endB] == 1)bitB[endB] = 0; if (bitB[endB] == 0) { int pos = endB; while (pos > 0) { if (bitB[pos] == 1) { bitB[pos] = 0; break; } bitB[pos] = 1; pos--; } } } if (B[i] == 'R') { // add 1 if (bitB[endB] == 0)bitB[endB] = 1; if (bitB[endB] == 1) { int pos = endB; while (pos > 0) { if (bitB[pos] == 0) { bitB[pos] = 1; break; } bitB[pos] = 0; pos--; } } } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 580 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 340 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 340 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 320 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 340 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 989 ms | 1128 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 945 ms | 1232 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 945 ms | 1128 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |