# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
697452 | vjudge1 | Prisoner Challenge (IOI22_prison) | C++17 | 13 ms | 1428 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 "prison.h"
#include <stdio.h>
#include <vector>
using namespace std;
vector<vector<int>> res;
void t(int cur, int l, int r, int total){
if(l+1 >= r) return;
for(int i=cur; i<=20; i++){
res[i][l] = -1-res[i][0];
res[i][r-1] = -2+res[i][0];
}
l++; r--;
if(l == r) return;
int k;
if(total == 19) k = 2;
else k = 3;
for(int i=0; i<k; i++){
int ll = ((k-i)*l+i*r)/k;
int rr = ((k-i-1)*l+(i+1)*r)/k;
for(int j=l; j<ll; j++){
res[total+i][j] = -2+res[cur][0];
}
for(int j=ll; j<rr; j++){
res[cur][j] = total+i;
}
for(int j=rr; j<r; j++){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |