# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
897061 | Litusiano | Game (APIO22_game) | C++17 | 1 ms | 344 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;
#include "game.h"
int k1,n1;
vector<vector<int>> G1,Grev1, DAG;
vector<int> reachable0, reachablek;
int act = 0;
bool ok = 0;
void dfs2(int u){
if(reachable0[u]) return;
reachable0[u] = 1;
if(reachable0[u] + reachablek[u] == 2) ok = 1;
// cerr<<"START "<<u<<endl;
for(int v : G1[u]) dfs2(v);
// cerr<<"END "<<u<<endl;
// top.push_back(u);
}
void dfs3(int u){
if(reachablek[u]) return;
reachablek[u] = 1;
if(reachable0[u] + reachablek[u] == 2) ok = 1;
for(int v : Grev1[u]){
dfs3(v);
}
// scc[u] = act;
}
# | 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... |