Submission #1125981

#	Time	Username	Problem	Language	Result	Execution time	Memory
1125981		czauderna	Road Closures (APIO21_roads)	C++20	7 / 100	43 ms	10952 KiB

roads

#include "roads.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
typedef long long ll;
const int N = 1e5+3;
vector<int> grf[N];
ll Br[N], Nb[N];

std::vector<long long> minimum_closure_costs(int N, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
    for(int i=0; i<N-1; i++) grf[U[i]].pb(V[i]), grf[V[i]].pb(U[i]);
    ll sm=0;
    for(int i=N-2; i>=0; i--){
        Br[i]=Nb[i+1];
        Nb[i]=min(Br[i+1], Nb[i+1])+W[i];
        sm+=W[i];
    }
    vector<ll> out; out.pb(sm); out.pb(min(Nb[0], Br[0]));
    for(int i=2; i<N; i++) out.pb(0);
    return out;
}

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