# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
108886 | kuroni | Jakarta Skyscrapers (APIO15_skyscraper) | C++17 | 210 ms | 79140 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 <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <algorithm>
#define fi first
#define se second
using namespace std;
const int N = 30005, D = 180, MX = 5E5 + 5, INF = 1E9 + 7;
int n, m, d, b, p, st, en, dis[N][D];
vector<int> dif[N];
vector<pair<int, int>> ve[MX];
void mini(pair<int, int> u, int v)
{
if (dis[u.fi][u.se] > v)
{
dis[u.fi][u.se] = v;
ve[v].push_back(u);
}
}
void dijkstra()
{
for (int i = 0; i < n; i++)
for (int j = 0; j < d; j++)
dis[i][j] = INF;
dis[st][0] = 0; ve[0].push_back({st, 0});
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... |