# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
47762 | mirbek01 | Bitaro’s Party (JOI18_bitaro) | C++17 | 2027 ms | 15312 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 + 2;
int n, m, q, d[N], used[N], ans, vis[N], f[N], t;
vector <int> g[N], gr[N];
void dfs(int v){
vis[v] = 1;
for(int to : g[v]){
if(!vis[to]){
dfs(to);
}
if(f[to]){
d[v] = max(d[v], d[to] + 1);
f[v] = 1;
}
}
if(!used[v] && f[v])
ans = max(ans, d[v]);
}
int main(){
cin >> n >> m >> q;
for(int i = 0; i < m; i ++){
int u, v;
scanf("%d %d", &u, &v);
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... |