Submission #29884

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
29884	2017-07-21T10:02:50 Z	dereotu	Cave (IOI13_cave)	C++14	12 / 100	17 ms	524 KB

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);
    if(N>=100){
    	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);
    }
    if(last==-1){
    	forr(i,0,N){
    		a[i]=1;
    		int res=tryCombination(a);
    		ans[i]=res;
    		a[i]=0;
    	}
    }
    else{
	    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

12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	11 ms	384 KB	Output is correct
2	Correct	16 ms	384 KB	Output is correct
3	Correct	15 ms	384 KB	Output is correct
4	Correct	13 ms	472 KB	Output is correct
5	Correct	7 ms	488 KB	Output is correct
6	Correct	13 ms	488 KB	Output is correct
7	Correct	7 ms	384 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	6 ms	384 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct
12	Correct	14 ms	512 KB	Output is correct
13	Correct	15 ms	512 KB	Output is correct
14	Correct	17 ms	524 KB	Output is correct

Subtask #2

0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	512 KB	Output is correct
2	Correct	6 ms	384 KB	Output is correct
3	Incorrect	7 ms	512 KB	Answer is wrong
4	Halted	0 ms	0 KB	-

Subtask #3

0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	6 ms	384 KB	Output is correct
3	Correct	6 ms	384 KB	Output is correct
4	Correct	6 ms	368 KB	Output is correct
5	Incorrect	6 ms	384 KB	Answer is wrong
6	Halted	0 ms	0 KB	-

Subtask #4

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	6 ms	384 KB	Output is correct
3	Correct	6 ms	384 KB	Output is correct
4	Correct	6 ms	368 KB	Output is correct
5	Incorrect	6 ms	384 KB	Answer is wrong
6	Halted	0 ms	0 KB	-

Subtask #5

0 / 24.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	11 ms	384 KB	Output is correct
2	Correct	16 ms	384 KB	Output is correct
3	Correct	15 ms	384 KB	Output is correct
4	Correct	13 ms	472 KB	Output is correct
5	Correct	7 ms	488 KB	Output is correct
6	Correct	13 ms	488 KB	Output is correct
7	Correct	7 ms	384 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	6 ms	384 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct
12	Correct	14 ms	512 KB	Output is correct
13	Correct	15 ms	512 KB	Output is correct
14	Correct	17 ms	524 KB	Output is correct
15	Correct	7 ms	512 KB	Output is correct
16	Correct	6 ms	384 KB	Output is correct
17	Incorrect	7 ms	512 KB	Answer is wrong
18	Halted	0 ms	0 KB	-