제출 #919556

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
919556		dosts	사이버랜드 (APIO23_cyberland)	C++17	68 / 100	1446 ms	67296 KiB

cyberland

#pragma GCC optimize("O3,unroll-loops")
#include "cyberland.h"
#include <bits/stdc++.h>
using namespace std;
 
vector<pair<int,int>> edges[100000];
 
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) {
    K = min(K,68);
    for (int i=0;i<N;i++) edges[i].clear();
    for (int i=0;i<M;i++) {
        edges[x[i]].push_back({y[i],c[i]});
        edges[y[i]].push_back({x[i],c[i]});
    }
    int ARR[arr.size()];
    for (int i=0;i<arr.size();i++) ARR[i] = arr[i];
    double dp[N][K+1];
    for (int i=0;i<N;i++) {
        for (int j=0;j<=K;j++) dp[i][j] = 2e18;
    }
    dp[0][0] = 0;
    for (int used=0;used<=K;used++) {
        priority_queue<pair<double,int>,vector<pair<double,int>>,greater<pair<double,int>>> pq;
        if (used) for (int i=0;i<N;i++) dp[i][used] = min(dp[i][used],dp[i][used-1]);
        for (int i=0;i<N;i++) if (dp[i][used] != 2e18) pq.push({dp[i][used],i});
        while (!pq.empty()) {
            pair<double,int> f = pq.top();
            pq.pop();
            double cost = f.first;
            int city = f.second;
            if (dp[city][used] < cost) continue;
            if (city == H) continue;
            for (auto it : edges[city]) {
                int dest = it.first;
                int go = it.second; 
                if (!ARR[dest]) {
                    if (dp[dest][used]>0) {
                        pq.push({0,dest});
                        dp[dest][used] = 0;
                    }
                }
                else {
                    if (dp[dest][used] > cost+go) {
                        pq.push({cost+go,dest}); 
                        dp[dest][used] = cost+go;
                    }               
                    if (ARR[dest] == 2) {
                        if (used!=K && dp[dest][used+1] > (cost+go)/2) {
                            pq.push({(cost+go)/2,dest});
                            dp[dest][used+1] = (cost+go)/2;
                        }
                    }
                }
            }
        }
    }
    return dp[H][K]==2e18?-1:dp[H][K];
}

컴파일 시 표준 에러 (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:16:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |     for (int i=0;i<arr.size();i++) ARR[i] = arr[i];
      |                  ~^~~~~~~~~~~

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