제출 #301556

#제출 시각아이디문제언어결과실행 시간메모리
301556chirathnirodha게임 (IOI14_game)C++17
100 / 100
615 ms28536 KiB
#include "game.h" #include<bits/stdc++.h> using namespace std; int nn; int unionfind[1500]; int numnodes[1500]; vector<vector<int> > remain; void initialize(int n){ nn=n; for(int i=0;i<n;i++){ unionfind[i]=i; numnodes[i]=1; remain.push_back(vector<int>()); for(int j=0;j<n;j++)remain[i].push_back(1); } } int hasEdge(int u,int v){ int x=unionfind[u],y=unionfind[v]; if(remain[x][y]>1){ remain[x][y]--; remain[y][x]--; return 0; } else if(remain[x][y]==1){ int temp=unionfind[v]; for(int i=0;i<nn;i++)if(unionfind[i]==temp)unionfind[i]=unionfind[u]; numnodes[x]+=numnodes[y]; numnodes[y]=0; for(int i=0;i<nn;i++){ remain[x][i]+=remain[y][i]; remain[i][x]+=remain[y][i]; } remain[x][y]=remain[y][x]=0; return 1; } }

컴파일 시 표준 에러 (stderr) 메시지

game.cpp: In function 'int hasEdge(int, int)':
game.cpp:39:1: warning: control reaches end of non-void function [-Wreturn-type]
   39 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...