oj.uz

Submission #563246

# Submission time Handle Problem Language Result Execution time Memory
563246 2022-05-16T14:54:46 Z ngpin04 Road Closures (APIO21_roads) C++14
26 / 100
 55 ms 9436 KB 
#include <bits/stdc++.h>
#include "roads.h"
#define fi first
#define se second
#define mp make_pair
#define TASK ""
#define bit(x) (1LL << (x))
#define getbit(x, i) (((x) >> (i)) & 1)
#define ALL(x) (x).begin(), (x).end() 
using namespace std;
template <typename T1, typename T2> bool mini(T1 &a, T2 b) {
    if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maxi(T1 &a, T2 b) {
    if (a < b) {a = b; return true;} return false;
}
mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());

int rand(int l, int r) {
    return l + rd() % (r - l + 1);
}
const int N = 1e5 + 5; 
const int oo = 1e9;
const long long ooo = 1e18;
const int mod = 1e9 + 7; // 998244353;
const long double pi = acos(-1);

vector <int> adj[N];

long long f[N][2];
long long dp[205][205];

int fr[N];
int to[N];
int w[N];
int n;

vector <long long> sub1() {
    sort(w, w + (n - 1), greater <int>());
    long long tot = accumulate(w, w + (n - 1), 0LL);
    vector <long long> res;
    res.push_back(tot);
    for (int i = 0; i < n - 1; i++)
        tot -= w[i], res.push_back(tot);
    return res;
}

vector <long long> sub2() {
    vector <long long> res;
    res.push_back(accumulate(w, w + (n - 1), 0LL));
    for (int i = 0; i < n; i++)
    for (int j = 0; j < 2; j++)
        f[i][j] = ooo;

    f[0][0] = 0;
    for (int i = 1; i < n; i++) {
        f[i][0] = min(f[i - 1][0], f[i - 1][1]) + w[i - 1];
        f[i][1] = f[i - 1][0];
    }
    res.push_back(min(f[n - 1][0], f[n - 1][1]));

    for (int i = 2; i < n; i++)
        res.push_back(0);
    return res;
}   

void dfs(int u, int k, int p = -1) {
    for (int i : adj[u]) {
        int v = fr[i] ^ to[i] ^ u;
        if (v == p)
            continue;
        dfs(v, k, u);
    }
    
    int deg = 0;

    for (int j = 1; j <= k; j++)
        dp[u][j] = ooo;

    vector <long long> f(k + 1, ooo), g(k + 1, ooo);
    f[0] = 0;
    for (int i : adj[u]) {
        int v = fr[i] ^ to[i] ^ u;
        if (v == p) 
            continue;

        for (int cur = deg; cur >= 0; cur--) {
            if (cur + 1 <= k)
                mini(g[cur + 1], f[cur] + dp[v][k - 1]);
            mini(g[cur], f[cur] + dp[v][k] + w[i]);
        }

        deg++;
        mini(deg, k);

        for (int cur = 0; cur <= deg; cur++) {
            f[cur] = g[cur];
            g[cur] = ooo;
        }
    }

    for (int j = 0; j <= k; j++) {
        dp[u][j] = f[j];
        if (j > 0)
            mini(dp[u][j], dp[u][j - 1]);
    }
}

long long solve(int k) {

    dfs(1, k);
    return dp[1][k];
}

vector <long long> sub3() {
    vector <long long> res;
    for (int i = 0; i < n - 1; i++) {
        adj[fr[i]].push_back(i);
        adj[to[i]].push_back(i);
    }

    for (int k = 0; k < n; k++)
        res.push_back(solve(k));
    return res;
}

vector<long long> minimum_closure_costs(int N, vector<int> U,
                                             vector<int> V,
                                             vector<int> W) {
    n = N;
    bool cond3 = (n <= 200);
    bool cond2 = true;
    for (int i = 0; i < n - 1; i++) {
        fr[i] = U[i];
        to[i] = V[i];
        w[i] = W[i];
        cond2 &= fr[i] == i && to[i] == i + 1;
    }
    if (*max_element(ALL(U)) == 0)  
        return sub1();

    if (cond2)
        return sub2();

    if (cond3)
        return sub3();
    return vector<long long>(N, 0);
}

