| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 456272 | fuad27 | Cave (IOI13_cave) | C++14 | 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;
void p25(int N) {
void exploreCave(int N) {
int S[N+1];
int t[N+1];
for(int i = 0 ; i < N ; ++i) S[i] = 0, t[i] = i;
int val = tryCombination(S);
if(val == -1)
{
for(int i = 0 ; i < N ; ++i){
S[i] = 1;
t[i] = tryCombination(S);
S[i] = 0;
}
}
else{
while(val != -1) {
S[val] = !S[val];
val = tryCombination(S);
}
}
answer(S, t);
}
}
void p34(int N) {
int S[N], D[N]; int l = 0;
for (int i = 0; i < N; i++) S[i] = 0;
while (l != -1) {
l = tryCombination(S);
for (int i = 0; i < N; i++) {
S[i] = (S[i] - 1)*(S[i] - 1);
int a = tryCombination(S);
if (a > l || a == -1) {
l = a;
break;
}
S[i] = (S[i] - 1)*(S[i] - 1);
}
}
for (int i = 0; i < N; i++) {
S[i] = (S[i] - 1)*(S[i] - 1);
D[i] = tryCombination(S);
S[i] = (S[i] - 1)*(S[i] - 1);
}
answer(S, D);
}
void exploreCave(int N) {
p34(N);
p25(N);
}