제출 #1111164

#제출 시각아이디문제언어결과실행 시간메모리
1111164Ghulam_JunaidICC (CEOI16_icc)C++17
7 / 100
282 ms760 KiB
#include <bits/stdc++.h> #include "icc.h" using namespace std; const int N = 105; int n; bool edge[N][N]; void run(int nn){ n = nn; for (int i=1; i<n; i++){ bool done = 0; for (int u = 1; u <= n; u++){ for (int v = u + 1; v <= n; v++){ int a[1] = {u}; int b[1] = {v}; if (!done and !edge[u][v] and query(1, 1, a, b)){ done = 1; edge[u][v] = 1; setRoad(u, v); } } } } }
#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...