# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1114308 | Dan4Life | Synchronization (JOI13_synchronization) | C++17 | 81 ms | 32608 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 pb push_back
#define sz(a) (int)a.size()
#define all(a) begin(a),end(a)
using ar2 = array<int,2>;
const int N = (int)2e5+10;
int n, m, q;
vector<int> adj[N];
vector<ar2> edges;
set<int> S[N];
int st[N], dfs_timer;
int e[N], r[N], active[N];
void dfs(int s, int p){
st[s] = dfs_timer++;
for(auto u : adj[s]){
if(u==p) continue;
dfs(u,s);
}
}
int dfs2(int s, int p, int curT){
int ans = 1;
for(auto u : adj[s]){
if(u==p) continue;
auto itr = S[u].upper_bound(curT);
if(itr==begin(S[u])) continue;
itr--; ans+=dfs2(u,s,*itr);
}
# | 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... |