Submission #1163690

#	Time	Username	Problem	Language	Result	Execution time	Memory
1163690		Malix	도로 폐쇄 (APIO21_roads)	C++20	5 / 100	31 ms	3840 KiB

roads

#include "roads.h"
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> tii;
typedef vector<ll> li;
typedef vector<li> lii;
 
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define LSOne(s) ((s)&(-s))
 
const ll INF=1000000000000000010;
const int inf=1e9+10;
const ll M=1e9+7;

std::vector<long long> minimum_closure_costs(int n, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
  vector<ll> ans(n,0);
  sort(W.begin(),W.end());
  reverse(W.begin(),W.end());
  for(int i=n-2;i>=0;i--){
    ans[i]+=ans[i+1];
    ans[i]+=(ll)W[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