Submission #1365598

#	Time	Username	Problem	Language	Result	Execution time	Memory
1365598		settop	Road Closures (APIO21_roads)	C++20	0 / 100	11 ms	2580 KiB

roads

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

#define ll long long
#define fall(i,a,b) for(int i=a;i<=b;i++)
#define rfall(i,a,b) for(int i=a;i>=b;i--)
#define pb push_back
#define all(x) x.begin(),x.end()
#define sz(x) (int)x.size()
typedef pair<int,int> pii;
const int MAXN=2e5+10;

int n;
vector<pii> g[MAXN];

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);
  ll soma=0; for(auto u:W) soma+=u;
  sort(all(W),greater<>());
  fall(i,0,n-1){
    ans[i]=soma;
    if(i<sz(W)) soma-=W[i];
  }
  return ans;
}

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