제출 #984608

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
984608		ag_1204	사이버랜드 (APIO23_cyberland)	C++17	0 / 100	3184 ms	2097152 KiB

cyberland

#include<bits/stdc++.h>
using namespace std;

vector<pair<int,int>> graph[100001];
vector<vector<int>> edges;

void add_edge(int u,int v,int w) {
    graph[u].push_back({v,w});
    graph[v].push_back({u,w});
    edges.push_back({u,v,w});
}

vector<int> dijsktras(int src, int N) {
    vector<int> dis(N, INT_MAX);
    vector<bool> vis(N, false);
    priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> pq;
    pq.push({0,src});
    dis[src] = 0;
    while (!pq.empty()) {
        auto cur = pq.top();
        pq.pop();
        int node = cur.second;
        int weight = cur.first;
        if (vis[node])
            continue;
        vis[node] = true;
        for (auto child : graph[node]) {
            if (dis[child.first] > child.second + weight) {
                dis[child.first] = weight + child.second;
                pq.push({dis[child.first], child.first});
            }
        }
    }
    return dis;
}

double solve(int N, int M, int K, int H, std::vector<int> x, std::vector<int> y, std::vector<int> c, std::vector<int> arr) {
    int t; cin>>t;
    while(t--) {
        int N,M,K; cin>>N>>M>>K;
        int H; cin>>H;
        vector<int> arr(N),x(M),y(M),c(M);
        for (int i=0;i<N;i++) {
            cin>>arr[i];
        }
        for (int i=0;i<M;i++) {
            cin>>x[i];
        }
        for (int i=0;i<M;i++) {
            cin>>y[i];
        }
        for (int i=0;i<M;i++) {
            cin>>c[i];
            add_edge(x[i],y[i],c[i]);
        }
        vector<int> disA = dijsktras(0, N);
        double ans = disA[H];
        return ans;
        for (int i=0;i<100001;i++) {
            graph[i].clear();
        }
    }
}

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

cyberland.cpp: In function 'double solve(int, int, int, int, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
cyberland.cpp:63:1: warning: control reaches end of non-void function [-Wreturn-type]
   63 | }
      | ^

• Subtask 1: 0 / 5
• Subtask 2: 0 / 8
• Subtask 3: 0 / 13
• Subtask 4: 0 / 19
• Subtask 5: 0 / 7
• Subtask 6: 0 / 16
• Subtask 7: 0 / 29
• Subtask 8: 0 / 3