제출 #1316204

#제출 시각아이디문제언어결과실행 시간메모리
1316204pablo7948동굴 (IOI13_cave)C++20
0 / 100
2095 ms332 KiB
#include "cave.h"
#include <vector>

using namespace std;

void exploreCave(int N) {
    vector<int> comb(N, 0);
    vector<int> inter(N, 0);
    for(int i = 0; i < N; i++) inter[i] = i;
    
    int r = tryCombination(comb.data());
    while(r != -1) {
        comb[r] = 1 - comb[r];    
    }
    answer(comb.data(), inter.data());
}
#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...