Submission #981228

#	Time	Username	Problem	Language	Result	Execution time	Memory
981228		Faisal_Saqib	Road Closures (APIO21_roads)	C++17	5 / 100	52 ms	4188 KiB

roads

#include "roads.h"
#include <bits/stdc++.h>
#include <vector>
using namespace std;
#define ll long long
vector<long long> minimum_closure_costs(int n, std::vector<int> u,std::vector<int> v,std::vector<int> w) {
  bool subtask1=1;
  vector<long long> ans(n);
  for(int i=0;i<(n-1);i++)
  {
    subtask1&=(u[i]==0);
    ans[0]+=w[i];
  }
  if(subtask1)
  {
    sort(begin(w),end(w));
    for(int i=1;i<n;i++)
    {
      ans[i]=ans[i-1]-w[n-i-1];  
    }
    return ans;
  }
  else{
    bool subtask2=1;
    for(int i=0;i<(n-1);i++)
    {
      subtask2&=(u[i]==i and v[i]==(i+1));
    }
    if(subtask2)
    {
      ll even=0,odd=0;
      for(int i=0;i<(n-1);i++)
      {
        if(i%2)
        {
          odd+=w[i];
        }
        else{
          even+=w[i];
        }
      }
      ans[1]=min(odd,even);
      return ans;
    }
    else{

    }
  }
  return std::vector<long long>(n, 0);
}

• Subtask 1: 5 / 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