# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
768912 | raysh07 | Jakarta Skyscrapers (APIO15_skyscraper) | C++17 | 172 ms | 124448 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;
#define int long long
#define INF (int)1e18
#define f first
#define s second
mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());
void Solve()
{
int n, m; cin >> n >> m;
vector <pair<int, int>> a(m);
set <int> st[n];
int target;
vector <int> d(n, INF);
priority_queue <pair<int, int>> pq;
for (int i = 0; i < m; i++){
cin >> a[i].f >> a[i].s;
if (i == 0) {
d[a[i].f] = 0;
pq.push({0, a[i].f});
}
if (i != 1) st[a[i].f].insert(a[i].s);
else target = a[i].f;
}
vector<vector<pair<int, int>>> adj(n);
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... |