# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
843750 | Tob | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 596 ms | 28240 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 ll long long
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define pb push_back
#define FIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
using namespace std;
typedef pair <int, int> pii;
const int N = 30007, B = 200, inf = 1e9;
int n, m;
int b[N], p[N], dis[N*B];
vector <int> td[N], gt[N];
set <pii> s;
int En(int x, int y = 0) {return y*N + x;}
pii De(int x) {return {x%N, x/N};}
void Vis(int x, int y, int w) {
if (dis[x] + w < dis[y]) {
if (dis[y] != inf) s.erase({dis[y], y});
dis[y] = dis[x] + w;
s.insert({dis[y], y});
}
}
# | 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... |