# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
56766 | hamzqq9 | Cave (IOI13_cave) | C++14 | 430 ms | 708 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;
#define MAX 5005
#define sz(x) ((int)x.size())
#define pb push_back
int Q[MAX],S[MAX],state_of_door[MAX];
int N;
int solve(vector<int> &POS,int now,int VAL) {
while(sz(POS)>1) {
int mid=sz(POS)/2-1;
for(int i=0;i<=mid;i++) {
Q[POS[i]]=VAL;
}
for(int i=mid+1;i<sz(POS);i++) {
Q[POS[i]]=!VAL;
}
# | 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... |