Submission #979910

#	Time	Username	Problem	Language	Result	Execution time	Memory
979910		nnin	Road Closures (APIO21_roads)	C++14	0 / 100	29 ms	6768 KiB

roads

#include "roads.h"
#include<bits/stdc++.h>
#define pii pair<int,int>
#define f first
#define s second
using namespace std;
using ll = long long;
  
bool done[100005];
int ct[100005];
vector<int> deg[100005];

vector<long long> minimum_closure_costs(int n, vector<int> U, vector<int> V, vector<int> W) {
  for(int i=0;i<n-1;i++) {
    ct[U[i]]++;
    ct[V[i]]++;
  }
  for(int i=0;i<n;i++) {
    deg[ct[i]].push_back(i);
  }
  vector<long long> ans(n);
  for(int i=2;i<n;i++) ans[i] = 0;
  long long even = 0, odd = 0;
  for(int i=0;i<n;i++) {
    if(i%2) odd += W[i];
    else even += W[i];
  }
  ans[1] = min(even, odd);
  ans[0] = even+odd;
  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