Submission #259822

#TimeUsernameProblemLanguageResultExecution timeMemory
259822miguelGame (IOI14_game)C++14
0 / 100
0 ms384 KiB
#include "game.h" #include <bits/stdc++.h> using namespace std; #define pb push_back #define clock (clock() * 1000.0 / CLOCKS_PER_SEC) #define dbg(x) cout << #x << '=' << x << '\n'; #define ll long long #define double long double #define x first #define y second #define vi vector <int> #define L nod<<1 #define R ((nod<<1)|1) #define PI 3.14159265358979 const ll mod=1000000007; int n, questions[2002]; bool connected[2002]; void initialize(int N){ n=N; for(int i=0; i<=n; i++) questions[i]=0, connected[i]=0; } int hasEdge(int u, int v){ questions[u]++, questions[v]++; if(questions[u]!=n-2 && questions[v]!=n-2) return 0; connected[u]=connected[v]=1; return 1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...