# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
100569 | Extazy | Jakarta Skyscrapers (APIO15_skyscraper) | C++17 | 902 ms | 2808 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>
#define endl '\n'
using namespace std;
const int N = 30007, INF = (1e9) + 7;
struct el {
int to, cost;
el() {}
el(int a, int b): to(a), cost(b) {}
bool operator <(const el &a) const {
return cost > a.cost;
}
};
int n, m, start[N], jump[N], dist[N];
vector < int > v[N];
bool in[N];
void spfa() {
queue < int > q;
int i, j, curr, current_distance;
fill(dist, dist + n, INF);
dist[start[0]] = 0;
q.push(start[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... |