# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
550754 | tht2005 | Crossing (JOI21_crossing) | C++17 | 2013 ms | 16516 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
int n;
char s[9][N], t[N];
void add(char* r, char* a, char* b) {
for(int i = 0; i < n; ++i) {
if(a[i] == b[i]) {
r[i] = a[i];
}
else {
r[i] = 'J' + 'O' + 'I' - a[i] - b[i];
}
}
}
const int N_ = 262144;
char st[9][N_ << 1], lz[N_ << 1];
bool res[9][N_ << 1];
void build(int x, int l, int r) {
lz[x] = 0;
if(l == r) {
for(int i = 0; i < 9; ++i) {
st[i][x] = s[i][l];
res[i][x] = (s[i][l] == t[l]);
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |