# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
963259 | TimAni | Bitaro’s Party (JOI18_bitaro) | C++17 | 2037 ms | 34212 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.
//start-time: 2024-04-14 19:39:32
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve(){
ll n, m, q;
cin >> n >> m >> q;
vector<vector<ll>> g(n);
vector<vector<ll>> gR(n);
for(ll i = 0; i < m; i++){
ll u, v;
cin >> u >> v;
u--; v--;
g[u].push_back(v);
gR[v].push_back(u);
}
vector<ll> vis(n), topo;
auto dfs = [&](ll u, auto&&dfs) -> void {
vis[u] = 1;
for(auto v : g[u]){
if(!vis[v]){
dfs(v, dfs);
}
}
vis[u] = 2;
topo.push_back(u);
};
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |