Submission #1056197

#	Time	Username	Problem	Language	Result	Execution time	Memory
1056197		KasymK	Road Closures (APIO21_roads)	C++17	0 / 100	19 ms	4052 KiB

roads

#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;
int dp[N];

vector<ll> minimum_closure_costs(int n, vector<int> u, vector<int> v, vector<int> w){
    vector<ll> A;
    ll sm = accumulate(all(w), 0ll);
    A.pb(sm);
    dp[0] = w[0];
    dp[1] = max(w[1], w[0]);
    for(int i = 1; i < n-1; ++i)
        umax(dp[i], max(dp[i-1], dp[i-2]+w[i]));
    ll dxdll = sm-dp[n-2];
    A.pb(dxdll);
    for(int i = 2; i < n; ++i)
        A.pb(0);
    return A;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 7
• Subtask 3: 0 / 14
• Subtask 4: 0 / 10
• Subtask 5: 0 / 17
• Subtask 6: 0 / 25
• Subtask 7: 0 / 22