# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
798487 | QwertyPi | Wombats (IOI13_wombats) | C++14 | 20073 ms | 26028 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"
#include <bits/stdc++.h>
using namespace std;
const int R_MAX = 5000;
const int C_MAX = 200;
const int K = 50;
const int INF = 1 << 30;
int R, C, H[R_MAX][C_MAX], V[R_MAX][C_MAX];
int A[R_MAX / K][C_MAX][C_MAX], B[C_MAX][C_MAX];
int DP[C_MAX][C_MAX];
void init(){
for(int i = 0; i < C; i++) for(int j = 0; j < C; j++) DP[i][j] = i == j ? 0 : INF;
}
bool chmin(int& x, int y){
if(x > y){
x = y; return true;
}
return false;
}
void process(int row){
for(int i = 0; i < C; i++){
for(int j = 0; j < C; j++){
for(int k = j - 1; k >= 0; k--){
if(!chmin(DP[i][k], DP[i][k + 1] + H[row][k])){
break;
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |