제출 #318776

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
318776		Foxyy	동굴 (IOI13_cave)	C++14	0 / 100	757 ms	512 KiB

cave

#include "cave.h"

#include <bits/stdc++.h>
using namespace std;

const int MAXN = 200000;
const int INF = 0x3f3f3f3f, MOD = 1000000007;
#define INIT(arr, val) fill(arr, arr+(int)(sizeof(arr)/sizeof(arr[0])), val)
#define REP(i, lb, rb, inc) for(int i = (lb); i < (rb); i += inc)
#define RREP(i, rb, lb, dec) for(int i = (rb)-1; i >= (lb); i -= dec)
typedef long long ll;
#define sz size()
typedef stack<int, vector<int> > SI;
typedef queue<int> QI;
typedef vector<int> VI;
#define pb push_back
//typedef pair<int, int> PII;
//#define mp make_pair
//#define F first
//#define S second
#define endl '\n'
#define dbg(a, b) cerr << "dbg: a " << b << endl;
#define dbg_itv(a, b, c) cerr << "dbg_itv: " << a << " " << b << " : " << c << endl
#define IOS() cin.tie(0); cout.sync_with_stdio(0)

void exploreCave(int N) {
	int arr[N];
	int D[N], S[N];
    REP(i, 0, N, 1) {
    	fill(arr, arr+N, 0);
    	REP(j, 0, i, 1) arr[D[j]] = S[j];
    	int ret = tryCombination(arr);
   		if (ret > i) S[i] = 0;
		else		 D[i] = 1;
		int lb, rb;
		lb = 0; rb  = N;
		while(rb - lb - 1 > 0) {
			int mid = (lb+rb)/2;
			fill(arr+lb, arr+mid, S[i]); fill(arr+mid, arr+rb, 1-S[i]);
    		REP(j, 0, i, 1) arr[D[j]] = S[j];
			ret = tryCombination(arr);
			if (ret > i) rb = mid;
			else		 lb = mid;
		}
		D[i] = lb;
	}
	answer(S, D);
}

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