Submission #488918

#	Time	Username	Problem	Language	Result	Execution time	Memory
488918		cfalas	Road Closures (APIO21_roads)	C++14	7 / 100	49 ms	6860 KiB

roads

#include "roads.h"
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define INF 10000000
#define MOD 1000000007
#define MID ((l+r)/2)
#define HASHMOD 2305843009213693951
#define ll long long
#define ull unsigned long long
#define F first
#define S second
typedef pair<ll, ll> ii;
typedef pair<ii, int> iii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef map<int, int> mii;

#define EPS 1e-6
#define FOR(i,n) for(int i=0;i<((int)(n));i++)
#define FORi(i,a,b) for(int i=((int)(a));i<((int)(b));i++)
#define FOA(v, a) for(auto v : a)

int t, n;
vi a, b;

std::vector<long long> minimum_closure_costs(int N, std::vector<int> U,
                                             std::vector<int> V,
                                             std::vector<int> W) {
	n = N;
	a.assign(n, 0);
	a[0] = 0;
	FOR(i,n-1) a[0]+=W[i];
	vi dp(n, 0);
	dp[1] = W[0];
	FORi(i,2, n){
		dp[i] = max(dp[i-2] + W[i-1], dp[i-1]);
	}
	a[1] = a[0] - dp[n-1];
	return a;
}

• 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