Submission #1298410

#TimeUsernameProblemLanguageResultExecution timeMemory
1298410martin_011Cave (IOI13_cave)C++20
12 / 100
12 ms472 KiB
#include "cave.h" #include <bits/stdc++.h> using namespace std; #define ll long long #define ld long double #define vi vector<int> #define vll vector<ll> #define str string #define vd void #define vb vector<bool> #define F first #define S second #define lbr '\n' #define all(x) x.begin(), x.end() const ll INF = 1E15; void exploreCave(int n) { int a[n]; for (int i=0; i<n; i++) a[i] = 1; ll mp = 0; while (mp != -1) { mp = tryCombination(a); a[mp] = 0; } int aux[n]; for (int i=0; i<n; i++) aux[i] = i; answer(a, aux); }
#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...