Submission #973578

#	Time	Username	Problem	Language	Result	Execution time	Memory
973578		SuPythony	Cyberland (APIO23_cyberland)	C++17	0 / 100	1648 ms	2097152 KiB

cyberland

#include "cyberland.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
vector<vector<pair<int,double>>> al;
 
double solve(int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> a) {
    al.assign(N,vector<pair<int,double>>());
    vector<vector<double>> cost(N,vector<double>(N));
    for (int i=0; i<M; i++) {
        al[x[i]].push_back({y[i],c[i]});
        al[y[i]].push_back({x[i],c[i]});
        cost[x[i]][y[i]]=c[i];
        cost[y[i]][x[i]]=c[i];
    }
    vector<vector<double>> dp(N,vector<double>(K+1,1e18));
    for (int i=0; i<=K; i++) dp[0][i]=0;
    for (int i=1; i<=H; i++) {
        for (int j=0; j<=K; j++) {
            if (a[i]==1||j==0) dp[i][j]=dp[i-1][j]+cost[i][i-1];
            else if (a[i]==0) dp[i][j]=0;
            else {
                dp[i][j]=min((dp[i-1][j-1]+cost[i][i-1])/2,dp[i-1][j]+cost[i][i-1]);
            }
        }
    }
    double ans=1e18;
    for (int i=0; i<=K; i++) {
        ans=min(ans,dp[H][i]);
    }
    if (ans==1e18) return -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