Submission #981632

#	Time	Username	Problem	Language	Result	Execution time	Memory
981632		MuhammadSaram	Road Closures (APIO21_roads)	C++17	0 / 100	33 ms	3796 KiB

roads

/********************* بسم الله الرحمن الرحيم ***********************/
 /******************** ٱلْحَمْدُ لِلَّٰهِ رَبِّ ٱلْعَالَمِينَ *************************/
/******************* Prophet Muhammad صلى الله عليه وسلم ************/
   /*********************** وَقُل رَّبِّ زِدْنِي عِلْمًا **************************/

#ifdef ONLINE_JUDGE
	#pragma GCC optimize("Ofast")
	#pragma GCC optimize("O3,unroll-loops")
	#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#else

#endif

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

// #define int long long
#define endl '\n'
#define in binary_search
#define ll long long
#define ld long double
#define Hey ios::sync_with_stdio(false);
#define Welcome cin.tie(NULL), cout.tie(NULL);
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(), v.rend()

vector<ll> minimum_closure_costs(int n,vector<int> u,vector<int> v,vector<int> w)
{
	ll su=0;
	for (int i=0;i<n-1;i++)
		su+=w[i];
	sort(rall(w));
	vector<ll> ans;
	ans.push_back(su);
	su-=(ll)w[0];
	for (int i=0;i<n-1;su-=(ll)w[i],i++)
		ans.push_back(su);
	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