# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1013847 | huutuan | Wombats (IOI13_wombats) | C++14 | 20092 ms | 262144 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;
int dist[100][5000][100];
int R, C, H[5000][200], V[5000][200];
bool sussy;
void solve(){
for (int tt=0; tt<C; ++tt){
memset(dist[tt], 0x3f, sizeof dist[tt]);
dist[tt][0][tt]=0;
for (int i=0; i<R; ++i){
for (int j=1, mn=dist[tt][i][0]; j<C; ++j){
mn=min(mn+H[i][j-1], dist[tt][i][j]);
dist[tt][i][j]=min(dist[tt][i][j], mn);
}
for (int j=C-2, mn=dist[tt][i][C-1]; j>=0; --j){
mn=min(mn+H[i][j], dist[tt][i][j]);
dist[tt][i][j]=min(dist[tt][i][j], mn);
}
if (i+1<R){
for (int j=0; j<C; ++j) dist[tt][i+1][j]=dist[tt][i][j]+V[i][j];
}
}
}
}
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... |