Submission #511106

#	Time	Username	Problem	Language	Result	Execution time	Memory
511106		bebecanvas	Cave (IOI13_cave)	C++14	13 / 100	183 ms	428 KiB

cave

#include "cave.h"
#include <queue>

void exploreCave(int N) {
    int d[N];
    
    int s[N];
    for(int i=0; i<N; i++){s[i]=0;}
    std::queue<int> q;
    for(int i=0; i<N; i++){
		q.push(i);
	}
	
	int prev= tryCombination(s);
	while(!q.empty()){
		int a= q.front(); q.pop();
		s[a]++; s[a]%=2;
		int b= tryCombination(s);
		if(b==prev){q.push(a);}
		else if(b>prev&&prev!=-1){
			d[a]= prev;
			prev= b;
		}else{
			d[a]= b;
			s[a]++; s[a]%=2;
		}
	}
	
	answer(s, d);

	
}

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