Submission #289923

#	Time	Username	Problem	Language	Result	Execution time	Memory
289923		AKaan37	Cave (IOI13_cave)	C++17	0 / 100	449 ms	512 KiB

cave

#include "cave.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long lo;
typedef pair< lo,lo > PII;

#define fi first
#define se second
#define mp make_pair
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=0;i<n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo inf = 1000000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 5003;
const lo mod = 1000000007;

int n,m,b[li],a[li],k,flag,t,c[li];
int cev;
string s;
vector<int> v;

void exploreCave(int n) {
    FOR{
		memset(c,-1,sizeof(c));
		for(int j=0;j<i;j++){
			c[b[i]]=a[i];
		}
		for(int j=0;j<n;j++){
			if(~c[j])continue;
			c[j]=1;
		}
		int at=tryCombination(c);
		if(at<=i){
			int bas=0;
			int son=n-1;
			while(bas<=son){
				memset(c,-1,sizeof(c));
				for(int j=0;j<i;j++){
					c[b[i]]=a[i];
				}
				for(int j=0;j<n;j++){
					if(~c[j])continue;
					if(j<=ort)c[j]=0;
					else c[j]=1;
				}
				at=tryCombination(c);
				if(at<=i)bas=ort+1;
				else son=ort-1;
			}
			a[i]=0;
			b[i]=son;
		}
		else{
			int bas=0;
			int son=n-1;
			while(bas<=son){
				memset(c,-1,sizeof(c));
				for(int j=0;j<i;j++){
					c[b[i]]=a[i];
				}
				for(int j=0;j<n;j++){
					if(~c[j])continue;
					if(j<=ort)c[j]=1;
					else c[j]=0;
				}
				at=tryCombination(c);
				if(at<=i)bas=ort+1;
				else son=ort-1;
			}
			a[i]=1;
			b[i]=son;
		}
	}
	answer(a,b);
}

• Subtask 1: 0 / 12
• Subtask 2: 0 / 13
• Subtask 3: 0 / 21
• Subtask 4: 0 / 30
• Subtask 5: 0 / 24