# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1128317 | idiotcomputer | Synchronization (JOI13_synchronization) | C++17 | 212 ms | 26952 KiB |
#include <bits/stdc++.h>
#include <system_error>
using namespace std;
#define pii pair<int,int>
#define f first
#define s second
#define pb push_back
#define sz(x) (int) (x).size()
const int mxN = 1e5+5;
int N,M,Q;
vector<int> adj[mxN];
pii edges[mxN];
bool act[mxN];
int ve[mxN];
int d[mxN];
int ss[mxN];
int p[mxN];
//depth then node
set<pii> hp[mxN];
int hidx[mxN];
int root[mxN];
void dfs(int node, int cp = -1, int dep = 0){
d[node] = dep;
ss[node] = 1;
p[node] = cp;
for (int i : adj[node]){
# | 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... |