| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 985308 | SzymonKrzywda | Cave (IOI13_cave) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include"cave.h"
#include <bits/stdc++.h>
using namespace std;
int tryCombination(int S[]);
void answer(int S[],int D[]);
void exploreCave(int N){
int S[N];
//int S_2[N];
// 0 0 0 0 0
// 1 1 1 1 1
// 1 1 1 1 0
//1110
//3102
int D_1(N);
int D_2(N);
for (int i=0; i<N; i++) D_2[i] = 1;
bool good[N];
int D[N];
int w = 0,akt=0,w_2=0;
while (w != -1){
if (akt == 0){
w = tryCombination(D_1);
if (w == -1) D=D_1;
for (int i=0; i<N; i++){
if (!good[i]){
D_1[i] = 1;
w_2 = tryCombination(D_1);
if (w_2 < w){
D_2[i] = 0;
D_1[i] = 0;
good[i] = true;
}
else if(w_2 > w){
good[i] = true;
}
else D_1[i] = 0;
}
}
}
else{
w = tryCombination(D_2);
if (w == -1) D=D_2;
for (int i=0; i<N; i++){
if (!good[i]){
D_2[i] = 0;
w_2 = tryCombination(D_2);
if (w_2 < w){
D_2[i] = 1;
D_1[i] = 1;
good[i] = true;
}
else if(w_2 > w){
good[i] = true;
}
else D_1[i] = 1;
}
}
}
akt = (akt+1)%2;
}
for (int i=0; i<N; i++){
S[i] = (S[i]+1)%2;
D[i] = tryCombination(S);
S[i] = (S[i]+1)%2;
}
answer(S,D);
}