# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
155397 | dantoh000 | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 217 ms | 26360 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;
typedef pair<int,int> ii;
int dist[30005];
vector<int> a[30005];
int h[30005][205];
int n,m;
int k = 200;
int s;
int e;
int main(){
scanf("%d%d",&n,&m);
for (int i = 0; i < m; i++){
int b,p;
scanf("%d%d",&b,&p);
if (i == 0) s = b;
if (i == 1) e = b;
if (p > k || !h[b][p]){
a[b].push_back(p);
}
if (p <= k) h[b][p] = 1;
}
priority_queue<ii,vector<ii>,greater<ii> > pq;
memset(dist,-1,sizeof(dist));
dist[s] = 0;
pq.push(ii(0,s));
while (pq.size()){
ii cur = pq.top(); pq.pop();
int d = cur.first, u = cur.second;
if (u == e) break;
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... |