Submission #670690

#	Time	Username	Problem	Language	Result	Execution time	Memory
670690		pzorro	동굴 (IOI13_cave)	C++14	13 / 100	11 ms	380 KiB

cave

#include <iostream>
#include <bits/stdc++.h>
#include "cave.h"

using namespace std;

const int MAXN = 5 * 1e3;

int s[MAXN];
int d[MAXN];

void exploreCave(int n){
    for(int i = 0; i < n; i++){
        s[i] = 0;
        //d[i] = i;
    }
    for(int i = 0; i < n; i++){
        s[i]++;
        int res = tryCombination(s);
        d[i] = res;
        s[i]--;
    }
    answer(s, d);
}

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