제출 #670632

#제출 시각아이디문제언어결과실행 시간메모리
670632pzorro동굴 (IOI13_cave)C++14
12 / 100
9 ms400 KiB
#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;
    }
    int res;
    do{
        res = tryCombination(s);
        if(res != -1){
            s[res]+=1;
        }
    }while(res != -1);
    answer(s, d);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...