# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
20988 | jjwdi0 | Jakarta Skyscrapers (APIO15_skyscraper) | C++11 | 166 ms | 9248 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 all(x) (x).begin(),(x).end()
using namespace std;
using pr = pair<int, int>;
int N, M, dist[30005];
int s, t;
vector<int> v[30005];
priority_queue<pr, vector<pr>, greater<pr>> pq;
bool chk(int to, int cost, int j, int i) {
if(dist[to] > cost + j) {
dist[to] = cost + j;
pq.push(pr(dist[to], to));
}
auto it = lower_bound(all(v[to]), i);
if(it != v[to].end() && *it == i) return false;
return true;
}
int main() {
scanf("%d %d", &N, &M);
for(int i=0, x, y; i<M; i++) {
scanf("%d %d", &x, &y);
v[x].push_back(y);
if(i == 0) s = x;
if(i == 1) t = x;
}
for(int i=0; i<N; i++) sort(all(v[i])), v[i].resize(unique(all(v[i])) - v[i].begin());
for(int i=0; i<N; i++) dist[i] = 2e9;
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... |