제출 #954113

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
954113		Otalp	사이버랜드 (APIO23_cyberland)	C++17	44 / 100	391 ms	107892 KiB

cyberland

#include "cyberland.h"
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define pb push_back
#define ff first
#define ss second


vector<pair<int, int>> q[200100];
double dp[200100][105];
int us[200100][105];
int pos[200100];
int H;

void dfs(int v){
    pos[v] = 1;
    if(v == H) return;
    for(int i=0; i<q[v].size(); i++){
        int to = q[v][i].ff;
        if(pos[to]) continue;
        dfs(to);
    }
}

double st[200];


double solve(int n, int m, int K, int h, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) {
    H = h;
    int k = min(K, 50);
    for(int i=0; i<n; i++){
        q[i].clear();
        for(int j=0; j<=k; j++){
            dp[i][j] = us[i][j] = 0;
        }
        pos[i] = 0;
    }
    for(int i=0; i<m; i++){
        q[x[i]].pb({y[i], c[i]});
        q[y[i]].pb({x[i], c[i]});
    }
    st[0]= 1;
    for(int i=1; i<=k + 2; i++){
        st[i] = st[i - 1] / 2;
    }

    dfs(0);

    if(pos[h] == 0) return -1; 

    set<pair<double, int>> s;
    s.insert({0, h});
    vector<int> dd;
    while(s.size()){
        auto it = s.begin();
        if(us[it -> ss][0]){
            s.erase(it);
            continue;
        }
        int v = it -> ss;
        dp[v][0] = it -> ff;
        us[v][0] = 1;
        s.erase(it);
        for(int i = 0; i < q[v].size(); i++){
            int to = q[v][i].ff;
            int x = q[v][i].ss;
            if(!us[to][0] and to != h){
                s.insert({dp[v][0] + x, to});
            }
            if(arr[to] == 2 and to != h and 1 <= k){
                dd.pb(to);
            }
        }
    }

    for(int c=1; c<=k; c++){
        for(int i=0; i<dd.size(); i++){
            s.insert({dp[dd[i]][c-1], dd[i]});
        }
        dd.clear();
        while(s.size()){
            auto it = s.begin();
            if(us[it -> ss][c]){
                s.erase(it);
                continue;
            }
            int v = it -> ss;
            dp[v][c] = it -> ff;
            us[v][c] = 1;
            s.erase(it);
            for(int i=0; i<q[v].size(); i++){
                int to = q[v][i].ff;
                int x = q[v][i].ss;
                if(!us[to][c] and to != h){
                    s.insert({dp[v][c] + x * st[c], to});
                }
                if(arr[to] == 2 and c + 1 <= k and to != h){
                    dd.pb(to);
                }
            }
        }
    }

    double mn=1e18;
    if(k < K){
        for(int i=0; i<n; i++){
            if(us[i][k] and pos[i]) mn = min(mn, dp[i][k]);
        }
    }
    arr[0] = 0;
    for(int i=0; i<n; i++){
        if(pos[i] and arr[i] == 0){
            for(int j=0; j<=k; j++){
                if(us[i][j]) mn = min(mn, dp[i][j]);
            }
        }
    }
    if(mn == 1e18) return -1;
    return mn;
}

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

cyberland.cpp: In function 'void dfs(int)':
cyberland.cpp:19:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |     for(int i=0; i<q[v].size(); i++){
      |                  ~^~~~~~~~~~~~
cyberland.cpp: In function 'double solve(int, int, int, int, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
cyberland.cpp:65:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |         for(int i = 0; i < q[v].size(); i++){
      |                        ~~^~~~~~~~~~~~~
cyberland.cpp:78:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |         for(int i=0; i<dd.size(); i++){
      |                      ~^~~~~~~~~~
cyberland.cpp:92:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   92 |             for(int i=0; i<q[v].size(); i++){
      |                          ~^~~~~~~~~~~~

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