//#include "grader.cpp"

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 3 ms 2800 KB Output is correct
3 Correct 3 ms 2796 KB Output is correct
4 Correct 2 ms 2772 KB Output is correct
5 Correct 2 ms 2656 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2656 KB Output is correct
8 Correct 2 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 37 ms 5904 KB Output is correct
13 Correct 43 ms 8284 KB Output is correct
14 Correct 47 ms 8280 KB Output is correct
15 Correct 51 ms 8720 KB Output is correct
16 Correct 55 ms 8808 KB Output is correct
17 Correct 48 ms 8808 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 43 ms 7788 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 36 ms 9436 KB Output is correct
3 Correct 41 ms 8484 KB Output is correct
4 Correct 40 ms 8828 KB Output is correct
5 Correct 44 ms 8824 KB Output is correct
6 Correct 2 ms 2772 KB Output is correct
7 Correct 2 ms 2772 KB Output is correct
8 Correct 2 ms 2772 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2672 KB Output is correct
12 Correct 22 ms 6376 KB Output is correct
13 Correct 34 ms 8908 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 35 ms 8340 KB Output is correct
16 Correct 39 ms 8904 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2664 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 14 ms 3092 KB Output is correct
5 Correct 27 ms 3028 KB Output is correct
6 Correct 23 ms 3028 KB Output is correct
7 Correct 20 ms 3040 KB Output is correct
8 Correct 25 ms 3044 KB Output is correct
9 Correct 26 ms 3068 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2656 KB Output is correct
16 Correct 6 ms 2772 KB Output is correct
17 Correct 28 ms 3056 KB Output is correct
18 Correct 33 ms 3056 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 2 ms 2660 KB Output is correct
21 Correct 2 ms 2664 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2664 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 14 ms 3092 KB Output is correct
5 Correct 27 ms 3028 KB Output is correct
6 Correct 23 ms 3028 KB Output is correct
7 Correct 20 ms 3040 KB Output is correct
8 Correct 25 ms 3044 KB Output is correct
9 Correct 26 ms 3068 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2656 KB Output is correct
16 Correct 6 ms 2772 KB Output is correct
17 Correct 28 ms 3056 KB Output is correct
18 Correct 33 ms 3056 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 2 ms 2660 KB Output is correct
21 Correct 2 ms 2664 KB Output is correct
22 Correct 2 ms 2644 KB Output is correct
23 Incorrect 2 ms 2644 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

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

Subtask #6
0 / 25.0

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

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 3 ms 2800 KB Output is correct
3 Correct 3 ms 2796 KB Output is correct
4 Correct 2 ms 2772 KB Output is correct
5 Correct 2 ms 2656 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2656 KB Output is correct
8 Correct 2 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 37 ms 5904 KB Output is correct
13 Correct 43 ms 8284 KB Output is correct
14 Correct 47 ms 8280 KB Output is correct
15 Correct 51 ms 8720 KB Output is correct
16 Correct 55 ms 8808 KB Output is correct
17 Correct 48 ms 8808 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 43 ms 7788 KB Output is correct
20 Correct 2 ms 2644 KB Output is correct
21 Correct 36 ms 9436 KB Output is correct
22 Correct 41 ms 8484 KB Output is correct
23 Correct 40 ms 8828 KB Output is correct
24 Correct 44 ms 8824 KB Output is correct
25 Correct 2 ms 2772 KB Output is correct
26 Correct 2 ms 2772 KB Output is correct
27 Correct 2 ms 2772 KB Output is correct
28 Correct 2 ms 2644 KB Output is correct
29 Correct 2 ms 2644 KB Output is correct
30 Correct 2 ms 2672 KB Output is correct
31 Correct 22 ms 6376 KB Output is correct
32 Correct 34 ms 8908 KB Output is correct
33 Correct 2 ms 2644 KB Output is correct
34 Correct 35 ms 8340 KB Output is correct
35 Correct 39 ms 8904 KB Output is correct
36 Correct 2 ms 2664 KB Output is correct
37 Correct 2 ms 2644 KB Output is correct
38 Correct 2 ms 2644 KB Output is correct
39 Correct 14 ms 3092 KB Output is correct
40 Correct 27 ms 3028 KB Output is correct
41 Correct 23 ms 3028 KB Output is correct
42 Correct 20 ms 3040 KB Output is correct
43 Correct 25 ms 3044 KB Output is correct
44 Correct 26 ms 3068 KB Output is correct
45 Correct 2 ms 2644 KB Output is correct
46 Correct 2 ms 2644 KB Output is correct
47 Correct 2 ms 2644 KB Output is correct
48 Correct 2 ms 2644 KB Output is correct
49 Correct 2 ms 2644 KB Output is correct
50 Correct 2 ms 2656 KB Output is correct
51 Correct 6 ms 2772 KB Output is correct
52 Correct 28 ms 3056 KB Output is correct
53 Correct 33 ms 3056 KB Output is correct
54 Correct 2 ms 2644 KB Output is correct
55 Correct 2 ms 2660 KB Output is correct
56 Correct 2 ms 2664 KB Output is correct
57 Correct 2 ms 2644 KB Output is correct
58 Incorrect 2 ms 2644 KB Output isn't correct
59 Halted 0 ms 0 KB -