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 "island.h"
#include<bits/stdc++.h>
using namespace std;
int n,l;
void solve(int N, int L) {
n=N;
l=L;
vector<int>all;
for(int i=1;i<n;i++){
all.push_back(query(1,i));
}
vector<int>vis(n+2);
vis[1]=1;
for(int i=0;i<n-1;i++){
if(vis[all[i]]==1){
continue;
}
int ted=1,u=all[i];
int x=query(u,ted);
while(vis[x]==0){
answer(u,x);
vis[x]=1;
ted++;
x=query(u,ted);
}
answer(u,x);
vis[u]=1;
}
// int variable_example = query(1, 1);
//for (int i = 2; i <= N; i++) {
// answer(1, i);
//}
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |