Submission #654681

#TimeUsernameProblemLanguageResultExecution timeMemory
654681Sam_a17도로 폐쇄 (APIO21_roads)C++14
5 / 100
46 ms5536 KiB
#include <bits/stdc++.h>
using namespace std;

#define all(x) x.begin(), x.end()

vector<long long> minimum_closure_costs(int N, vector<int> U, vector<int> V, vector<int> W) {
  bool flag1 = true;
  for(int i = 0; i < N - 1; i++) {
    if(U[i] != 0) {
      flag1 = false;
    }
  }

  if(flag1) {
    sort(all(W));
    vector<long long> answ(N, 0);
    int it = 0;
    for(int i = N - 2; i >= 0; i--) {
      answ[i] = answ[i + 1] + W[it++];
    }

    return answ;
  }

  return vector<long long>(N, 0);
}
#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...