제출 #756831

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
756831		Valters07	사이버랜드 (APIO23_cyberland)	C++17	15 / 100	3061 ms	54812 KiB

cyberland

#include <bits/stdc++.h>
#include "cyberland.h"
#define ll long long
#define pb push_back
#define fi first
#define se second
using namespace std;
const int N = 1e5+5;
const int K = 30+2;
vector<pair<int,int> > g[N];
long double dist[N][K];
int dsu[N];
bool vis[N][K];
int root(int n)
{
    if(dsu[n]==n)
        return n;
    return dsu[n]=root(dsu[n]);
}
double solve(int n, int m, int k, int h, vector<int> x,
             vector<int> y, vector<int> c, vector<int> arr)
{
    for(int i = 0;i<n;i++)
        dsu[i]=i;
    for(int i = 0;i<m;i++)
        g[x[i]].pb({y[i],c[i]}),
        g[y[i]].pb({x[i],c[i]}),
        dsu[root(x[i])]=root(y[i]);
    for(int i = 0;i<n;i++)
        for(int j = 0;j<=k;j++)
            dist[i][j]=1e18,
            vis[i][j]=0;
    priority_queue<pair<long double,pair<int,int> >,vector<pair<long double,pair<int,int> > >,greater<pair<long double,pair<int,int> > > > q;
    dist[0][0]=0;
    q.push({0,{0,0}});
    for(int i = 0;i<n;i++)
        if(arr[i]==0&&root(i)==root(0))
            dist[i][0]=0,
            q.push({0,{i,0}});
    for(int i = 0;i<=k;i++)
        vis[h][i]=1;
    while(!q.empty())
    {
        int u = q.top().se.fi, dv = q.top().se.se;
        q.pop();
        if(vis[u][dv])
            continue;
        vis[u][dv]=1;
        for(auto v:g[u])
        {
            long double nwc = dist[u][dv]+v.se;
            if(dist[v.fi][dv]>nwc)
                dist[v.fi][dv]=nwc,
                q.push({nwc,{v.fi,dv}});
            if(arr[v.fi]==2&&dv<k)
            {
                nwc/=2;
                if(dist[v.fi][dv+1]>nwc)
                    dist[v.fi][dv+1]=nwc,
                    q.push({nwc,{v.fi,dv+1}});
            }
        }
    }
    long double best = 1e18;
    for(int i = 0;i<=k;i++)
        best=min(best,dist[h][i]);
    for(int i = 0;i<n;i++)
        g[i].clear();
    if(best==1e18)
        return -1;
    return best;
}

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