제출 #1291575

#제출 시각아이디문제언어결과실행 시간메모리
1291575hssaan_arifCave (IOI13_cave)C++20
0 / 100
1 ms340 KiB
#include <bits/stdc++.h> #include "cave.h" using namespace std; #define endl "\n" #define pb push_back // #define int long long #define fi first #define se second const int N = 3e5 + 5, M = 1e9 + 7, LG = 20; int n , A[N] , y , k; void exploreCave(int N) { int S[N] = {} , D[N] = {}; for (int i=0 ; i<n ; i++){ int u = tryCombination(S); if (u == -1 || u >= i){ continue; }else{ S[i] = 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...