# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
108068 | autumn_eel | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 19 ms | 19376 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 rep(i,n)for(int i=0;i<(n);i++)
#define INF 0x3f3f3f3f
using namespace std;
typedef pair<int,int>P;
typedef long long ll;
int b[50000],t[50000];
int d[2200][2200];
vector<int>v[2200];
int main(){
int n,m;cin>>n>>m;
rep(i,m){
scanf("%d%d",&b[i],&t[i]);
v[b[i]].push_back(t[i]);
}
memset(d,0x3f,sizeof(d));
d[0][0]=0;
deque<P>que;
que.push_back(P(0,0));
while(!que.empty()){
P p=que.front();que.pop_front();
if(p.second==0){
for(int i:v[p.first]){
if(d[p.first][i]>d[p.first][p.second]){
d[p.first][i]=d[p.first][p.second];
que.push_front(P(p.first,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... |