# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
982582 | JooDdae | 전압 (JOI14_voltage) | C++17 | 83 ms | 22680 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;
using ll = long long;
int n, m, col[100100], chk[200200];
vector<array<int, 2>> v[100100], odd, even;
int in[100100], out[100100], t[200200], cnt;
void dfs(int u, int p, int pid, int c) {
col[u] = c, in[u] = ++cnt;
for(auto [x, id] : v[u]) if(!chk[id]) {
chk[id] = 1;
if(col[x] == -1) {
dfs(x, u, id, c^1);
continue;
}
if(col[x] != c) even.push_back({u, x});
else odd.push_back({u, x});
}
out[u] = ++cnt;
}
void update(int b, int c) {
while(b <= 2*n) t[b] += c, b += b & -b;
}
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... |