Submission #982231

#TimeUsernameProblemLanguageResultExecution timeMemory
982231vjudge1Road Closures (APIO21_roads)C++17
5 / 100
50 ms5836 KiB
#include "roads.h"
#define _GLIBCXX_DEBUG 1
#pragma GCC optimize "O3,unroll-loops,trapv"
#include <bits/stdc++.h>
#define REP(i,o,n) for(int i=o;i<n;i++)
#define FORI(v) for(auto i:v)
#define FORJ(v) for(auto j:v)
#define FORK(v) for(auto k:v)
#define fi first
#define se second
#define pb push_back
using namespace std;
using pii = pair<int,int>;

long long memo[3000][3];
int k;

vector<pii> adj[3000];

std::vector<long long> minimum_closure_costs(int N, std::vector<int> U,
                                             std::vector<int> V,
                                             std::vector<int> W) {
  vector<long long> ans;
  long long sum = 0;
  FORI(W)sum += i;
  sort(W.begin(), W.end());
  reverse(W.begin(), W.end());
  long long cur = 0;
  REP(i,1,N){
    ans.pb(cur) ;
    cur += W.back();
    W.pop_back();
  }
  ans.pb(sum);
  reverse(ans.begin(), ans.end());
  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...