Submission #488774

#	Time	Username	Problem	Language	Result	Execution time	Memory
488774		Theo830	Road Closures (APIO21_roads)	C++17	7 / 100	39 ms	6728 KiB

roads

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9+7;
const ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ii,ll>
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///APIO 2021 vc
#include "roads.h"
std::vector<long long> minimum_closure_costs(int N, std::vector<int> U,std::vector<int> V,std::vector<int> W){
    vll ans;
    ll sum = 0;
    for(auto x:W){
        sum += x;
    }
    ll n = N;
    ans.pb(sum);
    ll dp[n] = {0};
    dp[1] = W[0];
    f(i,1,n-1){
        dp[i+1] = max(dp[i-1] + W[i],dp[i]);
    }
    ans.pb(sum - dp[n-1]);
    f(i,2,n){
        ans.pb(0);
    }
    return ans;
}

• 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