제출 #1193412

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1193412		yuichiro17	Cyberland (APIO23_cyberland)	C++20	8 / 100	1049 ms	2162688 KiB

cyberland

#include "cyberland.h"
#include <bits/stdc++.h>
using namespace std;
using ld = long double;

const ld inf = numeric_limits<ld>::max();

double solve(int N, int M, int K, int H, std::vector<int> x, std::vector<int> y, std::vector<int> c, std::vector<int> arr) {
    vector<vector<pair<int,int>>> adj(N);
    for(int i=0;i<M;i++){
        adj[x[i]].push_back({y[i],c[i]});
        adj[y[i]].push_back({x[i],c[i]});
    }
    vector<vector<ld>> v(N,vector<ld>(K,inf));
    v[0][0]=0;
    queue<pair<int,int>> q;
    q.push({0,0});
    while(!q.empty()){
        pair<int,int> current = q.front();
        q.pop();
        for(pair<int,int> p:adj[current.first]){
            if(arr[p.first]==0&&v[p.first][current.second]!=0){
                v[p.first][current.second]=0;
                q.push({p.first,current.second});
            }else if(v[current.first][current.second]+p.second<v[p.first][current.second]){
                v[p.first][current.second]=v[current.first][current.second]+p.second;
                q.push({p.first,current.second});
            }else if(current.second!=K-1&&arr[p.first]==2){
                if(v[current.first][current.second]+p.second<2*v[p.first][current.second+1]){
                    v[p.first][current.second+1]=(ld)(v[current.first][current.second]+p.second)/2;
                    q.push({p.first,current.second+1});
                }
            }
        }
    }
    ld ans=inf;
    for(int i=0;i<K;i++){
        ans = min(ans,v[H][i]);
    }
    return ans;
}

• Subtask 1: 0 / 5
• Subtask 2: 8 / 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