Submission #1148182

#	Time	Username	Problem	Language	Result	Execution time	Memory
1148182		thunopro	How to Avoid Disqualification in 75 Easy Steps (CEOI23_avoid)	C++20	10 / 100	1 ms	520 KiB

avoid

#include<bits/stdc++.h> 
using namespace std; 
#define maxn 300009
#define ll long long 
#define fi first 
#define se second 
#define pb push_back 
#define re exit(0); 
#define left id<<1 
#define right id<<1|1 
#define _lower(x) lower_bound(v.begin(),v.end(),x)-v.begin() + 1 
const int mod = 1e9+7;  
const int INF = 1e9; 

typedef vector<int> vi ; 
typedef pair<int,int> pii ; 
typedef vector<pii> vii ; 

void add ( int &a , int b ) 
{
	a += b ; 
	if ( a >= mod ) a -= mod ; 
	if ( a < 0 ) a += mod ; 
}

template < typename T > void chkmin ( T &a , T b ) { if ( a > b ) a = b ; } 
template < typename T > void chkmax ( T &a , T b ) { if ( a < b ) a = b ; }

void runfile() { freopen ("bai1.inp","r",stdin) ; } 

int _pow ( int a , int n ) 
{
	if ( n == 0 ) return 1 ; 
	int res = _pow (a,n/2) ; 
	if ( n % 2 ) return 1ll*res*res%mod*a%mod ; 
	else return 1ll*res*res%mod ; 
}
mt19937 rng (time(0)) ; 
#define local 
int n = 1000 ; 
int num_query = 65 ; 
vector<int> query [66] ;
int FIRST , SECOND ; 
void send (vector<int> P) ; 
vector<int> wait () ; 
pair<int,int> scout ( int R , int H ) ; 

//int main() 
//{
//    ios_base::sync_with_stdio(0); 
//    cin.tie(0);cout.tie(0);
////    runfile() ; 
//	FIRST = rng () % 1000 , SECOND = rng () % 1000 ; cout << FIRST << " " << SECOND << "\n" ; 
//	pii res = scout (75,1) ; 
//	cout << res.fi << " " << res.se ; 
//}
//
//#ifdef local 
//vector<int> wait () 
//{
//	vector<int> res ; 
//	for ( int i = 1 ; i <= num_query ; i ++ ) 
//	{
//		bool ok = false ; 
//		for ( auto x : query [i] ) ok |= ( FIRST == x || SECOND == x ) ; 
//		res . pb (ok) ; 
//	}
//	return res ; 
//}
//void send (vector<int>P) 
//{
//	
//}
//#endif  
int find ( int i , int j ) 
{
	if ( j == -1 ) return i + 1 ; 
	if ( j == -2 ) return i + 11 ; 
	int sum = 0 ; 
	int cnt = 9 ; 
	for ( int r = 1 ; r <= i ; r ++ ) sum += cnt , cnt -- ;  
	return sum + j-i + 20 ; 
}

pair<int,int> scout ( int R , int H ) 
{
	for ( int i = 1 ; i <= num_query ; i ++ ) query [i] . clear () ;  
	int LOG = __lg (n) ; 
	for ( int i = 0 ; i <= LOG ; i ++ ) 
	{
		for ( int mask = 1 ; mask <= n ; mask ++ ) 
		{
			if ( mask >> i & 1 ) query [find(i,-1)].pb(mask) ; 
			else query [find(i,-2)].pb(mask) ; 
		}
	}
	for ( int i = 0 ; i <= LOG ; i ++ ) 
	{
		for ( int j = i + 1 ; j <= LOG ; j ++ ) 
		{
			for ( int mask = 1 ; mask <= n ; mask ++ ) 
			{
				if ( mask >> i & 1 && mask >> j & 1 ) query [find(i,j)].pb(mask) ; 
			}
		}
	}
	
	for ( int i = 1 ; i <= num_query ; i ++ ) send (query[i]) ; 
	vector<int> answer = wait () ;
	answer.insert(answer.begin(),0) ; 
	int answer_first = 0 , answer_second = 0 ; 
	int first_diff = -1 ; 
	vector<bool> diff (LOG+1,false) ; 
	for ( int i = 0 ; i <= LOG ; i ++ ) 
	{
		if ( answer[find(i,-1)] != answer [find(i,-2)] && answer[find(i,-1)] == 1 ) answer_first += (1<<i) , answer_second += (1<<i) ; 
		else if ( answer[find(i,-1)] == answer [find(i,-2)])
		{
			if ( first_diff == -1 ) first_diff = i , answer_first += (1<<i); 
			diff [i] = true ; 
		}
	}
	if ( first_diff == -1 )
	{
		return {answer_first,answer_second} ; 
	}
	for ( int i = first_diff + 1 ; i <= LOG ; i ++ ) 
	{
		if ( diff [i] == false ) continue ; 
		if ( answer [find(first_diff,i)] == 1 ) answer_first += (1<<i) ;  
		else answer_second += (1<<i) ; 
	}
	
	if ( answer_first > answer_second ) swap (answer_first,answer_second) ; 
	
	return {answer_first,answer_second} ; 
}

Compilation message (stderr)

avoid.cpp: In function 'void runfile()':
avoid.cpp:29:26: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 | void runfile() { freopen ("bai1.inp","r",stdin) ; }
      |                  ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

• Subtask 0: 0 / 0
• Subtask 1: 0 / 10
• Subtask 2: 0 / 5
• Subtask 3: 0 / 10
• Subtask 4: 10 / 75