제출 #301927

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

cave

#include "cave.h"
#include <iostream>
#include <fstream>
#include <cfloat>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <cstring>
#include <cmath>
#include <climits>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
using namespace std;
typedef pair<int, int> pii;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vvvi> vvvvi;
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vvvl> vvvvl;
typedef vector<string> vs;
#define fir first
#define sec second
#define pb push_back
#define eb emplace_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define mp make_pair
#define len(v) ((int)v.size())
#define all(v) v.begin(), v.end()

void exploreCave(int N) {
	int S[N], D[N], cur[N];
	for (int i = 0; i < N; i++) {
		S[i] = D[i] = -1;
		cur[i] = 0;
	}
	int val = tryCombination(cur), curVal;
	if (val == -1) {
		for (int i = 0; i < N; i++) D[i] = 0;
		for (int i = 0; i < N; i++) {
			cur[i] = 1;
			curVal = tryCombination(cur);
			S[i] = curVal;
			cur[i] = 0;
		}
		answer(S, D);
		return;
	}
	while(val != -1) {
		for (int i = 0; i < N; i++) {
			cur[i] = 1;
			curVal = tryCombination(cur);
			if (curVal > val || curVal == -1) {
				S[i] = curVal;
				D[i] = 1;
				val = curVal;
			} else if (curVal < val) {
				S[i] = curVal;
				D[i] = 0;
				cur[i] = 0;
			} else {
				cur[i] = 0;
			}
			if (val == -1) break;
		}
	}
	for (int i = 0; i < N; i++) {
		if (S[i] == -1) {
			D[i] = cur[i];
			cur[i] = 1 - cur[i];
			S[i] = tryCombination(cur);
			cur[i] = 1 - cur[i];
		}
	}
	answer(S, D);
	return;
}

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