# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
905997 | hmm789 | Crossing (JOI21_crossing) | C++14 | 7090 ms | 83816 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 int long long
#define INF 1000000000000000000
#define MOD 998244353
struct node {
int s, e, m, v, ans, lz;
node *l, *r;
node(int _s, int _e, vector<int> vec, vector<int> qry) {
s = _s, e = _e, m = (s+e)/2, lz = -1;
if(s != e) {
l = new node(s, m, vec, qry);
r = new node(m+1, e, vec, qry);
if(l->v == -1 || r->v == -1 || l->v != r->v) v = -1;
else v = l->v;
ans = l->ans & r->ans;
} else {
v = vec[s];
ans = vec[s] == qry[s];
}
}
void prop() {
if(lz == -1) return;
ans = lz == v;
if(s != e) {
l->lz = lz;
r->lz = lz;
}
lz = -1;
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... |