답안 #596404

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
596404	2022-07-14T17:15:26 Z	Ozy	도로 폐쇄 (APIO21_roads)	C++17	24 / 100	270 ms	7964 KB

roads

#include "roads.h"
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for (int i = (a); i <= (b); i++)
#define repa(i,a,b) for (int i = (a); i >= (b); i--)
#define lli long long int
#define debugsl(a) cout << #a << " = " << a << ", "
#define debug(a) cout << #a << " = " << a << endl

#define MAX 2000
#define des first
#define w second
#define dif first.first
#define peso first.second
#define si second.first
#define talvez second.second

lli n,a,b,c;
lli dp[2][MAX+2];
vector<pair<lli,lli> > hijos[MAX+2];

void dfs(lli pos, lli padre, lli k) {
    vector<pair<pair<lli,lli> ,pair<lli,lli> > > orden;
    lli tam = 0;

    for (auto h : hijos[pos]) {
        if (h.des == padre) continue;
        dfs(h.des,pos,k);

        a = dp[0][h.des] + h.w;
        b = dp[1][h.des];
        c = b-a;

        orden.push_back({{c,h.w},{a, b} });
        tam++;
    }
    //sort de chico a grande
    sort(orden.begin(), orden.end());

    lli sum = 0;

    lli cont = 0;
    rep(i,0,k-1) {

        if (i >= tam) break;

        auto act = orden[i];
        if (act.dif >= 0) break;
        sum += act.talvez;

        cont = i+1;
    }

    rep(i,cont,tam-1) {
        a = orden[i].si;
        b = orden[i].talvez +  orden[i].peso;
        sum += min(a,b);
    }

    dp[0][pos] = sum;
    if (cont < k) dp[1][pos] = sum;
    else {
        sum -= orden[k-1].talvez;

        a = orden[k-1].si;
        b = orden[k-1].talvez +  orden[k-1].peso;
        sum += min(a,b);

        dp[1][pos] = sum;
    }

}

std::vector <long long> minimum_closure_costs(int N, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
    vector<long long> res (N, 0);
    n = N;

    //asigna hijos
    rep(i,0,n-2) {
        a = U[i]+1;
        b = V[i]+1;
        c = W[i];
        hijos[a].push_back({b,c});
        hijos[b].push_back({a,c});

        res[0] += c;
    }


    //dp es [ cuantos me faltan para ya estar ] [ nodo ]
    rep(i,1,n-1) {
        rep(j,1,n) {dp[0][j] = 0; dp[1][j] = 0;}
        dfs(1,0,i);
        res[i] = dp[0][1];
    }

    return res;
}

Subtask #1
0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	223 ms	668 KB	Output is correct
3	Correct	242 ms	680 KB	Output is correct
4	Correct	164 ms	696 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	2 ms	340 KB	Output is correct
7	Correct	2 ms	340 KB	Output is correct
8	Correct	140 ms	632 KB	Output is correct
9	Correct	212 ms	596 KB	Output is correct
10	Correct	2 ms	340 KB	Output is correct
11	Correct	2 ms	340 KB	Output is correct
12	Runtime error	19 ms	4904 KB	Execution killed with signal 11
13	Halted	0 ms	0 KB	-

Subtask #2
0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Runtime error	27 ms	7964 KB	Execution killed with signal 11
3	Halted	0 ms	0 KB	-

Subtask #3
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	468 KB	Output is correct
4	Correct	2 ms	356 KB	Output is correct
5	Correct	2 ms	340 KB	Output is correct
6	Correct	2 ms	340 KB	Output is correct
7	Correct	2 ms	340 KB	Output is correct
8	Correct	3 ms	340 KB	Output is correct
9	Correct	2 ms	340 KB	Output is correct
10	Correct	2 ms	340 KB	Output is correct
11	Correct	2 ms	340 KB	Output is correct
12	Correct	2 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	3 ms	340 KB	Output is correct
15	Correct	2 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	3 ms	340 KB	Output is correct
18	Correct	4 ms	340 KB	Output is correct
19	Correct	2 ms	392 KB	Output is correct
20	Correct	2 ms	300 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct

