This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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"
bool used[100000];
int adj[1000][1000];
void run(int n){
cout<<n<<endl;
for(int i=0;i<n-1;i++){
vi t;
for(int j=0;j<n;j++){
//if(used[j+1]) continue;
int a[1] = {j+1};
int b[n-1];
int cnt=0;
for(int k=0;k<n;k++) if(k!=j && !adj[j+1][k+1]) b[cnt++]=k+1;
if(query(1, cnt, a, b)){
//cout<<"f";
t.push_back(j+1);
}
//cout<<endl;
}
adj[t[1]][t[0]] = true;
adj[t[0]][t[1]] = true;
used[t[0]] = true;
used[t[1]] = true;
setRoad(t[0], t[1]);
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |