oj.uz

Submission #728072

# Submission time Handle Problem Language Result Execution time Memory
728072 2023-04-21T22:57:03 Z grossly_overconfident Road Closures (APIO21_roads) C++17
36 / 100
 2000 ms 45576 KB 
//#include "roads.h"
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
//#define int long long
//#define INT_MAX LONG_LONG_MAX
 




 //satiating my crippling points addiction



long long findscore(multiset<pair<long long, pair<long long, long long>>>& candidates, int k, int j){
    long long score = 0;
    
    for (auto i : candidates){
        
        if (j <= k){
            score += min(i.second.first, i.second.second);
        }
        else{
            j--;
            score += i.second.second;
        }
 
       
    }
    return score;
}
 
long long solve(vector<vector<long long>>& dp, vector<vector<pair<int, int>>>& adj, int p, int n, int k, int i, int j){
    if (dp[i][j] != -1){
        return dp[i][j];
    }
    bool ac = true;
    multiset<pair<long long, pair<long long, long long>>> candidates;
    for (auto a : adj[i]){
        if (a.first != p){
            ac = false;
            long long op1 = solve(dp, adj, i, n, k, a.first, 0);
            long long op2 = solve(dp, adj, i, n, k, a.first, 1) + a.second;
            candidates.insert({op2 - op1, {op1, op2}});
        }
    }
    if (ac){
        return 0;
    }
    return dp[i][j] = findscore(candidates, k, adj[i].size() - j);
}
 
