제출 #559062

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
559062		nghiass001	도로 폐쇄 (APIO21_roads)	C++17	29 / 100	2075 ms	19240 KiB

roads

#include <bits/stdc++.h>
#define FOR(i,l,r) for(int i=(l); i<=(r); ++i)
#define REP(i,l,r) for(int i=(l); i<(r); ++i)
#define FORD(i,r,l) for(int i=(r); i>=(l); --i)
#define REPD(i,r,l) for(int i=(r)-1; i>=(l); --i)
#define pii pair<int, int>
using namespace std;
const int N = 1e5 + 5, Ns4 = 2005;
int n;
long long ans[N];
long long dpx[N], val[N];
int sz[Ns4];
long long dp[Ns4][Ns4], dd[Ns4][2];
vector<pii> S[N];

void sub1() {
    sort(S[0].begin(), S[0].end());
    REP(i, 0, n - 1) ans[n - i - 2] = ans[n - i - 1] + S[0][i].first;
}

void sub2() {
    REP(i, 0, n - 1) {
        for(auto [c, v] : S[i]) if (i + 1 == v)
            val[i + 1] = c;
    }
    REP(i, 1, n) ans[0] += val[i];
    REP(i, 2, n) {
        dpx[i] = min(dpx[i - 1] + val[i], dpx[i - 2] + val[i - 1]);
    }
    ans[1] = dpx[n - 1];
}

void DFS(int u, int p, int max_sz) {
    int now_sz = min(sz[u], max_sz);
    vector<int> Q;
    long long sum = 0, pre_sum = 0;
    for(auto [c, v] : S[u]) if (v != p) {
        DFS(v, u, max_sz);
        long long xx = dd[v][1] + c;
        long long yy = dd[v][0];
        sum += xx;
        Q.push_back(yy - xx);
    }

    sort(Q.begin(), Q.end());

    pre_sum = 1e15;
    REP(i, 0, now_sz) {
        pre_sum = sum;
        sum += min(0, Q[i]);
    }
    if (now_sz < max_sz) pre_sum = sum;
    dd[u][0] = pre_sum;
    dd[u][1] = sum;
}

void sub34() {
    REP(i, 0, n) {
        sz[i] = S[i].size() - 1;
        if (i == 0) ++sz[i];
    }
    REP(i, 0, n) {
        DFS(0, 0, i);
        ans[i] = dd[0][1];
    }
}

vector<long long> minimum_closure_costs(int N, vector<int> U, vector<int> V, vector<int> W) {
    n = N;
    REP(i, 0, n - 1) {
        S[U[i]].emplace_back(W[i], V[i]);
        S[V[i]].emplace_back(W[i], U[i]);
    }
    if (S[0].size() == n - 1) sub1();
    else if (true) sub34();
    else if (n > 2000) sub2();
    else if (n <= 2000) sub34();

    vector<long long> ret(n);
    REP(i, 0, n) ret[i] = ans[i];
    return ret;
}

컴파일 시 표준 에러 (stderr) 메시지

roads.cpp: In function 'std::vector<long long int> minimum_closure_costs(int, std::vector<int>, std::vector<int>, std::vector<int>)':
roads.cpp:74:21: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   74 |     if (S[0].size() == n - 1) sub1();
      |         ~~~~~~~~~~~~^~~~~~~~

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