제출 #35686

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
35686		leejseo	주유소 (KOI16_gas)	C++14	42 / 100	136 ms	65536 KiB

gas

#include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>

using namespace std;

#define maxint 9E18
#define all(v) v.begin(), v.end()
#define MAXV 2500
#define MAXE 4000

int V, E;
int oil[MAXV];

struct Edge{
    int to;
    long long weight;
    Edge (int t_, long long w_) {to = t_; weight = w_;}
};

struct Node{
    int u;
    long long dist;
    Node (int u_, long long d_) {u = u_; dist = d_;}
    bool operator < (const Node &a) const {return dist > a.dist;}
};

vector<Edge> adj[MAXV];

vector<long long> dijkstra(int start, vector<Edge> *adj_list){
    priority_queue<Node> Q;
    vector <long long> dist(V, maxint);
    dist[start] = 0;
    Q.push(Node(start, 0));
    while (!Q.empty()){
        int u = Q.top().u;
        long long dist_u = Q.top().dist;
        Q.pop();
        if (dist[u] < dist_u) {
            continue;
        }
        for (int i=0; i<adj_list[u].size(); i++){
            int v = adj_list[u][i].to;
            long long dist_v = dist_u + adj_list[u][i].weight;
            if (dist_v < dist[v]){
                dist[v] = dist_v;
                Q.push(Node(v, dist_v));
            }
        }
    }
    return dist;
}

long long solve(){
    vector<Edge> cost_graph[V];
    for (int i=0; i<V; i++){
        vector<long long> dist = dijkstra(i, adj);
        for (int j=0; j<V; j++){
            if (j == i || dist[j] == maxint){
                continue;
            }
            long long cost = dist[j] * oil[i];
            cost_graph[i].push_back(Edge(j, cost));
        }
    }
    return dijkstra(0, cost_graph)[V-1];
}

int main(){
    scanf("%d %d", &V, &E);
    for (int i=0; i<V; i++){
        scanf("%d", &oil[i]);
    }
    for (int i=0; i<E; i++){
        int fr, to, weight;

        scanf("%d %d %d", &fr, &to, &weight);
        fr--; to--;
        adj[fr].push_back(Edge(to, weight));
        adj[to].push_back(Edge(fr, weight));
    }
    long long r = solve();
    printf("%lld\n", r);
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

gas.cpp: In function 'std::vector<long long int> dijkstra(int, std::vector<Edge>*)':
gas.cpp:43:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i=0; i<adj_list[u].size(); i++){
                        ^
gas.cpp: In function 'int main()':
gas.cpp:71:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &V, &E);
                           ^
gas.cpp:73:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &oil[i]);
                             ^
gas.cpp:78:45: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %d", &fr, &to, &weight);
                                             ^

• Subtask 1: 18 / 18
• Subtask 2: 0 / 15
• Subtask 3: 0 / 16
• Subtask 4: 24 / 24
• Subtask 5: 0 / 27