Submission #1207222

#TimeUsernameProblemLanguageResultExecution timeMemory
1207222simplemind_31Game (IOI14_game)C++20
100 / 100
178 ms7060 KiB
#include "game.h" #include <bits/stdc++.h> using namespace std; int N; vector<int> /*dsu,tam,*/clave; /*int find(int x){ if(x==dsu[x]){ return x; } return dsu[x]=find(dsu[x]); } void unite(int x,int y){ x=find(x); y=find(y); if(x==y){ return; } if(tam[x]<tam[y]){ swap(x,y); } dsu[y]=x; }*/ void initialize(int n){ clave.resize(n); N=n; /*dsu=tam=clave; for(int i=0;i<n;i++){ tam[i]=1; dsu[i]=i; }*/ } int hasEdge(int u, int v){ int x=min(u,v); v=max(u,v); u=x; clave[u]++; if(clave[u]==N-u-1){ return 1; }else{ return 0; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...