제출 #438775

#제출 시각아이디문제언어결과실행 시간메모리
438775shahriarkhanICC (CEOI16_icc)C++14
0 / 100
1 ms332 KiB
#include<bits/stdc++.h> #include "icc.h" using namespace std ; void run(int N) { int vis[N+1][N+1] ; for(int i = 0 ; i <= N ; ++i) { for(int j = 0 ; j <= N ; ++j) { vis[i][j] = 0 ; } vis[i][i] = 1 ; } while(1) { int ret[2] = {0} , cnt = 0 ; for(int i = 1 ; i <= N ; ++i) { int a[1] , siz_a = 1 , b[N+1] , siz_b = 0 ; for(int j = 1 ; j <= N ; ++j) { if(vis[i][j]) continue ; b[siz_b++] = j ; } if(!siz_b) continue ; if(query(siz_a,siz_b,a,b)) ret[cnt++] = i ; } setRoad(ret[0],ret[1]) ; vis[ret[0]][ret[1]] = 1 ; vis[ret[1]][ret[0]] = 1 ; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...