Submission #1081117

#	Time	Username	Problem	Language	Result	Execution time	Memory
1081117		pawned	도로 폐쇄 (APIO21_roads)	C++17	5 / 100	43 ms	6332 KiB

roads

#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")

#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pb push_back
typedef long long ll;
typedef pair<ll, ll> ii;
typedef vector<ll> vi;

#include "roads.h"

vi minimum_closure_costs(int N, vector<int> U, vector<int> V, vector<int> W) {
	vi costs;
	for (ll x : W)
		costs.pb(x);
	sort(costs.begin(), costs.end());
	vi ans(N, 0);
	for (int i = N - 2; i >= 0; i--) {
		ans[i] = ans[i + 1] + costs[N - 2 - i];
	}
	return ans;
}

• 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