Submission #29872

#	Time	Username	Problem	Language	Result	Execution time	Memory
29872		dereotu	Cave (IOI13_cave)	C++14	12 / 100	22 ms	640 KiB

cave

#include "cave.h"
#include <bits/stdc++.h>
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define st first
#define nd second
#define forr(i,A,B) for(int i=A;i<B;++i)
#define space ' '
#define endl '\n'
#define LL long long
using namespace std;

void exploreCave(int N) {
    int a[N]={0},ans[N],done[N];
    memset(ans,-1,sizeof ans);
    memset(done,-1,sizeof done);
    forr(i,0,N) ans[i]=i;
    int locked=tryCombination(a);
    forr(i,0,N){
    	locked=tryCombination(a);
    	if(locked==-1) break;
    	a[locked]=!a[locked];
    }
   	
    answer(a,ans);

}

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