Submission #208998

#TimeUsernameProblemLanguageResultExecution timeMemory
208998robsCave (IOI13_cave)C++17
0 / 100
7 ms512 KiB
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e4;
int s[maxn],d[maxn];

void exploreCave(int N){
	while(true)
	{
		int n = tryCombination(s);
		if(n == -1)	break;
		s[n-1] ^= 1;
	}
	for(int i = 0; i < N; i++)	d[i] = i;
	answer(s, d);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...