oj.uz

Submission #1046953

# Submission time Handle Problem Language Result Execution time Memory
1046953 2024-08-07T06:50:05 Z isaachew Mergers (JOI19_mergers) C++17
100 / 100
 501 ms 136360 KB 
#include <bits/stdc++.h>
/*
 An edge is separable if the states on either side are disjoint
 "Unify" an entire path between edges
 Every city is a unique state -> min number of paths to cover induced tree of separable edges
 Root at "centroid" (vertex that splits leaves into sections of less than half), get leaves -> solved
 STL and look at num. distinct values to see if separable
 */
std::vector<std::vector<int>> edges;
std::vector<int> states;
std::vector<int> stamounts;
std::vector<int> parents;
std::vector<int> separable;
int nleaves=0;
std::map<int,int>* dfs(int cur,int parent=0){
    std::map<int,int>* merge=new std::map<int,int>;
    (*merge)[states[cur]]++;
    if(stamounts[states[cur]]==1){
        merge->erase(states[cur]);
    }
    for(int i:edges[cur]){
        if(i==parent)continue;
        parents[i]=cur;
        std::map<int,int>* newm=dfs(i,cur);
        if(newm->size()>merge->size())std::swap(merge,newm);
        for(std::pair<int,int> j:*newm){
            (*merge)[j.first]+=j.second;
            if((*merge)[j.first]==stamounts[j.first])merge->erase(j.first);
        }
        delete newm;
    }
    if(merge->empty()){
        separable[cur]=1;
    }
    return merge;
}
int dfs2(int cur){
    int nhsep=0;
    for(int i:edges[cur]){
        if(i==parents[cur])continue;
        nhsep+=dfs2(i);
    }
    if(cur==0&&nhsep<=1){
        nleaves++;//if root is a leaf
    }else if(separable[cur]){
        if(!nhsep)nleaves++;
        nhsep=1;
    }
    
    return nhsep;
}
int main(){
    std::ios::sync_with_stdio(0);
    std::cin.tie(0);
    int n,k;
    std::cin>>n>>k;
    edges.resize(n);
    parents.resize(n);
    stamounts.resize(k);
    separable.resize(n);
    for(int i=1;i<n;i++){
        int a,b;
        std::cin>>a>>b;
        a--,b--;
        edges[a].push_back(b);
        edges[b].push_back(a);
    }
    for(int i=0;i<n;i++){
        int x;
        std::cin>>x;
        x--;
        states.push_back(x);
        stamounts[x]++;
    }
    std::map<int,int>* res=dfs(0);
    delete res;
    dfs2(0);
    std::cout<<(nleaves==1?0:(nleaves+1)/2)<<'\n';
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 600 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 420 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 600 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 420 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 2 ms 860 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 2 ms 604 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 1116 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 2 ms 604 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 0 ms 452 KB Output is correct
39 Correct 2 ms 556 KB Output is correct
40 Correct 1 ms 856 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 1 ms 604 KB Output is correct
43 Correct 1 ms 1372 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 2 ms 604 KB Output is correct
46 Correct 2 ms 860 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 1 ms 604 KB Output is correct
49 Correct 1 ms 604 KB Output is correct
50 Correct 1 ms 860 KB Output is correct
51 Correct 1 ms 604 KB Output is correct
52 Correct 1 ms 604 KB Output is correct
53 Correct 2 ms 600 KB Output is correct
54 Correct 2 ms 604 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 600 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 420 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 30 ms 9080 KB Output is correct
27 Correct 46 ms 8704 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 40 ms 8772 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 50 ms 31796 KB Output is correct
34 Correct 39 ms 8904 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 34 ms 11152 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 1 ms 604 KB Output is correct
39 Correct 25 ms 9000 KB Output is correct
40 Correct 2 ms 1372 KB Output is correct
41 Correct 29 ms 8772 KB Output is correct
42 Correct 38 ms 16084 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 52 ms 32688 KB Output is correct
45 Correct 40 ms 21708 KB Output is correct
46 Correct 1 ms 600 KB Output is correct
47 Correct 1 ms 604 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 7888 KB Output is correct
2 Correct 25 ms 8144 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 42 ms 9268 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 30 ms 8980 KB Output is correct
11 Correct 0 ms 604 KB Output is correct
12 Correct 41 ms 8712 KB Output is correct
13 Correct 43 ms 9180 KB Output is correct
14 Correct 32 ms 9384 KB Output is correct
15 Correct 25 ms 8916 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 30 ms 9968 KB Output is correct
19 Correct 48 ms 19656 KB Output is correct
20 Correct 2 ms 604 KB Output is correct
21 Correct 0 ms 460 KB Output is correct
22 Correct 48 ms 10064 KB Output is correct
23 Correct 2 ms 604 KB Output is correct
24 Correct 36 ms 8924 KB Output is correct
25 Correct 50 ms 16036 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 860 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 600 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 420 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 2 ms 860 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 2 ms 604 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 1116 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 2 ms 604 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 0 ms 452 KB Output is correct
39 Correct 2 ms 556 KB Output is correct
40 Correct 1 ms 856 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 1 ms 604 KB Output is correct
43 Correct 1 ms 1372 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 2 ms 604 KB Output is correct
46 Correct 2 ms 860 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 1 ms 604 KB Output is correct
49 Correct 1 ms 604 KB Output is correct
50 Correct 1 ms 860 KB Output is correct
51 Correct 1 ms 604 KB Output is correct
52 Correct 1 ms 604 KB Output is correct
53 Correct 2 ms 600 KB Output is correct
54 Correct 2 ms 604 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 30 ms 9080 KB Output is correct
57 Correct 46 ms 8704 KB Output is correct
58 Correct 1 ms 604 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 40 ms 8772 KB Output is correct
62 Correct 1 ms 604 KB Output is correct
63 Correct 50 ms 31796 KB Output is correct
64 Correct 39 ms 8904 KB Output is correct
65 Correct 1 ms 604 KB Output is correct
66 Correct 34 ms 11152 KB Output is correct
67 Correct 1 ms 604 KB Output is correct
68 Correct 1 ms 604 KB Output is correct
69 Correct 25 ms 9000 KB Output is correct
70 Correct 2 ms 1372 KB Output is correct
71 Correct 29 ms 8772 KB Output is correct
72 Correct 38 ms 16084 KB Output is correct
73 Correct 0 ms 348 KB Output is correct
74 Correct 52 ms 32688 KB Output is correct
75 Correct 40 ms 21708 KB Output is correct
76 Correct 1 ms 600 KB Output is correct
77 Correct 1 ms 604 KB Output is correct
78 Correct 26 ms 7888 KB Output is correct
79 Correct 25 ms 8144 KB Output is correct
80 Correct 1 ms 604 KB Output is correct
81 Correct 1 ms 604 KB Output is correct
82 Correct 0 ms 348 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 1 ms 604 KB Output is correct
85 Correct 42 ms 9268 KB Output is correct
86 Correct 1 ms 600 KB Output is correct
87 Correct 30 ms 8980 KB Output is correct
88 Correct 0 ms 604 KB Output is correct
89 Correct 41 ms 8712 KB Output is correct
90 Correct 43 ms 9180 KB Output is correct
91 Correct 32 ms 9384 KB Output is correct
92 Correct 25 ms 8916 KB Output is correct
93 Correct 1 ms 604 KB Output is correct
94 Correct 0 ms 348 KB Output is correct
95 Correct 30 ms 9968 KB Output is correct
96 Correct 48 ms 19656 KB Output is correct
97 Correct 2 ms 604 KB Output is correct
98 Correct 0 ms 460 KB Output is correct
99 Correct 48 ms 10064 KB Output is correct
100 Correct 2 ms 604 KB Output is correct
101 Correct 36 ms 8924 KB Output is correct
102 Correct 50 ms 16036 KB Output is correct
103 Correct 1 ms 604 KB Output is correct
104 Correct 1 ms 860 KB Output is correct
105 Correct 1 ms 604 KB Output is correct
106 Correct 2 ms 604 KB Output is correct
107 Correct 1 ms 604 KB Output is correct
108 Correct 311 ms 51244 KB Output is correct
109 Correct 385 ms 100652 KB Output is correct
110 Correct 365 ms 136360 KB Output is correct
111 Correct 393 ms 106948 KB Output is correct
112 Correct 328 ms 81344 KB Output is correct
113 Correct 222 ms 48584 KB Output is correct
114 Correct 209 ms 41920 KB Output is correct
115 Correct 293 ms 41928 KB Output is correct
116 Correct 409 ms 44956 KB Output is correct
117 Correct 242 ms 46296 KB Output is correct
118 Correct 224 ms 41928 KB Output is correct
119 Correct 286 ms 46276 KB Output is correct
120 Correct 333 ms 83160 KB Output is correct
121 Correct 281 ms 46272 KB Output is correct
122 Correct 501 ms 53740 KB Output is correct
123 Correct 203 ms 47592 KB Output is correct
124 Correct 260 ms 45652 KB Output is correct