제출 #1167740

#제출 시각아이디문제언어결과실행 시간메모리
1167740Dedibeat동굴 (IOI13_cave)C++20
13 / 100
7 ms328 KiB
#include "cave.h" #include<bits/stdc++.h> #define pb push_back #define eb emplace_back #define F first #define S second #define endl '\n' #define all(x) (x).begin(), (x).end() #define put(x) cout << (x) << '\n' using namespace std; using ll = long long; void exploreCave(int N){ int S[N], D[N]; for(int i = 0; i < N; i++) S[i] = 0; for(int i = 0; i < N; i++){ S[i] = 1; D[i] = tryCombination(S); S[i] = 0; } 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...