# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
586720 | AlperenT | Wombats (IOI13_wombats) | C++17 | 20105 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 <bits/stdc++.h>
#include "wombats.h"
using namespace std;
const int N = 5000 + 1, M = 100, INF = 1e9 + 5;
int n, m, h[N][M], v[N][M], dist[M][N][M];
void calc_dist(){
for(int lst = 0; lst < m; lst++){
for(int c = 0; c < m; c++) dist[lst][n][c] = INF;
dist[lst][n][lst] = 0;
for(int r = n - 1; r >= 0; r--){
vector<pair<int, int>> vec;
for(int c = 0; c < m; c++){
dist[lst][r][c] = dist[lst][r + 1][c] + v[r][c];
vec.push_back({dist[lst][r][c], c});
}
sort(vec.begin(), vec.end());
for(int i = 0; i < m; i++){
int c = vec[i].second;
int cur = c;
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... |