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>
#include "island.h"
#define fi first
#define se second
#define pitem item*
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
const int N=1e6+10;
const int SS=1<<19;
const int INFi=2e9;
const ll INFl=1e16;
const ll mod2=998244353;
const ll mod=1e9+7;
const ll mod3=2027865967;
const ll p=70032301;
const ull p2=913;
const int L=20;
bool vis[N],ans[N];
void solve(int n,int l){
vi pom;
vector<pair<int,int>> res;
for(int i=2;i<=n;i++) pom.push_back(query(1,i));
res.push_back({pom[0],1});
ans[pom[0]]=1;
for(auto u:pom){
vis[u]=1;
if(ans[u]) continue;
ans[u]=1;
int curr=0;
for(int i2=1;i2<n;i2++){
curr=query(u,i2);
res.push_back({curr,u});
ans[curr]=1;
if(vis[curr]) break;
}
}
for(auto u:res) answer(u.fi,u.se);
}
# | 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... |