제출 #232959

#제출 시각아이디문제언어결과실행 시간메모리
232959cfalasICC (CEOI16_icc)C++14
0 / 100
5 ms384 KiB
#include<bits/stdc++.h> using namespace std; #define mp make_pair #define INF 10000000 #define MOD 1000000007 #define MID (l+r)/2 #define HASHMOD 2305843009213693951 #define ll long long #define ull unsigned long long #define F first #define S second typedef vector<int> vi; #include "icc.h" void run(int n){ for(int i=0;i<n;i++){ vi t; for(int j=0;j<n;j++){ int a[1] = {j+1}; int b[n-1]; int cnt=0; for(int k=0;k<n-1;k++) if(k!=j) b[cnt++]=k+1; if(query(1, n-1, a, b)){ t.push_back(j+1); } } setRoad(t[0], t[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...