Submission #347336

#TimeUsernameProblemLanguageResultExecution timeMemory
347336ogibogi2004Game (IOI14_game)C++14
0 / 100
1 ms364 KiB
#include "game.h" #include<bits/stdc++.h> using namespace std; const int MAXN=1502; int cnte[MAXN][MAXN]; int par[MAXN],n1; void join(int p,int q) { for(int i=1;i<=n1;i++) { if(par[i]==q)par[i]=p; } for(int i=1;i<=n1;i++) { cnte[i][p]+=cnte[i][q]; cnte[p][i]=cnte[i][p]; } } void initialize(int n) { n1=n; for(int i=1;i<=n;i++) { par[i]=i; for(int j=1;j<=n;j++) { if(i!=j)cnte[i][j]=1; } } } int hasEdge(int u, int v) { /*for(int i=1;i<=n1;i++) { for(int j=1;j<=n1;j++) { cout<<cnte[i][j]<<" "; } cout<<endl; }*/ int p=par[u],q=par[v]; if(cnte[p][q]==1) { join(p,q); return 1; } else { cnte[q][p]--; cnte[p][q]--; return 0; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...