| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 467250 | nathanlee726 | Minerals (JOI19_minerals) | C++14 | 0 ms | 0 KiB |
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<i_am_noob_orz>
#include<bits/stdc++.h>
//#include "minerals.h"
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define int ll
#define ull unsigned long long
#define pii pair<int,int>
#define X first
#define Y second
#define mod ((ll)1e9+7)
#define pb push_back
#define mp make_pair
#define abs(x) ((x)>0?(x):(-(x)))
#define F(n) Fi(i,n)
#define Fi(i,n) Fl(i,0,n)
#define Fl(i,l,n) for(int i=l;i<n;i++)
#define memres(a) memset(a,0,sizeof(a))
#define all(a) a.begin(),a.end()
#define sz(a) ((int)a.size())
#define ceiling(a,b) (((a)+(b)-1)/(b))
#define endl '\n'
#define bit_count(x) __builtin_popcountll((x))
#define ykh mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define jimmy_is_kind false
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> rbtree;
//#define LOCAL
#ifdef LOCAL
#define bug(...) cerr<<"#"<<__LINE__<<' '<<#__VA_ARGS__<<"- ", _do(__VA_ARGS__)
template<typename T> void _do(T && x) {cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T && x, S&&...y) {cerr<<x<<", "; _do(y...);}
#define IOS()
int Query(int x){return 0;}
void Answer(int a, int b){}
#else
#define IOS() ios_base::sync_with_stdio(0), cin.tie(0)
#define endl '\n'
#define bug(...)
#endif
int add(int a,int b){return(a+b>=mod?a+b-mod:a+b);}
int sub(int a,int b){return(a<b?a+mod-b:a-b);}
int po(int a,int b){
if(b==0)return 1;
if(b==1)return(a%mod);
int tem=po(a,b/2);
if(b&1)return(((tem*tem)%mod)*a)%mod;
else return(tem*tem)%mod;
}
int GCD(int a,int b){
int x=0;
int ra,rb;
while(a&&b){
if(((a&1)==0)&&((b&1)==0)){
a>>=1,b>>=1,x++;
}
else if((a^b)&1){
if(a&1)b>>=1;
else a>>=1;
}
else{
ra=abs(a-b),rb=min(a,b);
a=ra,b=rb;
}
}
return max(a,b)<<x;
}
int gcd(int a,int b){if(b==0)return a;return gcd(b,a%b);}
vector<int> va,vb;
void solve(int n){
int s=0;
F(2*n){
int ts=Query(i+1);
if(ts==s){
vb.pb(i);
}
else{
va.pb(i);
}
s=ts;
}
int lg=__lg(n-1)+1;
vector<int> vc(n,0),vd(((n+1)/2),-1);
bool vis[n]={0};
for(int i=lg-1;i>=0;i--){
Fi(j,n){
if(i==lg-1){
if(j&(1ll<<i)){
s=Query(va[j]+1);
}
}
else{
if(((j&(1ll<<(i+1)))&&(j&(1ll<<(i)))==0)||((j&(1ll<<(i)))&&(j&(1ll<<(i+1)))==0)){
s=Query(va[j]+1);
}
}
}
if(i==0){
Fi(j,n){
if(vd[vc[j]/2]==-1){
vd[vc[j]/2]=j;
}
else{
int ts=Query(vb[j]);
if(ts!=s){
vc[j]++;
}
else{
vc[vd[vc[j]/2]]++;
}
s=ts;
Answer(va[vc[j]]+1,vb[j]+1);
Answer(va[vc[vd[vc[j]/2]]]+1,vb[vd[vc[j]/2]]+1);
vis[va[vc[j]]]=1;
vis[vb[j]]=1;
vis[va[vc[vd[vc[j]/2]]]]=1;
vis[vb[vd[vc[j]/2]]]=1;
}
}
if(n&1){
int p=-1;
assert(!vis[va[n-1]]);
Fi(j,n){
if(!vis[vb[j]])p=vb[j];
}
Answer(va[n-1]+1,p+1);
}
}
else{
Fi(j,n){
int ts=Query(vb[j]+1);
if(ts!=s)vc[j]+=(1ll<<i);
s=ts;
}
}
}
return;
}
#ifdef LOCAL
signed main(){
IOS();
return 0;
}
#endif