제출 #813398

#제출 시각아이디문제언어결과실행 시간메모리
813398OrazB동굴 (IOI13_cave)C++14
25 / 100
8 ms392 KiB
#include <bits/stdc++.h> #include "cave.h" using namespace std; #define all(x) (x).begin(), (x).end() #define ll long long int #define pii pair <int, int> #define pb push_back #define ff first #define ss second void exploreCave(int n){ int S[n], D[n]; for (int i = 0; i < n; i++){ S[i] = 0; D[i] = i; } int x = tryCombination(S); if (x == -1){ for (int i = 0; i < n; i++){ S[i] = 1; D[i] = tryCombination(S); S[i] = 0; } answer(S, D); }else{ while(1){ int j = tryCombination(S); if (j == -1){ answer(S, D); return; } S[j] = !S[j]; } } } // int main () // { // ios::sync_with_stdio(false); // cin.tie(0); // cin >> t; // while (t--){ // } // }
#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...