# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
76361 | shoemakerjo | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 163 ms | 16504 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 maxn 30010
#define pii pair<int, int>
int N, M;
priority_queue<pii, vector<pii>, greater<pii>> pq;
const int inf = 987654321;
vector<vector<int>> mov(maxn);
int dist[maxn];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> N >> M;
int source, sink;
int b, p;
for (int i = 0; i < M; i++) {
cin >> b >> p;
mov[b].push_back(p);
if (i == 0) source = b;
if (i == 1) sink = b;
}
for (int i = 0; i < N-1; i++) {
sort(mov[i].begin(), mov[i].end());
}
fill(dist, dist+maxn, inf);
dist[source] = 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... |