# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
533808 | RaresFelix | Crossing (JOI21_crossing) | C++17 | 1746 ms | 82288 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;
#define LT(x) ((x) == 'I' ? 2 : (x) == 'O')
#define CMB(x, y) ((x) == (y) ? (x) : 3 - ((x) + (y)))
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define MN 207171
int n, q;
vector<int> C[9], P;
struct SL {
vector<int> B;
int Vl[4 * MN], Eq[4 * MN], Lz[4 * MN];
void bld(int u, int s, int d) {
if(s == d) {
Vl[u] = B[s];
Eq[u] = (B[s] == P[s]);
return;
}
bld(u * 2, s, (s + d) / 2);
bld(u * 2 + 1, (s + d) / 2 + 1, d);
Vl[u] = (Vl[u * 2] == Vl[u * 2 + 1] ? Vl[u * 2] : -1);
Eq[u] = Eq[u * 2] && Eq[u * 2 + 1];
}
SL(vector<int> B) : B(std::move(B)){
bld(1, 0, n-1);
}
# | 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... |