# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1263399 | aren_dance | 동굴 (IOI13_cave) | C++20 | 0 ms | 0 KiB |
#include <iostream>
#include <vector>
#include "cave.h"
using namespace std;
void exploreCave(int N) {
vector<int> p1 = {};
vector<int> p2;
for (int i = 0;i < N;++i) {
p1.push_back(0);
p2.push_back(i);
}
tryCombination(p1);
answer(p2,p1);
}