이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
///~~~LOTA~~~///
#include <bits/stdc++.h>
#include <icc.h>
using namespace std;
#define ll long long
#define li long int
#define ld long double
#define append push_back
#define add insert
#define nl '\n'
#define ff first
#define ss second
#define pii pair<int,int>
#define pic pair<int,char>
#define all(x) (x).begin(),(x).end()
#define sum(a) accumulate(all(a),0)
#define L0TA ios_base::sync_with_stdio(false);cin.tie(NULL)
#define terminator main
#define N 101
int e[N];
int x[N];
int y[N];
int a[N][N];
void run(int n){
int m,o,p,q;
for(int i=n;i>0;i--)
a[i][i]=e[i]=1;
for(int t=1;t<n;t++){
for(m=1;m<=n;m++){
q=0;
p=1;
x[0]=m;
for(int j=1;j<=n;j++){
if(a[m][j]) continue;
y[q]=j;
q++;
}
if(query(p,q,x,y))
break;
}
o=0;
for(int i=64;i>0;i/=2){
if(o+i>q) continue;
if(!query(1,o+i,x,y)) o+=i;
}
setRoad(m,y[o]);
a[y[o]][m]=1;
a[m][y[o]]=1;
e[y[o]]++;
e[m]++;
}
}
# | 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... |