# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
415527 | Pro_ktmr | Cave (IOI13_cave) | C++17 | 407 ms | 460 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 <bits/stdc++.h>
using namespace std;
#define pb push_back
#define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
#define repi(i, a, b) for(int (i)=(a); (i)<(b); (i)++)
#include "cave.h"
// int tryCombination(int S[])
// void answer(int S[], D[])
namespace {
int s[5000], S[5000], D[5000];
void turn(int l, int r){
repi(i, l, r){
if(S[i] == -1) s[i] ^= 1;
}
}
}
void exploreCave(int N) {
rep(i, N){
S[i] = -1;
s[i] = 0;
D[i] = -1;
}
rep(i, N - 1){
int res = tryCombination(s);
if(res != i) turn(0, N);
int l = 0, r = N;
while(r - l > 1){
Compilation message (stderr)
# | 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... |