Submission #481639

#TimeUsernameProblemLanguageResultExecution timeMemory
481639SlavicGCave (IOI13_cave)C++17
0 / 100
2 ms332 KiB
#include"cave.h" #include "bits/stdc++.h" using namespace std; #define ll long long #define forn(i,n) for(int i=0;i<n;i++) #define all(v) v.begin(), v.end() #define rall(v) v.rbegin(),v.rend() #define pb push_back #define sz(a) (int)a.size() void exploreCave(int n){ int a[n]; forn(i, n)a[i] = 0; int x = tryCombination(a); while(x != -1){ a[x + 1] ^= 1; x = tryCombination(a); } int v[n]; forn(i, n)v[i] = i; answer(v, a); }
#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...