# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
2486 | kriii | Wombats (IOI13_wombats) | C++98 | 12266 ms | 176676 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 "wombats.h"
#define group_size 10
const int NON = 0x0fffffff;
const int Z = 512;
int N, M, G, Start[Z], End[Z], MADE;
int ANS[200][200],GO[Z*2][200][200];
int NOW[200],LEFT[200],RIGHT[200];
int HH[5000][200],VV[5000][200];
inline int min(int a, int b){return a < b ? a : b;}
void going(int i)
{
int j;
for (j=0;j<M;j++) LEFT[j] = RIGHT[j] = NOW[j];
for (j=1;j<M;j++){
if (LEFT[j-1] == NON) continue;
LEFT[j] = min(LEFT[j],LEFT[j-1]+HH[i][j-1]);
}
for (j=M-2;j>=0;j--){
if (RIGHT[j+1] == NON) continue;
RIGHT[j] = min(RIGHT[j],RIGHT[j+1]+HH[i][j]);
}
for (j=0;j<M;j++){
NOW[j] = min(NOW[j],LEFT[j]);
NOW[j] = min(NOW[j],RIGHT[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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |