제출 #289952

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
289952		AKaan37	동굴 (IOI13_cave)	C++17	100 / 100	1691 ms	840 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],d[li],e[li];
int cev;
string s;
vector<int> v;

void exploreCave(int n) {
	memset(c,0,sizeof(c));
	c[3]=1;
	//~ cout<<inv[0]<<endl;
	int yes=tryCombination(c);
	//~ printf("%d\n",yes);
    FOR{
		memset(c,-1,sizeof(c));
		for(int j=0;j<i;j++){
			c[b[j]]=a[j];
		}
		for(int j=0;j<n;j++){
			if(~c[j])continue;
			c[j]=1;
		}
		int at=tryCombination(c);
		//~ cout<<at<<"**"<<endl; 
		if(at<=i && at!=-1){
			int bas=0;
			int son=n-1;
			while(bas<=son){
				memset(c,-1,sizeof(c));
				for(int j=0;j<i;j++){
					c[b[j]]=a[j];
				}
				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 && at!=-1)bas=ort+1;
				else son=ort-1;
			}
			a[i]=0;
			b[i]=bas;
		}
		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[j]]=a[j];
				}
				for(int j=0;j<n;j++){
					if(~c[j])continue;
					if(j<=ort)c[j]=1;
					else c[j]=0;
				}
				//~ if(i==3){
					//~ for(int j=0;j<n;j++)cout<<c[j]<<" ()*() "<<i<<endl;
					//~ cout<<endl;
				//~ }
				at=tryCombination(c);
				if(at<=i && at!=-1)bas=ort+1;
				else son=ort-1;
				//~ cout<<at<<" : : "<<i<<endl;
			}
			a[i]=1;
			b[i]=bas;
		}
	}
	FOR{
		d[b[i]]=i;
		e[b[i]]=a[i];
	}
	answer(e,d);
}

컴파일 시 표준 에러 (stderr) 메시지

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:34:6: warning: unused variable 'yes' [-Wunused-variable]
   34 |  int yes=tryCombination(c);
      |      ^~~

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