Submission #722430

#	Time	Username	Problem	Language	Result	Execution time	Memory
722430		grossly_overconfident	도로 폐쇄 (APIO21_roads)	C++17	0 / 100	38 ms	3284 KiB

roads

#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
//#define int long long
//#define INT_MAX LONG_LONG_MAX


vector<long long> minimum_closure_costs(int n, vector<int> u, vector<int> v, vector<int> w){
    long long op1 = 0, op2 = 0, total = 0;
    for (int i = 0; i < n; i += 2){
        op1 += w[i];
    }
    for (int i = 1; i < n; i += 2){
        op2 += w[i];
    }
    for (int i = 0; i < n; ++i){
        total += w[i];
    }
    vector<long long> out(n);
    out[0] = total;
    out[1] = min(op1, op2);
    return out;
}

• 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