Submission #260880

#	Time	Username	Problem	Language	Result	Execution time	Memory
260880		Evirir	Koala Game (APIO17_koala)	C++17	0 / 100	1 ms	384 KiB

koala

#include "koala.h"
#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;

#define watch(x) cout<<(#x)<<"="<<(x)<<'\n'
#define mset(d,val) memset(d,val,sizeof(d))
#define setp(x) cout<<fixed<<setprecision(x)
#define forn(i,a,b) for(int i=(a);i<(b);i++)
#define fore(i,a,b) for(int i=(a);i<=(b);i++)
#define pb push_back
#define F first
#define S second
#define pqueue priority_queue
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef long double ld;
typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> pbds;
void amin(ll &a, ll b){ a=min(a,b); }
void amax(ll &a, ll b){ a=max(a,b); }
void YES(){cout<<"YES\n";} void NO(){cout<<"NO\n";}
void SD(int t=0){ cout<<"PASSED "<<t<<endl; }
const ll INF = ll(1e18);
const int MOD = 998244353;

const bool DEBUG = 0;
const int MAXN = 105;
const int LIMIT = 3200;
int queryCount = 0;

void query(int B[], int R[])
{
	playRound(B,R);
	queryCount++;
	assert(queryCount <= LIMIT);
}

int B[MAXN], R[MAXN];

// Subtask 1
int minValue(int n, int W)
{
	forn(i,0,n) B[i]=1;
	playRound(B,R);
	
	forn(i,0,n){
		if(R[i]==0){
			B[i]=0;
		}
		else B[i]=2;
	}
	
	forn(i,0,n){
		if(B[i]==2){
			B[i]=0; break;
		}
	}
	
	playRound(B,R);
	
	forn(i,0,n){
		if(B[i]==0 && R[i]==0) return i;
	}
	
	assert(0);
	return 0;
}

// Subtask 2
int maxValue(int n, int W)
{
	
	
	return 0;
}

// Subtask 3
int greaterValue(int n, int W)
{
	
	
	return 0;
}

void allValues(int n, int W, int *P)
{
	// Subtask 4
	if(W == 2*n)
	{
		
	}
	
	// Subtask 5
	else
	{
		
	}
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 15
• Subtask 3: 0 / 18
• Subtask 4: 0 / 10
• Subtask 5: 0 / 53