# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
131302 | dragonslayerit | Hotter Colder (IOI10_hottercolder) | C++14 | 3424 ms | 35292 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 "grader.h"
#include <cstdio>
#include <cassert>
#include <algorithm>
const int SMALL=85;
char cost[SMALL+2][SMALL+2][SMALL+2][SMALL+2];//l,r,x
void Brute(int N){
if(cost[N][1][N][1]) return;
for(int l=0;l<=N;l++){
for(int r=0;r<=N;r++){
for(int x=1;x<=N;x++){
cost[N][l][r][x]=50;
}
}
}
for(int l=1;l<=N;l++){
for(int x=1;x<=N;x++){
cost[N][l][l][x]=0;
}
}
//Assuming OPT will never make a guess without reducing interval
//Seems to be true from experimentation
for(int l=N;l>0;l--){
for(int r=l;r<=N;r++){
for(int x=1;x<=N;x++){
int k=-1;
for(int y=1;y<=N;y++){
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... |