Submission #166572

#	Time	Username	Problem	Language	Result	Execution time	Memory
166572		dyd	동굴 (IOI13_cave)	C++14	25 / 100	33 ms	512 KiB

cave

#include<bits/stdc++.h>
#include "cave.h"
const int MAXN=5010;
int s[MAXN];
int d[MAXN];
int tryCombination(int s[]);
void answer(int s[],int d[]);
void exploreCave(int n){
	if(tryCombination(s)==-1){
		for(int i=0;i<n;i++){
		    s[i]=1;
		    int a=tryCombination(s);
		    d[i]=a;
		    s[i]=0;
	    }
	    answer(s,d);
	}
	for(int i=0;i<n;i++){
		d[i]=i;
		if(tryCombination(s)==i) s[i]=1;
	}
	answer(s,d);
}

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