제출 #755998

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

cyberland

#include "cyberland.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
const int mx=1e5+5;
int n,m,h,k,used[mx],used2[15];
long dis[mx];
vector<pair<int,int>> g[mx];
void dfs(int u) {
    used[u]=1;
    for(int i=0;i<int(g[u].size());++i) {
        int v=g[u][i].ff;
        if(!used[v]&&v!=h) dfs(v);
    }
}
void dfs2(int u){
    used2[u]=1;
    for(int i=0;i<int(g[u].size());++i){
        int v=g[u][i].ff;
        if(!used2[v]) dfs2(v);
    }
}
double solve(int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) {
    n=N,m=M,h=H,k=K;
    for(int i=0;i<mx;++i) g[i].clear();
    memset(used,0,sizeof(used));
    for(int i=0;i<m;++i) {
        g[x[i]].pb({y[i],c[i]});
        g[y[i]].pb({x[i],c[i]});
    }
    if(n==2||n==3) {
        dfs2(0);
        if(!used2[h]) return -1;
        double res1,res2;
        if(g[0].size()==1){
            double res;
            if(g[0][0].ff==h) {
                return g[0][0].ss;
            } else {
                res=g[0][0].ss;
                if(arr[g[0][0].ff]==2) {
                    res/=2;
                } else if(!arr[g[0][0].ff]) {
                    res=0;
                }
                res+=g[h][0].ss;
            }
            return res;
        } else {
            double res;
            if(g[0][0].ff==h) {
                res=g[0][1].ss;
                if(arr[g[0][1].ff]==2) {
                    res/=2;
                } else if(!arr[g[0][1].ff]) {
                    res=0;
                }
                if(g[h][0].ff==0) {
                    res+=g[h][1].ss;
                } else {
                    res+=g[h][0].ss;
                }
                return res;
            } else {
                res=g[0][0].ss;
                if(arr[g[0][0].ff]==2) {
                    res/=2;
                } else if(!arr[g[0][0].ff]) {
                    res=0;
                }
                if(g[h][0].ff==0) {
                    res+=g[h][1].ss;
                } else {
                    res+=g[h][0].ss;
                }
                return res;
            }
        }
    }
    set<int> s;
    dfs(0);
    for(int i=0;i<n;++i) {
        if(used[i]&&!arr[i]) s.insert(i);
    }
    memset(used,0,sizeof(used));
    priority_queue<pair<int,int>> pq;
    for(int i=0;i<n;++i) dis[i]=1e10;
    for(auto i:s) {
        pq.push({0,i});
        dis[i]=0;
    }
    pq.push({0,0});
    dis[0]=0;
    while(!pq.empty()) {
        int u=pq.top().ss; pq.pop();
        if(used[u]) continue;
        used[u]=1;
        for(int i=0;i<int(g[u].size());++i) {
            int v=g[u][i].ff,w=g[u][i].ss;
            if(dis[u]+w<dis[v]) {
                dis[v]=dis[u]+w;
                pq.push({-dis[v],v});
            }
        }
    }
    if(!used[h]) {
        return -1;
    } else {
        return dis[h];
    }
}

컴파일 시 표준 에러 (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:36:16: warning: unused variable 'res1' [-Wunused-variable]
   36 |         double res1,res2;
      |                ^~~~
cyberland.cpp:36:21: warning: unused variable 'res2' [-Wunused-variable]
   36 |         double res1,res2;
      |                     ^~~~

• 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