Submission #981234

#	Time	Username	Problem	Language	Result	Execution time	Memory
981234		Faisal_Saqib	Road Closures (APIO21_roads)	C++17	0 / 100	35 ms	3416 KiB

roads

#include "roads.h"
#include <bits/stdc++.h>
//#include "grader.cpp"
#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) {
  vector<long long> ans(n);
  ll even=0,odd=0;
  ll even1=0;
  ll odd1=0;
  ans[1]=1e17;
  for(int i=0;i<(n-1);i++)
  {
    ans[0]+=w[i];
    if(i%2)
    {
      odd+=w[i];
    }
    else{
      even+=w[i];
    }
  }
  for(int i=0;i<(n-1);i++)
  {
    if(i%2)
    {
      odd-=w[i];
      odd1+=w[i];
    }
    else{
      even-=w[i];
      even1+=w[i];
    }
    ans[1]=min(ans[1],min(odd1,even1)+min(odd,even));
  }
  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