제출 #984822

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

cyberland

                              ///~~~LOTA~~~///
#include "cyberland.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define append push_back
#define add insert
#define nl '\n'
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define all(x) (x).begin(),(x).end()
#define L0TA ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define terminator main
#define N 100000
#define K 31
int t;
int ab[N];
int vis[N];
double dp[N];
vector<pair<int,double>> a[N];
void dfs(int v){
    if(vis[v] || v==t) 
        return;
    vis[v]=1;
    if(ab[v]==0) 
        dp[v]=0;
    for(auto& i:a[v])
        dfs(i.ff);
}
double solve(int n,int m,int k,int h,vector<int> x,vector<int> y,vector<int> c,vector<int> arr){
    t=h;
    int p;
    double q,r;
    for(int i=0;i<n;i++){
        ab[i]=arr[i];
        dp[i]=-1e17;
    }
    for(int i=0;i<m;i++){
        a[x[i]].append({y[i],c[i]});
        a[y[i]].append({x[i],c[i]});
    }
    dfs(0);
    r=1e17;
    priority_queue<pair<double,int>> Q[K];
    for(int j=dp[0]=0;j<=k;j++){
        for(int i=0;i<n;i++){
            Q[j].push({dp[i],i});
            vis[i]=0;
        }
        while(!Q[j].empty()){
            p=Q[j].top().ss;
            q=Q[j].top().ff;
            Q[j].pop();
            if(!vis[p]){
                vis[p]=1;
                if(p==h){
                    r=min(r,-q);
                    continue;
                }
                dp[p]=q;
                for(auto& i:a[p]){
                    if(arr[i.ff]==2 && j<k)
                        Q[j+1].push({(q-i.ss)/2,i.ff});
                    if(!vis[i.ff])
                        Q[j].push({q-i.ss,i.ff});
                }
            }
        }
    }
    if(r==1e17) r=-1;
    return r;
}

• 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