# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
744526 | amirhoseinfar1385 | Game (APIO22_game) | C++17 | 4034 ms | 77132 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 maxn=300000+10,maxk=1000+10;
int fk=0,fn=0,f=0;
vector<int>adj[maxn],revadj[maxn];
char vis[maxn][maxk],revvis[maxn][maxk];
void dfs(int u,int v){
if(revvis[u][v]==1){
f=1;
}
vis[u][v]=1;
for(auto x:adj[u]){
if(vis[x][v]==0){
dfs(x,v);
}
}
}
void revdfs(int u,int v){
if(vis[u][v]==1){
f=1;
}
revvis[u][v]=1;
for(auto x:revadj[u]){
if(revvis[x][v]==0){
revdfs(x,v);
}
}
}
# | 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... |