# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
280360 | Kastanda | Wombats (IOI13_wombats) | C++11 | 20085 ms | 29040 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.
// M
#include<bits/stdc++.h>
#include "wombats.h"
using namespace std;
const int N = 5005, M = 202, SQ = 70, QS = N / SQ;
int n, m, H[N][M], V[N][M];
int DS[QS][M][M];
int D[M], D2[M];
priority_queue < pair < int , int > > Pq;
inline void Build(int block)
{
int l = block * SQ;
int r = min(l + SQ, n);
for (int st = 0; st < m; st ++)
{
memset(D, 63, sizeof(D));
D[st] = 0;
for (int i = l; i < r; i ++)
{
for (int j = 0; j < m; j ++)
Pq.push({-D[j], j});
while (Pq.size())
{
int d = -Pq.top().first;
int v = Pq.top().second;
Pq.pop();
if (d > D[v])
continue;
if (v > 0 && D[v] + H[i][v - 1] < D[v - 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... |