제출 #172777

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
172777		mohammad	동굴 (IOI13_cave)	C++14	13 / 100	42 ms	552 KiB

cave

/*
░░░░██████████████████
░░▄███████▀▀▀▀▀▀███████▄
░▐████▀▒mohammad▒▀██████▄
░███▀▒▒▒▒alaa▒▒▒▒▒▒▀█████
░▐██▒▒▒alwrawrah▒▒▒▒▒████▌
░▐█▌▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒████▌
░░█▒▄▀▀▀▀▀▄▒▒▄▀▀▀▀▀▄▒▐███▌
░░░▐░░░▄▄░░▌▐░░░▄▄░░▌▐███▌
░▄▀▌░░░▀▀░░▌▐░░░▀▀░░▌▒▀▒█▌
░▌▒▀▄░░░░▄▀▒▒▀▄░░░▄▀▒▒▄▀▒▌
░▀▄▐▒▀▀▀▀▒▒▒▒▒▒▀▀▀▒▒▒▒▒▒█
░░░▀▌▒▄██▄▄▄▄████▄▒▒▒▒█▀
░░░░▄██████████████▒▒▐▌
░░░▀███▀▀████▀█████▀▒▌
░░░░░▌▒▒▒▄▒▒▒▄▒▒▒▒▒▒▐
░░░░░▌▒▒▒▒▀▀▀▒▒▒▒▒▒▒▐
*/	
 
#include<bits/stdc++.h>
#include "cave.h"
using namespace std;
 
typedef long long ll ;
const ll oo = 4294967296;
const double PI = acos(-1);
const ll M = 998244353;

int s[5010] , d[5010];

void exploreCave(int N){
	for(int i = 0 ; i < N ; ++i) d[i] = -1  , s[i] = 0;
	int x = tryCombination(s) , idx = 0;
	while(x != -1){
		if(s[idx] == 1){
			idx++;
			if(idx == N) idx = 0;
			continue;
		}
		s[idx] = 1 ;		
		int nx = tryCombination(s);
		if(x >= nx) s[idx] = 0;
		idx++;
		if(idx == N) idx = 0;
	}
	for(int i = 0  ; i < N ; ++i){
		s[i] = !s[i];
		int x = tryCombination(s);
		d[i] = x;
		s[i] = !s[i];
	}
	answer(s , d);
}

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