Submission #813394

#TimeUsernameProblemLanguageResultExecution timeMemory
813394OrazBCave (IOI13_cave)C++14
12 / 100
9 ms468 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++){ D[i] = i; S[i] = 0; } 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...