# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
660799 | velislavgarkov | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 315 ms | 262144 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 <iostream>
#include <vector>
#include <queue>
using namespace std;
const int MAXN=3e4+10;
vector <pair <int,int> > v[MAXN];
priority_queue <pair <int,int> > q;
int ans[MAXN];
void dejkstra(int start) {
ans[start]=0;
q.push({0,start});
while (!q.empty()) {
int x=q.top().second;
if (-q.top().first!=ans[x]) {
q.pop();
continue;
}
q.pop();
for (auto i:v[x]) {
if (ans[i.first]==-1 || ans[i.first]>ans[x]+i.second) {
ans[i.first]=ans[x]+i.second;
q.push({-ans[i.first],i.first});
}
}
}
}
int main () {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
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... |