# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
537393 | OrazB | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 774 ms | 63468 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;
int n, m;
int pw[100005];
int pos[100005];
vector <int> doges[100005];
int dist[50005][300];
priority_queue<pair<int,pair<int,int> > > pq;
int main() {
scanf("%d %d", &n, &m);
for (int i = 0; i < m; i++) {
scanf("%d %d", &pos[i], &pw[i]);
doges[pos[i]].push_back(i);
}
for (int i = 0; i <= 50000; i++) {
for (int j = 0; j < 300; j++) {
dist[i][j] = 1000000000;
}
}
pq.push(make_pair(0, make_pair(pos[0], 0)));
dist[pos[0]][0] = 0;
int limit = (int) sqrt(n);
int res = 1000000000;
while (!pq.empty()) {
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... |