# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
847409 | manhlinh1501 | Jakarta Skyscrapers (APIO15_skyscraper) | C++17 | 367 ms | 26836 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>
using namespace std;
const short N = 3e4 + 5;
#define eb emplace_back
struct node {
int w;
short u, s;
node() {
w = u = s = 0;
}
node(int w, short u, short s) : w(w), u(u), s(s) {}
friend bool operator > (node a, node b) {
return a.w > b.w;
}
};
short n, m;
int dist[N][200];
vector<short> adj[N];
priority_queue<node, vector<node>, greater<node>> Q;
short start, finish;
bool vis[N];
void update(short u, short v, int w, short cur, short siu) {
# | 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... |