# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
765891 | fefe | Wombats (IOI13_wombats) | C++17 | 5675 ms | 105220 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 inf = 0x3fffffff;
// duplication of the original data
int r, c;
int dr;
int h[5000][200], v[5000][200];
// seg_tree
struct node {
int dp[200][200];
node *l, *r;
node(){}
}*root;
// array used in merge function
int D[200][200];
int temp[200][200];
void merge(int A[200][200], int B[200][200], int cost[200], int M[200][200]) {
// s == e
for (int i = 0; i < c; i++) {
temp[i][i] = inf;
D[i][i] = i;
for (int j = 0; j < c; j++) {
if (temp[i][i] > A[i][j] + cost[j] + B[j][i]) {
temp[i][i] = A[i][j] + cost[j] + B[j][i];
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... |