Submission #755992

#	Time	Username	Problem	Language	Result	Execution time	Memory
755992		HaciyevAlik	Cyberland (APIO23_cyberland)	C++17	16 / 100	845 ms	8736 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];
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);
    }
}
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) {
        if(!m) return -1;
        else return g[0][0].ss;
    } else if(n==3) {
        if(g[0].size()==2) {
            double ans1,ans2;
            if(g[0][0].ff==h) {
                ans1=g[0][0].ss;
                ans2=g[0][1].ss;
                int cur=g[0][1].ff;
                if(arr[cur]==2) {
                    ans2/=2;
                } else if(!arr[cur]) ans2=0;
                if(g[cur].size()==1) {
                    return -1;
                } else {
                    if(g[cur][0].ff==h) {
                        ans2+=g[cur][0].ss;
                    } else {
                        ans2+=g[cur][1].ss;
                    }
                }
                return min(ans1,ans2);
            } else {
                ans1=g[0][1].ss;
                ans2=g[0][0].ss;
                int cur=g[0][0].ff;
                if(arr[cur]==2) {
                    ans2/=2;
                } else if(!arr[cur]) ans2=0;
                if(g[cur].size()==1) {
                    return -1;
                } else {
                    if(g[cur][0].ff==h) {
                        ans2+=g[cur][0].ss;
                    } else {
                        ans2+=g[cur][1].ss;
                    }
                }
                return min(ans1,ans2);
            }

        } else if(g[0].size()==1) {
            if(g[0][0].ff==h) {
                return g[0][0].ss;
            }
            double res=g[0][0].ss*1.0;
            if(arr[g[0][0].ff]==2) {
                res/=2;
            } else if(!arr[g[0][0].ff]) res=0;
            if(g[g[0][0].ff].size()==2) {
                return res+g[h][0].ss;
            } else {
                return -1;
            }
        } else {return -1;}
    }
    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];
    }
}

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