Submission #480782

#	Time	Username	Problem	Language	Result	Execution time	Memory
480782		NhatMinh0208	cmp (balkan11_cmp)	C++14	0 / 100	732 ms	96928 KiB

cmp

#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;

//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
    a=(a<b)?a:b;
}

template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
    a=(a>b)?a:b;
}
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;

// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif
#include "cmp.h"
void bit_set_adv(int x, int pos) {
	if (pos==0) bit_set(1+x);
	if (pos==1) bit_set(1+x+4);
	if (pos==2) bit_set(1+x+20);
	if (pos==3) bit_set(1+x+84);
	if (pos==4) bit_set(1+x+320);
	if (pos==5) bit_set(1+x+1600);
}
int bit_get_adv(int x, int pos) {
	
	if (pos==0) return bit_get(1+x);
	if (pos==1) return bit_get(1+x+4);
	if (pos==2) return bit_get(1+x+20);
	if (pos==3) return bit_get(1+x+84);
	if (pos==4) return bit_get(1+x+320);
	if (pos==5) return bit_get(1+x+1600);
}

void remember(int x) {
	vector<int> lmao;
	int u=x;
	for (int i=0;i<6;i++) {
		lmao.push_back(u);
		u/=4;
	}
	// if (x==5)
	// cout<<"mem "<<x<<endl;
	reverse(lmao.begin(),lmao.end());
	for (int i=0;i<6;i++) {
	// if (x==5)
		// cout<<i<<' '<<lmao[i]<<endl;
		bit_set_adv(lmao[i],i);
	}
}

int compare(int x) {
	vector<int> lmao;
	int u=x;
	for (int i=0;i<6;i++) {
		lmao.push_back(u);
		u/=4;
	}
	reverse(lmao.begin(),lmao.end());
	int l,r,mid;
	l=0;
	r=6;
	// if (x==3798)
	// cout<<"compare "<<x<<endl;
	while(l<r) {
		int mid=(l+r)/2;
	// if (x==3798)
		// cout<<mid<<' '<<lmao[mid]<<' '<<bit_get_adv(lmao[mid],mid)<<endl;
		if (bit_get_adv(lmao[mid],mid)) l=mid+1; else r=mid;
	}
	// if (x==3798)
	// cout<<l<<endl;
	// if (x==3798)
	// cout<<lmao[l]<<endl;
	if (l==6) {
		return 0;
	}
	else {
		if (lmao[l]%4==0) return -1;
		if (lmao[l]%4==3) return 1;
		if (lmao[l]%4==1) {
			if (bit_get_adv(lmao[l]-1,l)) return 1; else return -1;
		}
		if (lmao[l]%4==2) {
			if (bit_get_adv(lmao[l]+1,l)) return -1; else return 1;
		}
	}
}

Compilation message (stderr)

cmp.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      | 
cmp.cpp: In function 'int compare(int)':
cmp.cpp:144:10: warning: unused variable 'mid' [-Wunused-variable]
  144 |  int l,r,mid;
      |          ^~~
cmp.cpp: In function 'int bit_get_adv(int, int)':
cmp.cpp:117:1: warning: control reaches end of non-void function [-Wreturn-type]
  117 | }
      | ^
cmp.cpp: In function 'int compare(int)':
cmp.cpp:137:14: warning: control reaches end of non-void function [-Wreturn-type]
  137 |  vector<int> lmao;
      |              ^~~~

• Subtask 1: 0 / 100