Submission #1244634

#	Time	Username	Problem	Language	Result	Execution time	Memory
1244634		Nurislam	Cave (IOI13_cave)	C++20	0 / 100	7 ms	328 KiB

cave

#include <bits/stdc++.h>
#include "cave.h"

using namespace std;

void exploreCave(int n) {
	int a[n], us[n];
	int f = 0;
	int ans1[n], ans2[n];
	for(int i = 0; i < n; i ++ ){
		a[i] = 0; ans1[i] = 0; ans2[i] = 0; us[i] = 0;
	};
	
		
	for(int t = 0; t < n; t ++ ) {
		int x = tryCombination(a);
		
		if(x == t){
			for(int i = 0; i < n; i ++ ) {
				if(us[i])continue;
				a[i] ^= 1;
				if(tryCombination(a) != t){
					ans1[i] = t;
					ans2[i] = 1;
					break;
				};
				a[i] ^= 1;
			};
		}else {
			for(int i = 0; i < n; i ++ ) {
				if(us[i])continue;
				a[i] ^= 1;
				if(tryCombination(a) == t) {
					ans1[i] = t;
					ans2[i] = 0;
					a[i] ^= 1;
					break;
				};
				a[i] ^= 1;
			};
		};
	}
	
	answer(ans2, ans1);
	
}

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