# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
135434 | Talant | Wombats (IOI13_wombats) | C++17 | 20092 ms | 32672 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 "grader.cpp"
#include <bits/stdc++.h>
#define sc second
#define fr first
#define mk make_pair
#define pb push_back
using namespace std;
const int N = (1e6 + 5);
const int inf = (1e9 + 7);
int n,m;
int d[N];
int sum;
vector <pair<int,int> > g[N];
void init(int R, int C, int H[5000][200], int V[5000][200]) {
n = R,m = C;
for (int i = 1; i <= n; i ++) {
for (int j = 1; j < m; j ++) {
int cur = (i - 1) * m + j;
g[cur].pb(mk(cur + 1,H[i - 1][j - 1]));
g[cur + 1].pb(mk(cur,H[i - 1][j - 1]));
}
}
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... |