vector<long long> minimum_closure_costs(int n, vector<int> u, vector<int> v, vector<int> w){
    bool subtask1 = true;
    for (int i = 1; i < u.size(); ++i){
        if (u[i] != u[i - 1]){
            subtask1 = false;
            break;
        }
    }
    vector<long long> out(n);
    if (subtask1){
        sort(w.begin(), w.end());
        int j = 0;
        for (int i = n - 2; i >= 0; --i){
            out[i] = out[i + 1] + w[j];
            j++;
        }
        return out;
    }
    bool subtask2 = true;

    for (int i = 0; i < n - 1; ++i){
        if (!(u[i] == i && v[i] == i + 1)){
            subtask2 = false;
            break;
        }
    }

    vector<vector<pair<int, int>>> adj(n);
    for (int i = 0; i < n - 1; ++i){
        adj[u[i]].push_back({v[i], w[i]});
        adj[v[i]].push_back({u[i], w[i]});
    }
    if (subtask2){
        vector<vector<long long>> dp(n + 10, vector<long long>(2, -1));
        out[0] = solve(dp, adj, -1, n, 0, 0, 0);
        vector<vector<long long>> dp2(n + 10, vector<long long>(2, -1));
        out[1] = solve(dp2, adj, -1, n, 1, 0, 0);
        return out;
    }
    for (int i = 0; i < n; ++i){
        vector<vector<long long>> dp(n + 10, vector<long long>(2, -1));
        out[i] = solve(dp, adj, -1, n, i, 0, 0);
    }
    
    return out;
}
/*
int main(){
    int n;
    cin >> n;
    vector<int> u(n - 1), v(n - 1), w(n - 1);
    for (int i = 0; i < n - 1; ++i){
        cin >> u[i];
    }
    for (int i = 0; i < n - 1; ++i){
        cin >> v[i];
    }
    for (int i = 0; i < n - 1; ++i){
        cin >> w[i];
    }
    vector<long long> out;
    out = minimum_closure_costs(n, u, v, w);
    for (auto a : out){
        cout << a << " ";
    }
    return 0;
}
*/

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:56:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |     for (int i = 1; i < u.size(); ++i){
      |                     ~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 31 ms 2132 KB Output is correct
13 Correct 40 ms 4416 KB Output is correct
14 Correct 45 ms 4892 KB Output is correct
15 Correct 48 ms 5280 KB Output is correct
16 Correct 51 ms 5416 KB Output is correct
17 Correct 50 ms 5584 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 37 ms 3920 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 86 ms 36104 KB Output is correct
3 Correct 92 ms 42452 KB Output is correct
4 Correct 97 ms 45364 KB Output is correct
5 Correct 99 ms 45576 KB Output is correct
6 Correct 2 ms 980 KB Output is correct
7 Correct 2 ms 1128 KB Output is correct
8 Correct 2 ms 980 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 304 KB Output is correct
12 Correct 77 ms 26784 KB Output is correct
13 Correct 95 ms 44600 KB Output is correct
14 Correct 0 ms 296 KB Output is correct
15 Correct 84 ms 40236 KB Output is correct
16 Correct 106 ms 44592 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 5 ms 212 KB Output is correct
5 Correct 8 ms 332 KB Output is correct
6 Correct 9 ms 212 KB Output is correct
7 Correct 7 ms 212 KB Output is correct
8 Correct 9 ms 212 KB Output is correct
9 Correct 10 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 2 ms 212 KB Output is correct
17 Correct 9 ms 332 KB Output is correct
18 Correct 10 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 5 ms 212 KB Output is correct
5 Correct 8 ms 332 KB Output is correct
6 Correct 9 ms 212 KB Output is correct
7 Correct 7 ms 212 KB Output is correct
8 Correct 9 ms 212 KB Output is correct
9 Correct 10 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 2 ms 212 KB Output is correct
17 Correct 9 ms 332 KB Output is correct
18 Correct 10 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 312 ms 476 KB Output is correct
24 Correct 819 ms 600 KB Output is correct
25 Correct 570 ms 468 KB Output is correct
26 Correct 920 ms 596 KB Output is correct
27 Correct 1286 ms 652 KB Output is correct
28 Correct 1054 ms 648 KB Output is correct
29 Correct 686 ms 552 KB Output is correct
30 Correct 1124 ms 600 KB Output is correct
31 Correct 1101 ms 596 KB Output is correct
32 Correct 1135 ms 644 KB Output is correct
33 Correct 2 ms 980 KB Output is correct
34 Correct 3 ms 1108 KB Output is correct
35 Correct 2 ms 980 KB Output is correct
36 Correct 2 ms 360 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 4 ms 212 KB Output is correct
42 Correct 8 ms 336 KB Output is correct
43 Correct 8 ms 332 KB Output is correct
44 Correct 7 ms 212 KB Output is correct
45 Correct 9 ms 212 KB Output is correct
46 Correct 8 ms 212 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 464 ms 536 KB Output is correct
54 Correct 788 ms 600 KB Output is correct
55 Correct 1263 ms 648 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 2 ms 212 KB Output is correct
59 Correct 9 ms 332 KB Output is correct
60 Correct 8 ms 212 KB Output is correct
61 Correct 1 ms 212 KB Output is correct
62 Correct 1 ms 212 KB Output is correct
63 Correct 0 ms 212 KB Output is correct
64 Correct 748 ms 596 KB Output is correct
65 Correct 744 ms 596 KB Output is correct
66 Correct 989 ms 596 KB Output is correct
67 Correct 1133 ms 660 KB Output is correct
68 Correct 994 ms 600 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2068 ms 14632 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2068 ms 14632 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 31 ms 2132 KB Output is correct
13 Correct 40 ms 4416 KB Output is correct
14 Correct 45 ms 4892 KB Output is correct
15 Correct 48 ms 5280 KB Output is correct
16 Correct 51 ms 5416 KB Output is correct
17 Correct 50 ms 5584 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 37 ms 3920 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 86 ms 36104 KB Output is correct
22 Correct 92 ms 42452 KB Output is correct
23 Correct 97 ms 45364 KB Output is correct
24 Correct 99 ms 45576 KB Output is correct
25 Correct 2 ms 980 KB Output is correct
26 Correct 2 ms 1128 KB Output is correct
27 Correct 2 ms 980 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 304 KB Output is correct
31 Correct 77 ms 26784 KB Output is correct
32 Correct 95 ms 44600 KB Output is correct
33 Correct 0 ms 296 KB Output is correct
34 Correct 84 ms 40236 KB Output is correct
35 Correct 106 ms 44592 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 5 ms 212 KB Output is correct
40 Correct 8 ms 332 KB Output is correct
41 Correct 9 ms 212 KB Output is correct
42 Correct 7 ms 212 KB Output is correct
43 Correct 9 ms 212 KB Output is correct
44 Correct 10 ms 212 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 2 ms 212 KB Output is correct
52 Correct 9 ms 332 KB Output is correct
53 Correct 10 ms 212 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 1 ms 212 KB Output is correct
56 Correct 0 ms 212 KB Output is correct
57 Correct 1 ms 212 KB Output is correct
58 Correct 312 ms 476 KB Output is correct
59 Correct 819 ms 600 KB Output is correct
60 Correct 570 ms 468 KB Output is correct
61 Correct 920 ms 596 KB Output is correct
62 Correct 1286 ms 652 KB Output is correct
63 Correct 1054 ms 648 KB Output is correct
64 Correct 686 ms 552 KB Output is correct
65 Correct 1124 ms 600 KB Output is correct
66 Correct 1101 ms 596 KB Output is correct
67 Correct 1135 ms 644 KB Output is correct
68 Correct 2 ms 980 KB Output is correct
69 Correct 3 ms 1108 KB Output is correct
70 Correct 2 ms 980 KB Output is correct
71 Correct 2 ms 360 KB Output is correct
72 Correct 1 ms 340 KB Output is correct
73 Correct 1 ms 340 KB Output is correct
74 Correct 0 ms 212 KB Output is correct
75 Correct 0 ms 212 KB Output is correct
76 Correct 4 ms 212 KB Output is correct
77 Correct 8 ms 336 KB Output is correct
78 Correct 8 ms 332 KB Output is correct
79 Correct 7 ms 212 KB Output is correct
80 Correct 9 ms 212 KB Output is correct
81 Correct 8 ms 212 KB Output is correct
82 Correct 1 ms 340 KB Output is correct
83 Correct 1 ms 340 KB Output is correct
84 Correct 1 ms 340 KB Output is correct
85 Correct 1 ms 212 KB Output is correct
86 Correct 1 ms 212 KB Output is correct
87 Correct 1 ms 212 KB Output is correct
88 Correct 464 ms 536 KB Output is correct
89 Correct 788 ms 600 KB Output is correct
90 Correct 1263 ms 648 KB Output is correct
91 Correct 1 ms 340 KB Output is correct
92 Correct 1 ms 340 KB Output is correct
93 Correct 2 ms 212 KB Output is correct
94 Correct 9 ms 332 KB Output is correct
95 Correct 8 ms 212 KB Output is correct
96 Correct 1 ms 212 KB Output is correct
97 Correct 1 ms 212 KB Output is correct
98 Correct 0 ms 212 KB Output is correct
99 Correct 748 ms 596 KB Output is correct
100 Correct 744 ms 596 KB Output is correct
101 Correct 989 ms 596 KB Output is correct
102 Correct 1133 ms 660 KB Output is correct
103 Correct 994 ms 600 KB Output is correct
104 Execution timed out 2068 ms 14632 KB Time limit exceeded
105 Halted 0 ms 0 KB -