Submission #29842

#	Time	Username	Problem	Language	Result	Execution time	Memory
29842		dereotu	Cave (IOI13_cave)	C++14	0 / 100	137 ms	488 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);
    int last=tryCombination(a);
    forr(j,0,N){
	    forr(i,0,N){
	    	if(done[i]!=-1) continue;
	    	a[i]=1;
	    	int res=tryCombination(a);
	    	if(res==-1){
	    		a[i]=0;
	    		int wtf=tryCombination(a);
	    		ans[i]=wtf;
	    		a[i]=1;
	    		done[i]=1;
	    		continue;
	    	}
	    	if(res!=last){
	    		if(last>res){
	    			a[i]=0;
	    			ans[i]=res;
	    			done[i]=1;
	    		}
	    		else{ 
	    			ans[i]=last;
	    			a[i]=1;
	    			done[i]=1;
	    			last=res;
	    		}
	    	}
	    	else{
	    		a[i]=0;
	    	}
	    }	
    }
    answer(a,ans);

}

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