# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
870060 | amirhoseinfar1385 | Jakarta Skyscrapers (APIO15_skyscraper) | C++17 | 45 ms | 13276 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>
const int MAXN=30007;
using namespace std;
vector<int> g[MAXN],w[MAXN];
set<int> v[MAXN];
bool vi[MAXN];
int dist[MAXN],en;
void dijkstra(int s)
{
priority_queue<pair<int,int> > pq;
pq.push(make_pair(0,s));
while(!pq.empty())
{
int u=pq.top().second,d=-pq.top().first;
pq.pop();
if(vi[u]) continue;
dist[u]=d;
vi[u]=true;
if(u==en) return;
for(int i=0;i<g[u].size();i++) if(!vi[g[u][i]]) pq.push(make_pair(-d-w[u][i],g[u][i]));
}
}
int main()
{
int n,m,st,t1,t2;
cin>>n>>m;
cin>>st>>t1>>en>>t2;
v[st].insert(-t1);
v[en].insert(-t2);
for(int i=0;i<m-2;i++)
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... |