Submission #142484

#TimeUsernameProblemLanguageResultExecution timeMemory
142484ahmetCave (IOI13_cave)C++14
12 / 100
38 ms464 KiB
#include <bits/stdc++.h>
#include "cave.h"
using namespace std;
#define ll long long
#define rep(i,n) for(long long (i)=0;(i)<(n);++(i))
#define ref(i,a,b) for (long long (i)=(a); (i)<=(b); ++(i))
#define INF 0xFFFFFF
#define endl '\n'
#define pb push_back
#define mp make_pair
const unsigned int mod = 1e9+7;
const int mx=100005;
void exploreCave(int n){
	int s[n],d[n];
	memset(s,0,sizeof(s));
	for(int i=0;i<n;++i){
		d[i]=i;
		int cur=tryCombination(s);
		if(cur==i)s[i]=1-s[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...