# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
171412 | kuroni | Synchronization (JOI13_synchronization) | C++17 | 6394 ms | 21868 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 = 1E5 + 5, M = 2E5 + 5;
int n, m, q, d, u, f[N], g[N], ue[N], ve[N], lz[N], col[N];
int que[M];
bool chk[N], mod[N];
vector<int> adj[N], com[N];
void init() {
for (int i = 1; i <= n; i++) {
lz[i] = col[i] = 0;
mod[i] = false;
adj[i].clear(); com[i].clear();
}
}
void DFS(int u, int p = 0) {
col[u] = col[p];
for (int &v : adj[u]) {
int c = u ^ ue[v] ^ ve[v];
if (c != p) {
DFS(c, u);
}
}
}
void update(int u, int dif, int p = 0) {
f[u] += dif; lz[u] += dif;
# | 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... |