# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
986462 | Yazan_SA | Game (IOI14_game) | C++14 | 1 ms | 348 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.
//#pragma once
#include "bits/stdc++.h"
using namespace std;
int N=1e9;
map<pair<int,int>,int>mp2;
map<pair<int,int>,bool>mp3;
vector<vector<int>>gr;
bool able(int x, int u, int v, vector<bool>&vis)
{
if(x==v)return 1;
vis[x]=1;
for(auto c:gr[x])
{
if(vis[c] || (x==u && c==v) || mp3[{u,v}])continue;
if(able(c,u,v,vis))return 1;
}
return 0;
}
void initialize(int n)
{
gr.resize(n);
for(int i=0; i<n; i++)
{
for(int j=0;j<n; j++)
{
if(i==j)continue;
gr[i].push_back(j);
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |