Submission #613775

#	Time	Username	Problem	Language	Result	Execution time	Memory
613775		AugustinasJucas	Road Closures (APIO21_roads)	C++14	12 / 100	59 ms	12168 KiB

roads

#include "roads.h"

#include <bits/stdc++.h>
using namespace std;
const int dydis = 1e5 + 10;
vector<pair<int, int> > gr[dydis];
int n, m;
vector<long long> minimum_closure_costs(int N, std::vector<int> U,
                                             std::vector<int> V,
                                             std::vector<int> W) {
    n = N; m = W.size();
    bool line = true, star = true;
    vector<int> mas;
    for(int i = 0; i < m; i++) {
        int a = U[i]; int b = V[i]; int w = W[i];
        if(a != b-1) line = false;
        if(a != 0) star = false;
        gr[a].push_back({b, w});
        gr[b].push_back({a, w});
        mas.push_back(w);
    }

    if(line) {
        /// Galiu praleisti max 1 is eiles. Kokia min suma?
        long long dp[n]; /// dp[i] - turiu visus iki i ir i-aji emiau. Kokia min suma?

        dp[0] = mas[0];
        dp[1] = mas[1];
        for(int i = 2; i < n; i++) {
            dp[i] = min(dp[i-1] + mas[i], dp[i-2] + mas[i]);
        }
        vector<long long> ret(n, 0);
        for(auto x : mas) ret[0] += x;
        ret[1] = min(dp[n-1], dp[n-2]);
        return ret;
    }
    if(star) {
        //cout << "star - " << true << endl;
        sort(mas.begin(), mas.end());
        reverse(mas.begin(), mas.end());
        vector<long long> ret(n, 0);
        for(auto x : mas) ret[0] += x;
        long long sum = 0;
        for(int i = n-1; i > 0; i--) {
            if(i != n- 1) sum += mas[i];
            ret[i] = sum;

        }
        return ret;
    }
    return vector<long long>(N, 0);
}

• Subtask 1: 5 / 5
• Subtask 2: 7 / 7
• Subtask 3: 0 / 14
• Subtask 4: 0 / 10
• Subtask 5: 0 / 17
• Subtask 6: 0 / 25
• Subtask 7: 0 / 22