Submission #880336

#	Time	Username	Problem	Language	Result	Execution time	Memory
880336		Mardonbekhazratov	사이버랜드 (APIO23_cyberland)	C++17	15 / 100	23 ms	2396 KiB

cyberland

#include "cyberland.h"
#include<bits/stdc++.h>
#include <vector>
using namespace std;
#define ll long long
const ll INF=1e18;

double solve(int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) {
    bool subtask=true;
    for(int i=0;i<N;i++) if(arr[i]!=1) subtask=false;
    if(subtask){
        vector<vector<pair<int,int>>>v(N);
        for(int i=0;i<M;i++){
            v[x[i]].push_back({y[i],c[i]});
            v[y[i]].push_back({x[i],c[i]});
        }
        vector<bool>vis(N,0);
        priority_queue<pair<ll,int>>q;
        vector<ll>dp(N,INF);
        dp[0]=0;
        q.push({0,0});
        while(!q.empty()){
            int x=q.top().second;
            q.pop();
            if(vis[x]) continue;
            vis[x]=true;
            for(auto [z,y]:v[x]){
                if(dp[x]+y<dp[z]){
                    dp[z]=dp[x]+y;
                    q.push({-dp[z],z});
                }
            }
        }
        if(dp[H]==INF) return -1.0;
        return 1.0*dp[H];
    }
    else{
        int l=-1,r=0;
        for(int i=1;i<H;i++){
            if(arr[i]==2){
                l=i;
            }
            if(arr[i]==0){
                r=i;
            }
        }
        double ans=0.0;
        for(int i=r;i<H;i++){
            ans+=c[i];
            if(i==l){
                int j=0;
                while(j<K&&ans>2*c[i]){
                    ans=(ans+2*c[i])/2;
                    j++;
                }
            }
        }
        return ans;
    }
}

• 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