Submission #708091

#TimeUsernameProblemLanguageResultExecution timeMemory
708091irmuunRoad Closures (APIO21_roads)C++17
0 / 100
39 ms5004 KiB
#include<bits/stdc++.h>
#include "roads.h"
using namespace std;
#define pb push_back
#define ll long long
#define ff first
#define ss second
#define PI 3.1415926535897932384626433
#define all(s) s.begin(),s.end() 

const ll mod=1000000007,mod1=998244353,INF=1e18,MAX=1e9;

vector<ll> minimum_closure_costs(int n,vector<int>u,vector<int>v,vector<int>w){
    sort(all(w));
    ll cur=0;
    for(ll i=0;i<n;i++){
        cur+=w[i];
    }
    vector<ll>ans;
    ans.pb(cur);
    for(ll i=n-1;i>=0;i--){
        cur-=w[i];
        ans.pb(cur);
    }
    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...