# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
99777 | shoemakerjo | Synchronization (JOI13_synchronization) | C++14 | 61 ms | 14656 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 maxn 200010
#define pii pair<int, int>
int N, M, Q;
vector<pii> adj[maxn]; //store the node and the value
pii ed[maxn]; //store the edges
bool isin[maxn];
int dj[maxn];
bool canreach[maxn];
void dfs(int u, int p = -1) {
canreach[u] = true;
for (pii vp : adj[u]) {
if (isin[vp.second] && vp.first != p) {
dfs(vp.first, u);
}
}
}
int main() {
ios_base::sync_with_stdio(false);
# | 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... |