# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1104155 | InvMOD | Synchronization (JOI13_synchronization) | C++14 | 222 ms | 26960 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;
const int lg = 21;
int n, m, q, timerDFS, tin[N], tout[N], h[N], par[lg][N], bit[N<<1], info[N], last_sync[N];
pair<int,int> E[N];
bool on[N];
vector<int> adj[N];
void update(int p, int val){
for(; p <= timerDFS; p += (p & (-p))) bit[p] += val;
}
int get(int p){
int res = 0;
for(; p; p -= (p & (-p))) res += bit[p];
return res;
}
void dfs(int x, int p){
tin[x] = ++timerDFS;
info[x] = 1;
for(int v : adj[x])if(v != p){
h[v] = h[x] + 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |