#include "chameleon.h"
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<long long,null_type,less_equal<long long>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("Ofast")
//#pragma GCC target("avx2")
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll maxn=5e5+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const int MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-6;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
out<<P.f<<' '<<P.s;
return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?" ":"");
return out;
}
namespace {
vector<int> vv[maxn];
bool hv(vector<int> v,int x){
v.pb(x);
return Query(v)!=sz(v);
}
int col[maxn];
void dfs(int u,int c){
col[u]=c;
for(int x:vv[u]){
if(!col[x]) dfs(x,3-c);
}
}
} // namespace
void Solve(int n) {
REP1(i,2*n){
vector<int> v[2];
REP1(j,i-1) col[j]=0;
REP1(j,i-1){
if(!col[j]) dfs(j,1);
}
REP1(j,i-1) v[col[j]-1].pb(j);
REP(j,2){
while(hv(v[j],i)){
int l=0,r=sz(v[j])-1;
while(l<r){
int mid=(l+r)/2;
vector<int> vv;
REP(k,mid+1) vv.pb(v[j][k]);
if(hv(vv,i)) r=mid;
else l=mid+1;
}
int x=v[j][l];
vv[i].pb(x),vv[x].pb(i);
v[j].erase(v[j].begin(),v[j].begin()+l+1);
}
}
}
//REP1(i,2*n) cout<<i<<' '<<vv[i]<<'\n';
REP1(i,2*n){
for(int x:vv[i]){
assert(Query({i,x})==1);
if(i>x) continue;
vector<int> vv;
REP1(k,2*n){
if(k==i or k==x) continue;
vv.pb(k);
}
if(Query(vv)<=n-1){
Answer(i,x);
break;
}
}
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
11984 KB |
Output is correct |
2 |
Correct |
6 ms |
11996 KB |
Output is correct |
3 |
Correct |
41 ms |
12236 KB |
Output is correct |
4 |
Correct |
41 ms |
12132 KB |
Output is correct |
5 |
Correct |
40 ms |
12112 KB |
Output is correct |
6 |
Correct |
41 ms |
12132 KB |
Output is correct |
7 |
Correct |
40 ms |
12112 KB |
Output is correct |
8 |
Correct |
40 ms |
12112 KB |
Output is correct |
9 |
Correct |
44 ms |
12140 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
8 ms |
12064 KB |
Output is correct |
2 |
Correct |
6 ms |
11984 KB |
Output is correct |
3 |
Correct |
7 ms |
11984 KB |
Output is correct |
4 |
Correct |
8 ms |
12072 KB |
Output is correct |
5 |
Correct |
6 ms |
11984 KB |
Output is correct |
6 |
Correct |
6 ms |
11984 KB |
Output is correct |
7 |
Correct |
6 ms |
12004 KB |
Output is correct |
8 |
Correct |
7 ms |
12016 KB |
Output is correct |
9 |
Correct |
6 ms |
12052 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
8 ms |
12064 KB |
Output is correct |
2 |
Correct |
6 ms |
11984 KB |
Output is correct |
3 |
Correct |
7 ms |
11984 KB |
Output is correct |
4 |
Correct |
8 ms |
12072 KB |
Output is correct |
5 |
Correct |
6 ms |
11984 KB |
Output is correct |
6 |
Correct |
6 ms |
11984 KB |
Output is correct |
7 |
Correct |
6 ms |
12004 KB |
Output is correct |
8 |
Correct |
7 ms |
12016 KB |
Output is correct |
9 |
Correct |
6 ms |
12052 KB |
Output is correct |
10 |
Correct |
7 ms |
11984 KB |
Output is correct |
11 |
Correct |
6 ms |
11984 KB |
Output is correct |
12 |
Correct |
7 ms |
12000 KB |
Output is correct |
13 |
Correct |
6 ms |
12076 KB |
Output is correct |
14 |
Correct |
7 ms |
12068 KB |
Output is correct |
15 |
Correct |
8 ms |
12048 KB |
Output is correct |
16 |
Correct |
7 ms |
12032 KB |
Output is correct |
17 |
Correct |
7 ms |
11984 KB |
Output is correct |
18 |
Correct |
8 ms |
11984 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
11984 KB |
Output is correct |
2 |
Correct |
6 ms |
12072 KB |
Output is correct |
3 |
Correct |
69 ms |
12112 KB |
Output is correct |
4 |
Correct |
67 ms |
12040 KB |
Output is correct |
5 |
Correct |
65 ms |
12120 KB |
Output is correct |
6 |
Correct |
67 ms |
12132 KB |
Output is correct |
7 |
Correct |
68 ms |
12112 KB |
Output is correct |
8 |
Correct |
65 ms |
12124 KB |
Output is correct |
9 |
Correct |
67 ms |
12116 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
11984 KB |
Output is correct |
2 |
Correct |
6 ms |
11996 KB |
Output is correct |
3 |
Correct |
41 ms |
12236 KB |
Output is correct |
4 |
Correct |
41 ms |
12132 KB |
Output is correct |
5 |
Correct |
40 ms |
12112 KB |
Output is correct |
6 |
Correct |
41 ms |
12132 KB |
Output is correct |
7 |
Correct |
40 ms |
12112 KB |
Output is correct |
8 |
Correct |
40 ms |
12112 KB |
Output is correct |
9 |
Correct |
44 ms |
12140 KB |
Output is correct |
10 |
Correct |
8 ms |
12064 KB |
Output is correct |
11 |
Correct |
6 ms |
11984 KB |
Output is correct |
12 |
Correct |
7 ms |
11984 KB |
Output is correct |
13 |
Correct |
8 ms |
12072 KB |
Output is correct |
14 |
Correct |
6 ms |
11984 KB |
Output is correct |
15 |
Correct |
6 ms |
11984 KB |
Output is correct |
16 |
Correct |
6 ms |
12004 KB |
Output is correct |
17 |
Correct |
7 ms |
12016 KB |
Output is correct |
18 |
Correct |
6 ms |
12052 KB |
Output is correct |
19 |
Correct |
7 ms |
11984 KB |
Output is correct |
20 |
Correct |
6 ms |
11984 KB |
Output is correct |
21 |
Correct |
7 ms |
12000 KB |
Output is correct |
22 |
Correct |
6 ms |
12076 KB |
Output is correct |
23 |
Correct |
7 ms |
12068 KB |
Output is correct |
24 |
Correct |
8 ms |
12048 KB |
Output is correct |
25 |
Correct |
7 ms |
12032 KB |
Output is correct |
26 |
Correct |
7 ms |
11984 KB |
Output is correct |
27 |
Correct |
8 ms |
11984 KB |
Output is correct |
28 |
Correct |
6 ms |
11984 KB |
Output is correct |
29 |
Correct |
6 ms |
12072 KB |
Output is correct |
30 |
Correct |
69 ms |
12112 KB |
Output is correct |
31 |
Correct |
67 ms |
12040 KB |
Output is correct |
32 |
Correct |
65 ms |
12120 KB |
Output is correct |
33 |
Correct |
67 ms |
12132 KB |
Output is correct |
34 |
Correct |
68 ms |
12112 KB |
Output is correct |
35 |
Correct |
65 ms |
12124 KB |
Output is correct |
36 |
Correct |
67 ms |
12116 KB |
Output is correct |
37 |
Correct |
67 ms |
12140 KB |
Output is correct |
38 |
Correct |
40 ms |
12124 KB |
Output is correct |
39 |
Correct |
68 ms |
12140 KB |
Output is correct |
40 |
Correct |
70 ms |
12128 KB |
Output is correct |
41 |
Correct |
66 ms |
12128 KB |
Output is correct |
42 |
Correct |
41 ms |
12128 KB |
Output is correct |
43 |
Correct |
67 ms |
12120 KB |
Output is correct |
44 |
Correct |
67 ms |
12132 KB |
Output is correct |
45 |
Correct |
66 ms |
12060 KB |
Output is correct |