oj.uz

Submission #104540

# Submission time Handle Problem Language Result Execution time Memory
104540 2019-04-07T18:03:22 Z nikolapesic2802 Mergers (JOI19_mergers) C++14
100 / 100
 1074 ms 79096 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>

#define ll long long
#define pb push_back
#define sz(x) (int)(x).size()
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define D(x) cerr << #x << " is " << (x) << "\n";

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>; ///find_by_order(),order_of_key()
template<class T1, class T2> ostream& operator<<(ostream& os, const pair<T1,T2>& a) { os << '{' << a.f << ", " << a.s << '}'; return os; }
template<class T> ostream& operator<<(ostream& os, const vector<T>& a){os << '{';for(int i=0;i<sz(a);i++){if(i>0&&i<sz(a))os << ", ";os << a[i];}os<<'}';return os;}
template<class T> ostream& operator<<(ostream& os, const set<T>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T> ostream& operator<<(ostream& os, const multiset<T>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T1,class T2> ostream& operator<<(ostream& os, const map<T1,T2>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}

const int N=5e5+5;
struct dsu{
    vector<int> par;
    void init()
    {
        par.resize(N);
        for(int i=0;i<N;i++)
            par[i]=i;
    }
    int find(int tr)
    {
        if(par[tr]==tr)
            return tr;
        return par[tr]=find(par[tr]);
    }
    void merge(int a,int b)
    {
        a=find(a);
        b=find(b);
        if(a==b)
            return;
        par[b]=a;
    }
}d;
vector<int> up(N),depth(N);
vector<vector<int> > graf(N);
void setup(int tr)
{
    for(auto p:graf[tr])
    {
        if(p==up[tr])
            continue;
        depth[p]=depth[tr]+1;
        up[p]=tr;
        setup(p);
    }
}
void merge(int a,int b)
{
    a=d.find(a);b=d.find(b);
    while(a!=b)
    {
        if(depth[a]<depth[b])
            swap(a,b);
        d.merge(up[a],a);
        a=d.find(up[a]);
    }
    /*while(d.find(a)!=d.find(b))
    {
        if(depth[a]<depth[b])
            swap(a,b);
        d.merge(a,b);
        a=up[a];
    }*/
}
int main()
{
    d.init();
    int n,k;
    scanf("%i %i",&n,&k);
    for(int i=1;i<n;i++)
    {
        int a,b;
        scanf("%i %i",&a,&b);
        a--;
        b--;
        graf[a].pb(b);
        graf[b].pb(a);
    }
    setup(0);
    vector<vector<int> > group(k);
    for(int i=0;i<n;i++)
    {
        int a;
        scanf("%i",&a);
        a--;
        group[a].pb(i);
    }
    for(int i=0;i<k;i++)
        for(int j=1;j<group[i].size();j++)
            merge(group[i][0],group[i][j]);

    vector<int> deg(n);
    for(int i=0;i<n;i++)
        for(auto p:graf[i])
            if(d.find(i)!=d.find(p))
                deg[d.find(i)]++;
    int sol=0;
    for(int i=0;i<n;i++)
        if(deg[i]==1)
            sol++;
    printf("%i\n",(sol+1)/2);
    return 0;
}

Compilation message

mergers.cpp: In function 'int main()':
mergers.cpp:106:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j=1;j<group[i].size();j++)
                     ~^~~~~~~~~~~~~~~~
mergers.cpp:86:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%i %i",&n,&k);
     ~~~~~^~~~~~~~~~~~~~~
mergers.cpp:90:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%i %i",&a,&b);
         ~~~~~^~~~~~~~~~~~~~~
mergers.cpp:101:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%i",&a);
         ~~~~~^~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 17920 KB Output is correct
2 Correct 19 ms 17920 KB Output is correct
3 Correct 18 ms 17920 KB Output is correct
4 Correct 18 ms 17920 KB Output is correct
5 Correct 19 ms 17920 KB Output is correct
6 Correct 19 ms 18040 KB Output is correct
7 Correct 20 ms 18020 KB Output is correct
8 Correct 17 ms 17920 KB Output is correct
9 Correct 19 ms 17920 KB Output is correct
10 Correct 18 ms 17920 KB Output is correct
11 Correct 19 ms 17920 KB Output is correct
12 Correct 19 ms 17920 KB Output is correct
13 Correct 19 ms 17920 KB Output is correct
14 Correct 22 ms 17920 KB Output is correct
15 Correct 20 ms 17920 KB Output is correct
16 Correct 19 ms 17920 KB Output is correct
17 Correct 20 ms 17920 KB Output is correct
18 Correct 19 ms 17968 KB Output is correct
19 Correct 21 ms 17920 KB Output is correct
20 Correct 20 ms 17920 KB Output is correct
21 Correct 36 ms 18048 KB Output is correct
22 Correct 18 ms 17920 KB Output is correct
23 Correct 18 ms 17920 KB Output is correct
24 Correct 18 ms 17920 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 17920 KB Output is correct
2 Correct 19 ms 17920 KB Output is correct
3 Correct 18 ms 17920 KB Output is correct
4 Correct 18 ms 17920 KB Output is correct
5 Correct 19 ms 17920 KB Output is correct
6 Correct 19 ms 18040 KB Output is correct
7 Correct 20 ms 18020 KB Output is correct
8 Correct 17 ms 17920 KB Output is correct
9 Correct 19 ms 17920 KB Output is correct
10 Correct 18 ms 17920 KB Output is correct
11 Correct 19 ms 17920 KB Output is correct
12 Correct 19 ms 17920 KB Output is correct
13 Correct 19 ms 17920 KB Output is correct
14 Correct 22 ms 17920 KB Output is correct
15 Correct 20 ms 17920 KB Output is correct
16 Correct 19 ms 17920 KB Output is correct
17 Correct 20 ms 17920 KB Output is correct
18 Correct 19 ms 17968 KB Output is correct
19 Correct 21 ms 17920 KB Output is correct
20 Correct 20 ms 17920 KB Output is correct
21 Correct 36 ms 18048 KB Output is correct
22 Correct 18 ms 17920 KB Output is correct
23 Correct 18 ms 17920 KB Output is correct
24 Correct 18 ms 17920 KB Output is correct
25 Correct 21 ms 17920 KB Output is correct
26 Correct 23 ms 18176 KB Output is correct
27 Correct 19 ms 18176 KB Output is correct
28 Correct 20 ms 18304 KB Output is correct
29 Correct 22 ms 18332 KB Output is correct
30 Correct 25 ms 18168 KB Output is correct
31 Correct 21 ms 17956 KB Output is correct
32 Correct 20 ms 18432 KB Output is correct
33 Correct 17 ms 17920 KB Output is correct
34 Correct 19 ms 18176 KB Output is correct
35 Correct 20 ms 18304 KB Output is correct
36 Correct 22 ms 18048 KB Output is correct
37 Correct 25 ms 18176 KB Output is correct
38 Correct 17 ms 18048 KB Output is correct
39 Correct 19 ms 18176 KB Output is correct
40 Correct 24 ms 18176 KB Output is correct
41 Correct 20 ms 18176 KB Output is correct
42 Correct 19 ms 18176 KB Output is correct
43 Correct 20 ms 18304 KB Output is correct
44 Correct 18 ms 17916 KB Output is correct
45 Correct 22 ms 18304 KB Output is correct
46 Correct 22 ms 18176 KB Output is correct
47 Correct 19 ms 18048 KB Output is correct
48 Correct 24 ms 18176 KB Output is correct
49 Correct 21 ms 18304 KB Output is correct
50 Correct 25 ms 18304 KB Output is correct
51 Correct 22 ms 18176 KB Output is correct
52 Correct 26 ms 18176 KB Output is correct
53 Correct 21 ms 18176 KB Output is correct
54 Correct 23 ms 18176 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 17920 KB Output is correct
2 Correct 19 ms 17920 KB Output is correct
3 Correct 18 ms 17920 KB Output is correct
4 Correct 18 ms 17920 KB Output is correct
5 Correct 19 ms 17920 KB Output is correct
6 Correct 19 ms 18040 KB Output is correct
7 Correct 20 ms 18020 KB Output is correct
8 Correct 17 ms 17920 KB Output is correct
9 Correct 19 ms 17920 KB Output is correct
10 Correct 18 ms 17920 KB Output is correct
11 Correct 19 ms 17920 KB Output is correct
12 Correct 19 ms 17920 KB Output is correct
13 Correct 19 ms 17920 KB Output is correct
14 Correct 22 ms 17920 KB Output is correct
15 Correct 20 ms 17920 KB Output is correct
16 Correct 19 ms 17920 KB Output is correct
17 Correct 20 ms 17920 KB Output is correct
18 Correct 19 ms 17968 KB Output is correct
19 Correct 21 ms 17920 KB Output is correct
20 Correct 20 ms 17920 KB Output is correct
21 Correct 36 ms 18048 KB Output is correct
22 Correct 18 ms 17920 KB Output is correct
23 Correct 18 ms 17920 KB Output is correct
24 Correct 18 ms 17920 KB Output is correct
25 Correct 20 ms 17920 KB Output is correct
26 Correct 110 ms 23844 KB Output is correct
27 Correct 117 ms 23544 KB Output is correct
28 Correct 25 ms 18048 KB Output is correct
29 Correct 22 ms 18048 KB Output is correct
30 Correct 18 ms 17920 KB Output is correct
31 Correct 128 ms 23388 KB Output is correct
32 Correct 21 ms 18176 KB Output is correct
33 Correct 139 ms 27768 KB Output is correct
34 Correct 111 ms 23528 KB Output is correct
35 Correct 21 ms 18168 KB Output is correct
36 Correct 132 ms 23820 KB Output is correct
37 Correct 22 ms 18176 KB Output is correct
38 Correct 20 ms 18176 KB Output is correct
39 Correct 95 ms 23792 KB Output is correct
40 Correct 21 ms 18304 KB Output is correct
41 Correct 111 ms 23412 KB Output is correct
42 Correct 137 ms 24952 KB Output is correct
43 Correct 19 ms 18048 KB Output is correct
44 Correct 150 ms 27892 KB Output is correct
45 Correct 139 ms 25720 KB Output is correct
46 Correct 20 ms 18172 KB Output is correct
47 Correct 23 ms 18076 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 22412 KB Output is correct
2 Correct 115 ms 27376 KB Output is correct
3 Correct 21 ms 18176 KB Output is correct
4 Correct 21 ms 18048 KB Output is correct
5 Correct 18 ms 17920 KB Output is correct
6 Correct 20 ms 17920 KB Output is correct
7 Correct 24 ms 18168 KB Output is correct
8 Correct 160 ms 26076 KB Output is correct
9 Correct 22 ms 18176 KB Output is correct
10 Correct 132 ms 23772 KB Output is correct
11 Correct 20 ms 18048 KB Output is correct
12 Correct 173 ms 23572 KB Output is correct
13 Correct 161 ms 25980 KB Output is correct
14 Correct 155 ms 28792 KB Output is correct
15 Correct 93 ms 23728 KB Output is correct
16 Correct 25 ms 18176 KB Output is correct
17 Correct 19 ms 17920 KB Output is correct
18 Correct 114 ms 28560 KB Output is correct
19 Correct 158 ms 31096 KB Output is correct
20 Correct 20 ms 18176 KB Output is correct
21 Correct 18 ms 17920 KB Output is correct
22 Correct 109 ms 26316 KB Output is correct
23 Correct 21 ms 18176 KB Output is correct
24 Correct 140 ms 24440 KB Output is correct
25 Correct 169 ms 30328 KB Output is correct
26 Correct 21 ms 18300 KB Output is correct
27 Correct 21 ms 18304 KB Output is correct
28 Correct 23 ms 18176 KB Output is correct
29 Correct 23 ms 18176 KB Output is correct
30 Correct 20 ms 18168 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 17920 KB Output is correct
2 Correct 19 ms 17920 KB Output is correct
3 Correct 18 ms 17920 KB Output is correct
4 Correct 18 ms 17920 KB Output is correct
5 Correct 19 ms 17920 KB Output is correct
6 Correct 19 ms 18040 KB Output is correct
7 Correct 20 ms 18020 KB Output is correct
8 Correct 17 ms 17920 KB Output is correct
9 Correct 19 ms 17920 KB Output is correct
10 Correct 18 ms 17920 KB Output is correct
11 Correct 19 ms 17920 KB Output is correct
12 Correct 19 ms 17920 KB Output is correct
13 Correct 19 ms 17920 KB Output is correct
14 Correct 22 ms 17920 KB Output is correct
15 Correct 20 ms 17920 KB Output is correct
16 Correct 19 ms 17920 KB Output is correct
17 Correct 20 ms 17920 KB Output is correct
18 Correct 19 ms 17968 KB Output is correct
19 Correct 21 ms 17920 KB Output is correct
20 Correct 20 ms 17920 KB Output is correct
21 Correct 36 ms 18048 KB Output is correct
22 Correct 18 ms 17920 KB Output is correct
23 Correct 18 ms 17920 KB Output is correct
24 Correct 18 ms 17920 KB Output is correct
25 Correct 21 ms 17920 KB Output is correct
26 Correct 23 ms 18176 KB Output is correct
27 Correct 19 ms 18176 KB Output is correct
28 Correct 20 ms 18304 KB Output is correct
29 Correct 22 ms 18332 KB Output is correct
30 Correct 25 ms 18168 KB Output is correct
31 Correct 21 ms 17956 KB Output is correct
32 Correct 20 ms 18432 KB Output is correct
33 Correct 17 ms 17920 KB Output is correct
34 Correct 19 ms 18176 KB Output is correct
35 Correct 20 ms 18304 KB Output is correct
36 Correct 22 ms 18048 KB Output is correct
37 Correct 25 ms 18176 KB Output is correct
38 Correct 17 ms 18048 KB Output is correct
39 Correct 19 ms 18176 KB Output is correct
40 Correct 24 ms 18176 KB Output is correct
41 Correct 20 ms 18176 KB Output is correct
42 Correct 19 ms 18176 KB Output is correct
43 Correct 20 ms 18304 KB Output is correct
44 Correct 18 ms 17916 KB Output is correct
45 Correct 22 ms 18304 KB Output is correct
46 Correct 22 ms 18176 KB Output is correct
47 Correct 19 ms 18048 KB Output is correct
48 Correct 24 ms 18176 KB Output is correct
49 Correct 21 ms 18304 KB Output is correct
50 Correct 25 ms 18304 KB Output is correct
51 Correct 22 ms 18176 KB Output is correct
52 Correct 26 ms 18176 KB Output is correct
53 Correct 21 ms 18176 KB Output is correct
54 Correct 23 ms 18176 KB Output is correct
55 Correct 20 ms 17920 KB Output is correct
56 Correct 110 ms 23844 KB Output is correct
57 Correct 117 ms 23544 KB Output is correct
58 Correct 25 ms 18048 KB Output is correct
59 Correct 22 ms 18048 KB Output is correct
60 Correct 18 ms 17920 KB Output is correct
61 Correct 128 ms 23388 KB Output is correct
62 Correct 21 ms 18176 KB Output is correct
63 Correct 139 ms 27768 KB Output is correct
64 Correct 111 ms 23528 KB Output is correct
65 Correct 21 ms 18168 KB Output is correct
66 Correct 132 ms 23820 KB Output is correct
67 Correct 22 ms 18176 KB Output is correct
68 Correct 20 ms 18176 KB Output is correct
69 Correct 95 ms 23792 KB Output is correct
70 Correct 21 ms 18304 KB Output is correct
71 Correct 111 ms 23412 KB Output is correct
72 Correct 137 ms 24952 KB Output is correct
73 Correct 19 ms 18048 KB Output is correct
74 Correct 150 ms 27892 KB Output is correct
75 Correct 139 ms 25720 KB Output is correct
76 Correct 20 ms 18172 KB Output is correct
77 Correct 23 ms 18076 KB Output is correct
78 Correct 94 ms 22412 KB Output is correct
79 Correct 115 ms 27376 KB Output is correct
80 Correct 21 ms 18176 KB Output is correct
81 Correct 21 ms 18048 KB Output is correct
82 Correct 18 ms 17920 KB Output is correct
83 Correct 20 ms 17920 KB Output is correct
84 Correct 24 ms 18168 KB Output is correct
85 Correct 160 ms 26076 KB Output is correct
86 Correct 22 ms 18176 KB Output is correct
87 Correct 132 ms 23772 KB Output is correct
88 Correct 20 ms 18048 KB Output is correct
89 Correct 173 ms 23572 KB Output is correct
90 Correct 161 ms 25980 KB Output is correct
91 Correct 155 ms 28792 KB Output is correct
92 Correct 93 ms 23728 KB Output is correct
93 Correct 25 ms 18176 KB Output is correct
94 Correct 19 ms 17920 KB Output is correct
95 Correct 114 ms 28560 KB Output is correct
96 Correct 158 ms 31096 KB Output is correct
97 Correct 20 ms 18176 KB Output is correct
98 Correct 18 ms 17920 KB Output is correct
99 Correct 109 ms 26316 KB Output is correct
100 Correct 21 ms 18176 KB Output is correct
101 Correct 140 ms 24440 KB Output is correct
102 Correct 169 ms 30328 KB Output is correct
103 Correct 21 ms 18300 KB Output is correct
104 Correct 21 ms 18304 KB Output is correct
105 Correct 23 ms 18176 KB Output is correct
106 Correct 23 ms 18176 KB Output is correct
107 Correct 20 ms 18168 KB Output is correct
108 Correct 667 ms 50720 KB Output is correct
109 Correct 922 ms 50920 KB Output is correct
110 Correct 946 ms 57448 KB Output is correct
111 Correct 1020 ms 79096 KB Output is correct
112 Correct 1074 ms 73208 KB Output is correct
113 Correct 721 ms 64096 KB Output is correct
114 Correct 771 ms 40420 KB Output is correct
115 Correct 760 ms 40184 KB Output is correct
116 Correct 957 ms 45444 KB Output is correct
117 Correct 875 ms 65528 KB Output is correct
118 Correct 815 ms 40820 KB Output is correct
119 Correct 953 ms 65596 KB Output is correct
120 Correct 930 ms 73592 KB Output is correct
121 Correct 834 ms 65588 KB Output is correct
122 Correct 942 ms 54648 KB Output is correct
123 Correct 627 ms 66964 KB Output is correct
124 Correct 982 ms 64212 KB Output is correct