Subtask #4
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	468 KB	Output is correct
4	Correct	2 ms	356 KB	Output is correct
5	Correct	2 ms	340 KB	Output is correct
6	Correct	2 ms	340 KB	Output is correct
7	Correct	2 ms	340 KB	Output is correct
8	Correct	3 ms	340 KB	Output is correct
9	Correct	2 ms	340 KB	Output is correct
10	Correct	2 ms	340 KB	Output is correct
11	Correct	2 ms	340 KB	Output is correct
12	Correct	2 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	3 ms	340 KB	Output is correct
15	Correct	2 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	3 ms	340 KB	Output is correct
18	Correct	4 ms	340 KB	Output is correct
19	Correct	2 ms	392 KB	Output is correct
20	Correct	2 ms	300 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	0 ms	340 KB	Output is correct
23	Correct	92 ms	500 KB	Output is correct
24	Correct	257 ms	596 KB	Output is correct
25	Correct	181 ms	560 KB	Output is correct
26	Correct	208 ms	468 KB	Output is correct
27	Correct	207 ms	640 KB	Output is correct
28	Correct	151 ms	620 KB	Output is correct
29	Correct	215 ms	556 KB	Output is correct
30	Correct	178 ms	596 KB	Output is correct
31	Correct	182 ms	580 KB	Output is correct
32	Correct	163 ms	620 KB	Output is correct
33	Correct	119 ms	824 KB	Output is correct
34	Correct	173 ms	852 KB	Output is correct
35	Correct	124 ms	852 KB	Output is correct
36	Correct	215 ms	668 KB	Output is correct
37	Correct	246 ms	692 KB	Output is correct
38	Correct	162 ms	596 KB	Output is correct
39	Correct	1 ms	340 KB	Output is correct
40	Correct	1 ms	356 KB	Output is correct
41	Correct	2 ms	340 KB	Output is correct
42	Correct	3 ms	340 KB	Output is correct
43	Correct	2 ms	340 KB	Output is correct
44	Correct	3 ms	340 KB	Output is correct
45	Correct	3 ms	340 KB	Output is correct
46	Correct	2 ms	340 KB	Output is correct
47	Correct	2 ms	340 KB	Output is correct
48	Correct	2 ms	360 KB	Output is correct
49	Correct	2 ms	340 KB	Output is correct
50	Correct	1 ms	352 KB	Output is correct
51	Correct	2 ms	360 KB	Output is correct
52	Correct	2 ms	340 KB	Output is correct
53	Correct	151 ms	532 KB	Output is correct
54	Correct	270 ms	588 KB	Output is correct
55	Correct	187 ms	640 KB	Output is correct
56	Correct	145 ms	596 KB	Output is correct
57	Correct	198 ms	672 KB	Output is correct
58	Correct	1 ms	340 KB	Output is correct
59	Correct	3 ms	356 KB	Output is correct
60	Correct	2 ms	468 KB	Output is correct
61	Correct	2 ms	340 KB	Output is correct
62	Correct	2 ms	364 KB	Output is correct
63	Correct	0 ms	340 KB	Output is correct
64	Correct	254 ms	468 KB	Output is correct
65	Correct	237 ms	568 KB	Output is correct
66	Correct	135 ms	596 KB	Output is correct
67	Correct	163 ms	596 KB	Output is correct
68	Correct	137 ms	596 KB	Output is correct

Subtask #5
0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	24 ms	7888 KB	Execution killed with signal 11
2	Halted	0 ms	0 KB	-

Subtask #6
0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	24 ms	7888 KB	Execution killed with signal 11
2	Halted	0 ms	0 KB	-

Subtask #7
0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	223 ms	668 KB	Output is correct
3	Correct	242 ms	680 KB	Output is correct
4	Correct	164 ms	696 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	2 ms	340 KB	Output is correct
7	Correct	2 ms	340 KB	Output is correct
8	Correct	140 ms	632 KB	Output is correct
9	Correct	212 ms	596 KB	Output is correct
10	Correct	2 ms	340 KB	Output is correct
11	Correct	2 ms	340 KB	Output is correct
12	Runtime error	19 ms	4904 KB	Execution killed with signal 11
13	Halted	0 ms	0 KB	-

답안 #596404

Compilation message

Subtask #1 0 / 5.0

Subtask #2 0 / 7.0

Subtask #3 14.0 / 14.0

Subtask #4 10.0 / 10.0

Subtask #5 0 / 17.0

Subtask #6 0 / 25.0

Subtask #7 0 / 22.0

Subtask #1
0 / 5.0

Subtask #2
0 / 7.0

Subtask #3
14.0 / 14.0

Subtask #4
10.0 / 10.0

Subtask #5
0 / 17.0

Subtask #6
0 / 25.0

Subtask #7
0 / 22.0