제출 #1223377

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1223377		Jer	Road Closures (APIO21_roads)	C++20	5 / 100	48 ms	5936 KiB

roads

#include "roads.h"
#include <bits/stdc++.h>
#include <vector>

using namespace std;

typedef long long ll;

const int MAXN = 2005;
int con[MAXN];
int n;
ll total = 0;

vector<tuple<int, int, int>> roads; // w, u, v

#define w(i) get<0>(i)
#define u(i) get<1>(i)
#define v(i) get<2>(i)

std::vector<long long> minimum_closure_costs(int N, std::vector<int> U, std::vector<int> V, std::vector<int> W) {

	n = N;
	for (int i = 0; i < n - 1; i++)
		roads.push_back({W[i], U[i], V[i]}), total += (ll)W[i];
	
	sort(roads.begin(), roads.end(), greater<tuple<int, int, int>>());

	vector<ll> res;
	res.push_back(total);

	for (int i = 0; i < n - 1; i++)
		total -= w(roads[i]), res.push_back(total);

	return res;
}

• Subtask 1: 5 / 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