Submission #161601

#	Time	Username	Problem	Language	Result	Execution time	Memory
161601		kostia244	동굴 (IOI13_cave)	C++14	12 / 100	19 ms	524 KiB

cave

#include "cave.h"
#include<bits/stdc++.h>
const int maxn = 5051;
int n;
int S[maxn], D[maxn];
void exploreCave(int N) {
    n = N;
    for(int i = 0; i < n; i++) {
    	D[i] = i;
    }
    memset(S, 0, sizeof S);
    int x;
    while(true) {
    	x = tryCombination(S);
    	if(x==-1)break;
    	else S[x]^=1;
    }
    answer(S, D);
}

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