# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
816412 | ttamx | Werewolf (IOI18_werewolf) | C++14 | 156 ms | 19672 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 "werewolf.h"
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> p2;
const int N=3005;
int n,m,q;
vector<int> adj[N];
int vis[N],vis2[N];
void dfs(int u,int l){
if(vis[u])return;
vis[u]=true;
for(auto v:adj[u]){
if(v<l)continue;
dfs(v,l);
}
}
bool dfs2(int u,int r){
if(vis2[u])return false;
vis2[u]=true;
if(vis[u])return true;
for(auto v:adj[u]){
if(r<v)continue;
if(dfs2(v,r))return true;
}
# | 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... |