# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1138003 | SmuggingSpun | Synchronization (JOI13_synchronization) | C++20 | 185 ms | 22572 KiB |
#include<bits/stdc++.h>
#define taskname "A"
using namespace std;
const int lim = 1e5 + 5;
const int INF = 1e9;
int n, m, q, euler = 0, low[lim], tail[lim], h[lim], ans[lim], pre_edge_ans[lim], bit[lim], up[lim][17];
pair<int, int>edge[lim];
vector<int>g[lim];
bitset<lim>state;
void update(int p, int x){
for(; p <= n; p += p & -p){
bit[p] += x;
}
}
void update(int l, int r, int x){
update(l, x);
update(r + 1, -x);
}
int get(int p){
int ans = 0;
for(; p > 0; p -= p & -p){
ans += bit[p];
}
return ans;
}
void dfs(int s){
low[s] = ++euler;
for(int& d : g[s]){
if(d != up[s][0]){
h[d] = h[up[d][0] = s] + 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... |