#include "minerals.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second
#define pii pair<int,int>
#define ppii pair<int,pii>
#define vi vector<int>
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize ("03,unroll-lopps")
const ll inf=1e9;
mt19937 rng(time(NULL));
int P[100001];
void Solve(int n){
  for(int i=1;i<=2*n;i++)P[i]=i;
  for(int i=1;i<=2*n;i++){
    swap(P[i],P[1+rng()%(i+1)]);
  }
  vector<int>st,on((2*n)+1,0);
  int last=0;
  for(int i=1;i<=2*n;i++)if(Query(P[i])>last)last++,st.pb(i),on[i]=1;
  for(int i=1;i<=2*n;i++)Query(P[i]);
  vector<pii>bound(n+1,{1,2*n});
  for(int i=0;i<n;i++)bound[i].f=st[i]+1;
  vector<int>ans(n+1,inf);
  vector<int>done(2*n+1,0);
  int what=0,dc=0;
  while(1){
    vector<pii>q;
    for(int i=0;i<st.size();i++){
      if(bound[i].f<=bound[i].s)q.pb({(bound[i].f+bound[i].s)/2,i});
      else {
        done[st[i]]=done[ans[i]]=1;
      }
    }
    sort(all(q));
    if(q.empty())break;
    int cur=0,sz=0;
    for(int j=1;j<=2*n;j++){
      if(cur==q.size())break;
      if(!on[j]&&!done[j])sz=Query(P[j]);
      while(cur<q.size()&&q[cur].f==j){
        int x=Query(P[st[q[cur].s]]);
        if(x==sz){
          bound[q[cur].s].s=q[cur].f-1;
          ans[q[cur].s]=min(ans[q[cur].s],q[cur].f);
        }
        else bound[q[cur].s].f=q[cur].f+1;
        sz=x;
        cur++;
      }
    }
    for(int i=1;i<=q.back().f;i++)if(!done[i])Query(P[i]);
    what++;
  }
  for(int i=0;i<n;i++){
    Answer(P[st[i]],P[ans[i]]);
  }
}
/*
p bs?
*/
컴파일 시 표준 에러 (stderr) 메시지
minerals.cpp:17:40: warning: bad option '-funroll-lopps' to pragma 'optimize' [-Wpragmas]
   17 | #pragma GCC optimize ("03,unroll-lopps")
      |                                        ^
minerals.cpp:21:17: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   21 | void Solve(int n){
      |                 ^| # | 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... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... |