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 <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a,b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a,b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif
/*
refs:
some other solutions
*/
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
#include "minerals.h"
vector<pii> ans;
void go(vector<int> &a, vector<int> &b, ll t){
if(a.empty()) return;
if(sz(a) == 1){
ans.pb({a[0],b[0]});
return;
}
int mid1 = sz(a)/3;
amax(mid1,1);
int mid2 = sz(a)-mid1;
int mid = sz(a)/2;
vector<int> al,ar;
int d = 0;
if(!t){
rep(i,sz(a)){
if(i < mid1){
al.pb(a[i]);
d = Query(a[i]);
}
else{
ar.pb(a[i]);
}
}
}
else{
rep(i,sz(a)){
if(i < mid2){
al.pb(a[i]);
}
else{
ar.pb(a[i]);
d = Query(a[i]);
}
}
}
vector<int> bl,br;
trav(x,b){
int res = Query(x);
if(res == d){
bl.pb(x);
}
else{
br.pb(x);
}
d = res;
}
go(al,bl,1);
go(ar,br,0);
}
void Solve(int n) {
// int v = Query(1);
// for (int i = 1; i <= N; ++i) {
// Answer(i, 2 * N + 1 - i);
// }
vector<int> v1,v2;
int distinct = 0;
rep1(i,2*n){
int x = Query(i);
if(x == distinct+1){
v1.pb(i);
distinct++;
}
else{
v2.pb(i);
}
}
rep1(i,2*n) Query(i);
go(v1,v2,0);
for(auto [i,j] : ans){
Answer(i,j);
}
}
Compilation message (stderr)
minerals.cpp: In function 'void go(std::vector<int>&, std::vector<int>&, ll)':
minerals.cpp:76:9: warning: unused variable 'mid' [-Wunused-variable]
76 | int mid = sz(a)/2;
| ^~~
# | 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... |