제출 #962592

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

cyberland

/**
 
                                    * بسم الله الرحمن الرحيم *
 
                ﴾ رَبِّ اشْرَحْ لِي صَدْرِي * وَيَسِّرْ لِي أَمْرِي * وَاحْلُلْ عُقْدَةً مِّن لِّسَانِي * يَفْقَهُوا قَوْلِي ﴿
 
*/
 
/// author : "ASGA_RedSea"
 
 
#include <bits/stdc++.h>
 
using namespace std;
using ll = long long;
using ld = long double;

#undef LLONG_MAX
#define LLONG_MAX 1e18
 
double solve(int n,int m,int k,int H,vector <int> x,vector <int> y,vector <int> t,vector <int> aa);
 
vector <vector <pair <int,int>>> a;
vector <double> v;
vector <int> s;
 
int h;
 
double calc(int i,double time,int k,int last){
    if(i == h)return time;
 
    double ret = LLONG_MAX;
 
    for(const auto& [j,t] : a[i]){
        if(j == last)continue;
        if(s[j] == 0){
            if(v[j] - 0.000000000000 <= 1e-7)continue;
            v[j] = 0.000000000000;
            ret = min(ret,calc(j,0.000000000000,k,i));
        }
        else if(s[j] == 1){
            if(v[j] - (time + t) <= 1e-7)continue;
            v[j] = time + t;
            ret = min(ret,calc(j,time + t,k,i));
        }
        else{
            if(v[j] - (time + t) <= 1e-7)continue;
            if(k > 0)ret = min(ret,calc(j,(time + t) / 2.0,k - 1,i));
            ret = min(ret,calc(j,time,k,i));
        }
    }
 
    return (ret == LLONG_MAX ? -1 : ret);
}
 
double solve(int n,int m,int k,int H,vector <int> x,vector <int> y,vector <int> t,vector <int> aa){
    a.resize(n + 5);h = H;s = aa;
    for(int i = 0;i < m;i++){
        a[x[i]].push_back({y[i],t[i]});
        a[y[i]].push_back({x[i],t[i]});
    }
 
    v = vector <double> (n + 5,LLONG_MAX);
    double ans = calc(0,0.000000000000,k,-1);
 
    return ans;
}

• 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