제출 #1177520

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1177520		Agageldi	Road Closures (APIO21_roads)	C++20	5 / 100	31 ms	4656 KiB

roads

#include "bits/stdc++.h"
#include "roads.h"
// #include "grader.cpp"
using namespace std;

#define ll long long

ll sum, sum2, n, ans, sum3;
vector <ll> v;

vector<ll>minimum_closure_costs(int N,vector<int> U,vector<int> V,vector<int> W) {
    bool tr = 0;
    for(int i = 0; i < N; i++) {
        if(U[i] != i) tr = 1;
        if(i % 2 == 0) sum2 +=  W[i];
        else sum3 += W[i];
    }
    for(auto i : W) {
        sum += i;
    }
    sort(W.rbegin(),W.rend());
    v.push_back(sum);
    if(!tr) {
        v.push_back(min(sum2,sum3));
        for(int i = 1; i <= n-2; i++) {
            v.push_back(0);
        }
        return v;
    }
    for(auto i : W) {
        sum -= i;
        v.push_back(sum);
    }
    return v;
}

• 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