Submission #1061122

#	Time	Username	Problem	Language	Result	Execution time	Memory
1061122		KasymK	Cyberland (APIO23_cyberland)	C++17	13 / 100	1154 ms	2097152 KiB

cyberland

#include "bits/stdc++.h"
using namespace std;
#define ff first
#define ss second   
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define wr puts("----------------")
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N = 1e5+5;
const ll INF = 1e15; // 1e5*1e9=1e14
vector<pii> adj[N];
double answer = INF;

void dfs(int x, int pr, double sm, int h, int k, vector<int> &arr){
    if(x == h){
        umin(answer, sm);
        return; 
    }
    for(auto [i, val] : adj[x])
        if(i != pr and i){
            double taze = sm+val;
            if(!arr[i])
                taze = 0;
            else if(arr[i] == 2 and k)
                taze /= 2;
            dfs(i, x, taze, h, k, arr);
        }
}

double solve(int n, int m, int k, int h, vector<int> u, vector<int> v, vector<int> w, vector<int> arr){
    for(int i = 0; i < m; ++i){
        adj[u[i]].pb({v[i], w[i]});
        adj[v[i]].pb({u[i], w[i]});
    }
    answer = INF;
    dfs(0, -1, 0, h, k, arr);
    if(answer == INF)
        answer = -1;
    for(int i = 0; i <= n; ++i)
        adj[i].clear();
    return answer;
}

// int main(){
//     double kk = solve(3, 3, 2, 2, {0, 1, 2}, {1, 2, 0}, {16, 5, 10}, {1, 0, 1});
//     printf("%f\n", kk);
//     return 0;
// }

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