oj.uz

Submission #559035

# Submission time Handle Problem Language Result Execution time Memory
559035 2022-05-09T09:50:02 Z nghiass001 Road Closures (APIO21_roads) C++17
5 / 100
 87 ms 12616 KB 
#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 == c)
            val[i + 1] = c;
    }
    dpx[1] = val[1];
    REP(i, 1, n) ans[0] += val[i];
    REP(i, 2, n) {
        dpx[i] = min(dpx[i - 1], dpx[i - 2]) + val[i];
    }
    ans[1] = min(dpx[n - 1], dpx[n - 2]);
}

void DFS(int u, int p, int max_sz) {
    fill(dp[u] + 1, dp[u] + sz[u] + 1, 1e15);
    dp[u][0] = 0;
    int now_sz = min(sz[u], max_sz);
    for(auto [c, v] : S[u]) if (v != p) {
        DFS(v, u, max_sz);
        FORD(i, now_sz, 1) {
            dp[u][i] = min(dp[u][i] + dd[v][1] + c, dp[u][i - 1] + dd[v][0]);
        }
        dp[u][0] += dd[v][1] + c;
    }
    if (now_sz < max_sz) ++now_sz;
    if (now_sz) dd[u][0] = dp[u][now_sz - 1]; else dd[u][0] = 1e15;
    dd[u][1] = dp[u][now_sz];
}

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] = min(dd[0][1], dd[0][0]);
    }
}

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 (n > 2000) sub2();
    else sub34();

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

Compilation message

roads.cpp: In function 'std::vector<long long int> minimum_closure_costs(int, std::vector<int>, std::vector<int>, std::vector<int>)':
roads.cpp:67: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]
   67 |     if (S[0].size() == n - 1) sub1();
      |         ~~~~~~~~~~~~^~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 3 ms 2772 KB Output is correct
3 Correct 4 ms 2808 KB Output is correct
4 Correct 3 ms 2800 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2664 KB Output is correct
7 Correct 3 ms 2644 KB Output is correct
8 Correct 3 ms 2772 KB Output is correct
9 Correct 3 ms 2772 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 33 ms 7908 KB Output is correct
13 Correct 70 ms 11396 KB Output is correct
14 Correct 55 ms 11424 KB Output is correct
15 Correct 87 ms 12240 KB Output is correct
16 Correct 63 ms 12492 KB Output is correct
17 Correct 63 ms 12616 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 67 ms 10596 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Incorrect 44 ms 8808 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Incorrect 3 ms 3300 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Incorrect 3 ms 3300 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 55 ms 10200 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 55 ms 10200 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 3 ms 2772 KB Output is correct
3 Correct 4 ms 2808 KB Output is correct
4 Correct 3 ms 2800 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2664 KB Output is correct
7 Correct 3 ms 2644 KB Output is correct
8 Correct 3 ms 2772 KB Output is correct
9 Correct 3 ms 2772 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 33 ms 7908 KB Output is correct
13 Correct 70 ms 11396 KB Output is correct
14 Correct 55 ms 11424 KB Output is correct
15 Correct 87 ms 12240 KB Output is correct
16 Correct 63 ms 12492 KB Output is correct
17 Correct 63 ms 12616 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 67 ms 10596 KB Output is correct
20 Correct 2 ms 2644 KB Output is correct
21 Incorrect 44 ms 8808 KB Output isn't correct
22 Halted 0 ms 0 KB -