oj.uz

Submission #104545

# Submission time Handle Problem Language Result Execution time Memory
104545 2019-04-07T18:09:44 Z nikolapesic2802 Mergers (JOI19_mergers) C++14
56 / 100
 3000 ms 29432 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,up[a]);
        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]);
    int sol=0;
    vector<int> deg(n);
    for(int i=0;i<n;i++)
        for(auto p:graf[i])
            if(d.find(i)!=d.find(p))
            {
                if(deg[d.find(i)]==0)
                    sol++;
                if(deg[d.find(i)]==1)
                    sol--;
                deg[d.find(i)]++;
            }
    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 19 ms 17920 KB Output is correct
2 Correct 19 ms 17920 KB Output is correct
3 Correct 19 ms 17920 KB Output is correct
4 Correct 18 ms 17920 KB Output is correct
5 Correct 20 ms 17920 KB Output is correct
6 Correct 22 ms 17900 KB Output is correct
7 Correct 18 ms 17920 KB Output is correct
8 Correct 18 ms 17920 KB Output is correct
9 Correct 17 ms 17920 KB Output is correct
10 Correct 18 ms 17920 KB Output is correct
11 Correct 17 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 18 ms 17920 KB Output is correct
15 Correct 18 ms 17920 KB Output is correct
16 Correct 19 ms 17920 KB Output is correct
17 Correct 19 ms 18008 KB Output is correct
18 Correct 41 ms 17912 KB Output is correct
19 Correct 23 ms 17920 KB Output is correct
20 Correct 21 ms 17920 KB Output is correct
21 Correct 20 ms 18048 KB Output is correct
22 Correct 19 ms 17920 KB Output is correct
23 Correct 20 ms 18048 KB Output is correct
24 Correct 19 ms 18048 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 17920 KB Output is correct
2 Correct 19 ms 17920 KB Output is correct
3 Correct 19 ms 17920 KB Output is correct
4 Correct 18 ms 17920 KB Output is correct
5 Correct 20 ms 17920 KB Output is correct
6 Correct 22 ms 17900 KB Output is correct
7 Correct 18 ms 17920 KB Output is correct
8 Correct 18 ms 17920 KB Output is correct
9 Correct 17 ms 17920 KB Output is correct
10 Correct 18 ms 17920 KB Output is correct
11 Correct 17 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 18 ms 17920 KB Output is correct
15 Correct 18 ms 17920 KB Output is correct
16 Correct 19 ms 17920 KB Output is correct
17 Correct 19 ms 18008 KB Output is correct
18 Correct 41 ms 17912 KB Output is correct
19 Correct 23 ms 17920 KB Output is correct
20 Correct 21 ms 17920 KB Output is correct
21 Correct 20 ms 18048 KB Output is correct
22 Correct 19 ms 17920 KB Output is correct
23 Correct 20 ms 18048 KB Output is correct
24 Correct 19 ms 18048 KB Output is correct
25 Correct 19 ms 17920 KB Output is correct
26 Correct 21 ms 18176 KB Output is correct
27 Correct 20 ms 18048 KB Output is correct
28 Correct 22 ms 18432 KB Output is correct
29 Correct 21 ms 18296 KB Output is correct
30 Correct 23 ms 18168 KB Output is correct
31 Correct 18 ms 17920 KB Output is correct
32 Correct 22 ms 18304 KB Output is correct
33 Correct 17 ms 17920 KB Output is correct
34 Correct 19 ms 18148 KB Output is correct
35 Correct 21 ms 18176 KB Output is correct
36 Correct 21 ms 18176 KB Output is correct
37 Correct 24 ms 18176 KB Output is correct
38 Correct 23 ms 17920 KB Output is correct
39 Correct 24 ms 18176 KB Output is correct
40 Correct 20 ms 18048 KB Output is correct
41 Correct 21 ms 18168 KB Output is correct
42 Correct 19 ms 18220 KB Output is correct
43 Correct 20 ms 18176 KB Output is correct
44 Correct 21 ms 17920 KB Output is correct
45 Correct 19 ms 18176 KB Output is correct
46 Correct 21 ms 18176 KB Output is correct
47 Correct 21 ms 17920 KB Output is correct
48 Correct 20 ms 18048 KB Output is correct
49 Correct 19 ms 18176 KB Output is correct
50 Correct 23 ms 18256 KB Output is correct
51 Correct 22 ms 18048 KB Output is correct
52 Correct 21 ms 18176 KB Output is correct
53 Correct 27 ms 18176 KB Output is correct
54 Correct 21 ms 18048 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 17920 KB Output is correct
2 Correct 19 ms 17920 KB Output is correct
3 Correct 19 ms 17920 KB Output is correct
4 Correct 18 ms 17920 KB Output is correct
5 Correct 20 ms 17920 KB Output is correct
6 Correct 22 ms 17900 KB Output is correct
7 Correct 18 ms 17920 KB Output is correct
8 Correct 18 ms 17920 KB Output is correct
9 Correct 17 ms 17920 KB Output is correct
10 Correct 18 ms 17920 KB Output is correct
11 Correct 17 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 18 ms 17920 KB Output is correct
15 Correct 18 ms 17920 KB Output is correct
16 Correct 19 ms 17920 KB Output is correct
17 Correct 19 ms 18008 KB Output is correct
18 Correct 41 ms 17912 KB Output is correct
19 Correct 23 ms 17920 KB Output is correct
20 Correct 21 ms 17920 KB Output is correct
21 Correct 20 ms 18048 KB Output is correct
22 Correct 19 ms 17920 KB Output is correct
23 Correct 20 ms 18048 KB Output is correct
24 Correct 19 ms 18048 KB Output is correct
25 Correct 19 ms 17920 KB Output is correct
26 Correct 87 ms 22384 KB Output is correct
27 Correct 178 ms 22136 KB Output is correct
28 Correct 21 ms 18048 KB Output is correct
29 Correct 19 ms 18048 KB Output is correct
30 Correct 19 ms 17920 KB Output is correct
31 Correct 133 ms 21980 KB Output is correct
32 Correct 22 ms 18048 KB Output is correct
33 Correct 177 ms 26340 KB Output is correct
34 Correct 155 ms 22264 KB Output is correct
35 Correct 25 ms 18048 KB Output is correct
36 Correct 143 ms 22392 KB Output is correct
37 Correct 20 ms 18048 KB Output is correct
38 Correct 24 ms 18048 KB Output is correct
39 Correct 98 ms 22648 KB Output is correct
40 Correct 20 ms 18176 KB Output is correct
41 Correct 126 ms 22132 KB Output is correct
42 Correct 125 ms 23416 KB Output is correct
43 Correct 20 ms 17920 KB Output is correct
44 Correct 134 ms 26584 KB Output is correct
45 Execution timed out 3041 ms 23928 KB Time limit exceeded
46 Halted 0 ms 0 KB -

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 22420 KB Output is correct
2 Correct 125 ms 27436 KB Output is correct
3 Correct 25 ms 18176 KB Output is correct
4 Correct 23 ms 18048 KB Output is correct
5 Correct 20 ms 17920 KB Output is correct
6 Correct 21 ms 17920 KB Output is correct
7 Correct 22 ms 18148 KB Output is correct
8 Correct 187 ms 24312 KB Output is correct
9 Correct 26 ms 18176 KB Output is correct
10 Correct 163 ms 22296 KB Output is correct
11 Correct 22 ms 17920 KB Output is correct
12 Correct 160 ms 22136 KB Output is correct
13 Correct 187 ms 24388 KB Output is correct
14 Correct 148 ms 27128 KB Output is correct
15 Correct 102 ms 22636 KB Output is correct
16 Correct 20 ms 18176 KB Output is correct
17 Correct 23 ms 18048 KB Output is correct
18 Correct 127 ms 26856 KB Output is correct
19 Correct 160 ms 29432 KB Output is correct
20 Correct 31 ms 18200 KB Output is correct
21 Correct 19 ms 17920 KB Output is correct
22 Correct 112 ms 25072 KB Output is correct
23 Correct 23 ms 18048 KB Output is correct
24 Correct 168 ms 22640 KB Output is correct
25 Correct 163 ms 28664 KB Output is correct
26 Correct 24 ms 18176 KB Output is correct
27 Correct 23 ms 18304 KB Output is correct
28 Correct 24 ms 18088 KB Output is correct
29 Correct 21 ms 18048 KB Output is correct
30 Correct 22 ms 18176 KB Output is correct

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 17920 KB Output is correct
2 Correct 19 ms 17920 KB Output is correct
3 Correct 19 ms 17920 KB Output is correct
4 Correct 18 ms 17920 KB Output is correct
5 Correct 20 ms 17920 KB Output is correct
6 Correct 22 ms 17900 KB Output is correct
7 Correct 18 ms 17920 KB Output is correct
8 Correct 18 ms 17920 KB Output is correct
9 Correct 17 ms 17920 KB Output is correct
10 Correct 18 ms 17920 KB Output is correct
11 Correct 17 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 18 ms 17920 KB Output is correct
15 Correct 18 ms 17920 KB Output is correct
16 Correct 19 ms 17920 KB Output is correct
17 Correct 19 ms 18008 KB Output is correct
18 Correct 41 ms 17912 KB Output is correct
19 Correct 23 ms 17920 KB Output is correct
20 Correct 21 ms 17920 KB Output is correct
21 Correct 20 ms 18048 KB Output is correct
22 Correct 19 ms 17920 KB Output is correct
23 Correct 20 ms 18048 KB Output is correct
24 Correct 19 ms 18048 KB Output is correct
25 Correct 19 ms 17920 KB Output is correct
26 Correct 21 ms 18176 KB Output is correct
27 Correct 20 ms 18048 KB Output is correct
28 Correct 22 ms 18432 KB Output is correct
29 Correct 21 ms 18296 KB Output is correct
30 Correct 23 ms 18168 KB Output is correct
31 Correct 18 ms 17920 KB Output is correct
32 Correct 22 ms 18304 KB Output is correct
33 Correct 17 ms 17920 KB Output is correct
34 Correct 19 ms 18148 KB Output is correct
35 Correct 21 ms 18176 KB Output is correct
36 Correct 21 ms 18176 KB Output is correct
37 Correct 24 ms 18176 KB Output is correct
38 Correct 23 ms 17920 KB Output is correct
39 Correct 24 ms 18176 KB Output is correct
40 Correct 20 ms 18048 KB Output is correct
41 Correct 21 ms 18168 KB Output is correct
42 Correct 19 ms 18220 KB Output is correct
43 Correct 20 ms 18176 KB Output is correct
44 Correct 21 ms 17920 KB Output is correct
45 Correct 19 ms 18176 KB Output is correct
46 Correct 21 ms 18176 KB Output is correct
47 Correct 21 ms 17920 KB Output is correct
48 Correct 20 ms 18048 KB Output is correct
49 Correct 19 ms 18176 KB Output is correct
50 Correct 23 ms 18256 KB Output is correct
51 Correct 22 ms 18048 KB Output is correct
52 Correct 21 ms 18176 KB Output is correct
53 Correct 27 ms 18176 KB Output is correct
54 Correct 21 ms 18048 KB Output is correct
55 Correct 19 ms 17920 KB Output is correct
56 Correct 87 ms 22384 KB Output is correct
57 Correct 178 ms 22136 KB Output is correct
58 Correct 21 ms 18048 KB Output is correct
59 Correct 19 ms 18048 KB Output is correct
60 Correct 19 ms 17920 KB Output is correct
61 Correct 133 ms 21980 KB Output is correct
62 Correct 22 ms 18048 KB Output is correct
63 Correct 177 ms 26340 KB Output is correct
64 Correct 155 ms 22264 KB Output is correct
65 Correct 25 ms 18048 KB Output is correct
66 Correct 143 ms 22392 KB Output is correct
67 Correct 20 ms 18048 KB Output is correct
68 Correct 24 ms 18048 KB Output is correct
69 Correct 98 ms 22648 KB Output is correct
70 Correct 20 ms 18176 KB Output is correct
71 Correct 126 ms 22132 KB Output is correct
72 Correct 125 ms 23416 KB Output is correct
73 Correct 20 ms 17920 KB Output is correct
74 Correct 134 ms 26584 KB Output is correct
75 Execution timed out 3041 ms 23928 KB Time limit exceeded
76 Halted 0 ms 0 KB -