제출 #297962

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
297962		Hemimor	동굴 (IOI13_cave)	C++14	12 / 100	560 ms	632 KiB

cave

#include "cave.h"
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <vector>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<pll> vpll;
typedef pair<P,int> pip;
typedef vector<pip> vip;
const int inf=1<<30;
const ll INF=1ll<<60;
const double pi=acos(-1);
const double eps=1e-8;
const ll mod=1e9+7;
const int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};

const int M=5000;
int a[M],b[M],perm[M];

void exploreCave(int N) {
	int n=N;
	fill(perm,perm+N,-1);
	for(int i=0;i<n;i++){
		if(tryCombination(a)==i){
			for(int j=0;j<n;j++) if(perm[j]==-1) a[j]^=1;
		}
		int l=0,r=n;
		while(r-l>1){
			int m=(l+r)/2;
			for(int j=0;j<n;j++){
				if(perm[j]>=0||j<m) b[j]=a[j];
				else b[j]=1-a[j];
			}
			if(tryCombination(b)==i) l=m;
			else r=m;
		}
		perm[i]=l;
	}
	answer(a,perm);
}

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