# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1082610 | PVSekhar | Synchronization (JOI13_synchronization) | C++14 | 8 ms | 14684 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 ll long long
// const ll MOD = 998244353;
const ll MOD = 1e9 + 7;
const ll N = 1e5 + 2;
int n;
vector<int> is_on;
vector<pair<int, int>> order_edges;
struct SEGTREE {
int tree[4 * N];
SEGTREE() {
for (int i = 0; i < 4 * N; i++) tree[i] = 0;
}
void update(int node, int l, int r, int ind) {
if (l == r) {
tree[node] ^= 1;
return;
}
int mid = (l + r) >> 1;
if (ind <= mid) update(node << 1, l, mid, ind);
else update(node << 1 | 1, mid + 1, r, ind);
tree[node] = tree[node << 1] + tree[node << 1 | 1];
}
int query(int node, int l, int r, int i, int j) {
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |