# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
27346 | TAMREF | Jakarta Skyscrapers (APIO15_skyscraper) | C++11 | 1000 ms | 4524 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 va first
#define vb second
#define mp make_pair
#define all(x) x.begin(),x.end()
using namespace std;
typedef pair<int,int> pii;
const int mx=30005;
int dist[mx];
pii doge[mx];
vector<int> C[mx];
int N,M;
void input(){
scanf("%d%d",&N,&M);
for(int i=0;i<M;i++){
scanf("%d%d",&doge[i].va,&doge[i].vb);
C[doge[i].va].push_back(doge[i].vb);
}
for(int i=0;i<N;i++)
sort(all(C[i]),greater<int>());
fill(dist,dist+N,(int)1e9);
}
void dijk(int s){
priority_queue<pii,vector<pii>,greater<pii>> q;
q.push(mp(dist[s]=0,s));
pii t;
int vis[mx];
while(!q.empty()){
t=q.top(); q.pop();
if(t.va>dist[t.vb]) continue;
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... |