# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1164545 | tsengang | Cave (IOI13_cave) | C++20 | 28 ms | 536 KiB |
#include<bits/stdc++.h>
#include "cave.h"
using namespace std;
#define ll long long
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define ertunt return
#define vodka void
void exploreCave(int n){
int v[n] = {0};
int d[n] = {0};
int x = tryCombination(d);
vector<int>vis(n,0);
while(x != -1){
for(ll i = 0; i < n; i++){
d[i] = 1-d[i];
int c = tryCombination(d);
if(c > x or c == -1){
x = c;
break;
}
d[i] = 1-d[i];
}
}
for(int i = 0; i < n; i++){
d[i] = 1-d[i];
int x = tryCombination(d);
v[i] = x;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |