Submission #1772190


Source Code Expand

#include<bits/stdc++.h>
#define F first
#define S second
#define INF 1<<28
using namespace std;
typedef pair< int,int > point;
vector< point > graph[301];
vector< int > vcos(301);
int n,m;
int dijkstra(int s,vector< int >& v){
    priority_queue< point,vector< point >,greater< point > > pq;
    pq.push(point(0,s));
    fill(v.begin(),v.end(),INF);
    v[s]=0;
    while(!pq.empty()){
        point p=pq.top();pq.pop();
        int now=p.S;
        int cost=p.F;
        for(int i=0;i<graph[now].size();++i){
            int next=graph[now][i].S;
            int ncos=graph[now][i].F+cost;
            if(ncos<v[next]){
                v[next]=ncos;
                pq.push(point(ncos,next));
            }
        }
    }
    return *max_element(++v.begin(),v.end());
}
int main(){
    scanf("%d%d",&n,&m);
    vector< int > v(n+1);
    int a,b,c;
    for(int i=0;i<m;++i){
        scanf("%d%d%d",&a,&b,&c);
        graph[a].push_back(point(c,b));
        graph[b].push_back(point(c,a));
    }
    int minpos=INF;
    for(int i=1;i<=n;++i){
        fill(v.begin(),v.end(),INF);
        vcos[i]=dijkstra(i,v);
        minpos=min(minpos,vcos[i]);
    }
    printf("%d\n",minpos);
    return 0;
}

Submission Info

Submission Time
Task D - バスと避けられない運命
User waddaa1741
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1245 Byte
Status AC
Exec Time 266 ms
Memory 1536 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:31:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n,&m);
                        ^
./Main.cpp:35:33: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d",&a,&b,&c);
                                 ^

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 39
Set Name Test Cases
All sample_01.txt, sample_02.txt, sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
test_01.txt AC 1 ms 256 KB
test_02.txt AC 7 ms 256 KB
test_03.txt AC 266 ms 1536 KB
test_04.txt AC 15 ms 256 KB
test_05.txt AC 79 ms 640 KB
test_06.txt AC 8 ms 384 KB
test_07.txt AC 195 ms 1408 KB
test_08.txt AC 2 ms 256 KB
test_09.txt AC 54 ms 640 KB
test_10.txt AC 7 ms 384 KB
test_11.txt AC 8 ms 384 KB
test_12.txt AC 34 ms 384 KB
test_13.txt AC 9 ms 384 KB
test_14.txt AC 13 ms 384 KB
test_15.txt AC 177 ms 1408 KB
test_16.txt AC 15 ms 384 KB
test_17.txt AC 61 ms 640 KB
test_18.txt AC 33 ms 384 KB
test_19.txt AC 16 ms 384 KB
test_20.txt AC 13 ms 384 KB
test_21.txt AC 1 ms 256 KB
test_22.txt AC 19 ms 384 KB
test_23.txt AC 2 ms 256 KB
test_24.txt AC 4 ms 256 KB
test_25.txt AC 4 ms 256 KB
test_26.txt AC 2 ms 256 KB
test_27.txt AC 3 ms 256 KB
test_28.txt AC 4 ms 256 KB
test_29.txt AC 4 ms 256 KB
test_30.txt AC 2 ms 256 KB
test_31.txt AC 1 ms 256 KB
test_32.txt AC 4 ms 256 KB
test_33.txt AC 4 ms 256 KB
test_34.txt AC 1 ms 256 KB
test_35.txt AC 2 ms 256 KB
test_36.txt AC 4 ms 256 KB