oj.uz

Submission #104541

# Submission time Handle Problem Language Result Execution time Memory
104541 2019-04-07T18:04:47 Z nikolapesic2802 Mergers (JOI19_mergers) C++14
24 / 100
 211 ms 27412 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]);
    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 18 ms 17920 KB Output is correct
2 Correct 18 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 18 ms 17912 KB Output is correct
7 Correct 19 ms 17920 KB Output is correct
8 Correct 20 ms 18048 KB Output is correct
9 Correct 19 ms 17920 KB Output is correct
10 Correct 19 ms 17920 KB Output is correct
11 Correct 20 ms 17920 KB Output is correct
12 Correct 19 ms 17920 KB Output is correct
13 Correct 18 ms 17912 KB Output is correct
14 Correct 18 ms 17920 KB Output is correct
15 Correct 20 ms 17920 KB Output is correct
16 Correct 21 ms 18048 KB Output is correct
17 Correct 20 ms 17920 KB Output is correct
18 Correct 20 ms 18048 KB Output is correct
19 Correct 18 ms 17920 KB Output is correct
20 Correct 20 ms 17920 KB Output is correct
21 Correct 19 ms 17920 KB Output is correct
22 Correct 22 ms 17920 KB Output is correct
23 Correct 18 ms 17920 KB Output is correct
24 Correct 21 ms 17912 KB Output is correct

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 17920 KB Output is correct
2 Correct 18 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 18 ms 17912 KB Output is correct
7 Correct 19 ms 17920 KB Output is correct
8 Correct 20 ms 18048 KB Output is correct
9 Correct 19 ms 17920 KB Output is correct
10 Correct 19 ms 17920 KB Output is correct
11 Correct 20 ms 17920 KB Output is correct
12 Correct 19 ms 17920 KB Output is correct
13 Correct 18 ms 17912 KB Output is correct
14 Correct 18 ms 17920 KB Output is correct
15 Correct 20 ms 17920 KB Output is correct
16 Correct 21 ms 18048 KB Output is correct
17 Correct 20 ms 17920 KB Output is correct
18 Correct 20 ms 18048 KB Output is correct
19 Correct 18 ms 17920 KB Output is correct
20 Correct 20 ms 17920 KB Output is correct
21 Correct 19 ms 17920 KB Output is correct
22 Correct 22 ms 17920 KB Output is correct
23 Correct 18 ms 17920 KB Output is correct
24 Correct 21 ms 17912 KB Output is correct
25 Correct 18 ms 18040 KB Output is correct
26 Correct 23 ms 18176 KB Output is correct
27 Correct 20 ms 18048 KB Output is correct
28 Correct 20 ms 18304 KB Output is correct
29 Correct 23 ms 18176 KB Output is correct
30 Correct 20 ms 18176 KB Output is correct
31 Correct 19 ms 17920 KB Output is correct
32 Correct 19 ms 18304 KB Output is correct
33 Correct 17 ms 17920 KB Output is correct
34 Correct 18 ms 18048 KB Output is correct
35 Correct 19 ms 18176 KB Output is correct
36 Correct 19 ms 18048 KB Output is correct
37 Correct 20 ms 18168 KB Output is correct
38 Correct 17 ms 17920 KB Output is correct
39 Correct 24 ms 18168 KB Output is correct
40 Correct 24 ms 18020 KB Output is correct
41 Correct 22 ms 18048 KB Output is correct
42 Correct 21 ms 18176 KB Output is correct
43 Correct 20 ms 18176 KB Output is correct
44 Correct 19 ms 17920 KB Output is correct
45 Correct 21 ms 18176 KB Output is correct
46 Correct 25 ms 18176 KB Output is correct
47 Correct 20 ms 17920 KB Output is correct
48 Incorrect 20 ms 18148 KB Output isn't correct
49 Halted 0 ms 0 KB -

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 17920 KB Output is correct
2 Correct 18 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 18 ms 17912 KB Output is correct
7 Correct 19 ms 17920 KB Output is correct
8 Correct 20 ms 18048 KB Output is correct
9 Correct 19 ms 17920 KB Output is correct
10 Correct 19 ms 17920 KB Output is correct
11 Correct 20 ms 17920 KB Output is correct
12 Correct 19 ms 17920 KB Output is correct
13 Correct 18 ms 17912 KB Output is correct
14 Correct 18 ms 17920 KB Output is correct
15 Correct 20 ms 17920 KB Output is correct
16 Correct 21 ms 18048 KB Output is correct
17 Correct 20 ms 17920 KB Output is correct
18 Correct 20 ms 18048 KB Output is correct
19 Correct 18 ms 17920 KB Output is correct
20 Correct 20 ms 17920 KB Output is correct
21 Correct 19 ms 17920 KB Output is correct
22 Correct 22 ms 17920 KB Output is correct
23 Correct 18 ms 17920 KB Output is correct
24 Correct 21 ms 17912 KB Output is correct
25 Correct 19 ms 17920 KB Output is correct
26 Correct 74 ms 22468 KB Output is correct
27 Correct 115 ms 22128 KB Output is correct
28 Correct 20 ms 18048 KB Output is correct
29 Correct 19 ms 17920 KB Output is correct
30 Correct 19 ms 18048 KB Output is correct
31 Correct 115 ms 22092 KB Output is correct
32 Correct 20 ms 18176 KB Output is correct
33 Correct 139 ms 26360 KB Output is correct
34 Correct 120 ms 22136 KB Output is correct
35 Correct 20 ms 18048 KB Output is correct
36 Correct 133 ms 22520 KB Output is correct
37 Correct 21 ms 18048 KB Output is correct
38 Correct 21 ms 18048 KB Output is correct
39 Correct 115 ms 22512 KB Output is correct
40 Correct 20 ms 18176 KB Output is correct
41 Correct 123 ms 22316 KB Output is correct
42 Correct 143 ms 23544 KB Output is correct
43 Correct 19 ms 17920 KB Output is correct
44 Correct 131 ms 26612 KB Output is correct
45 Correct 139 ms 24284 KB Output is correct
46 Correct 20 ms 18176 KB Output is correct
47 Correct 21 ms 18048 KB Output is correct

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 22468 KB Output is correct
2 Correct 144 ms 27412 KB Output is correct
3 Correct 24 ms 18168 KB Output is correct
4 Correct 27 ms 18048 KB Output is correct
5 Correct 22 ms 17912 KB Output is correct
6 Correct 19 ms 17920 KB Output is correct
7 Correct 22 ms 18176 KB Output is correct
8 Correct 168 ms 24316 KB Output is correct
9 Correct 21 ms 18048 KB Output is correct
10 Correct 127 ms 22136 KB Output is correct
11 Correct 18 ms 17920 KB Output is correct
12 Correct 169 ms 22096 KB Output is correct
13 Incorrect 211 ms 24184 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 17920 KB Output is correct
2 Correct 18 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 18 ms 17912 KB Output is correct
7 Correct 19 ms 17920 KB Output is correct
8 Correct 20 ms 18048 KB Output is correct
9 Correct 19 ms 17920 KB Output is correct
10 Correct 19 ms 17920 KB Output is correct
11 Correct 20 ms 17920 KB Output is correct
12 Correct 19 ms 17920 KB Output is correct
13 Correct 18 ms 17912 KB Output is correct
14 Correct 18 ms 17920 KB Output is correct
15 Correct 20 ms 17920 KB Output is correct
16 Correct 21 ms 18048 KB Output is correct
17 Correct 20 ms 17920 KB Output is correct
18 Correct 20 ms 18048 KB Output is correct
19 Correct 18 ms 17920 KB Output is correct
20 Correct 20 ms 17920 KB Output is correct
21 Correct 19 ms 17920 KB Output is correct
22 Correct 22 ms 17920 KB Output is correct
23 Correct 18 ms 17920 KB Output is correct
24 Correct 21 ms 17912 KB Output is correct
25 Correct 18 ms 18040 KB Output is correct
26 Correct 23 ms 18176 KB Output is correct
27 Correct 20 ms 18048 KB Output is correct
28 Correct 20 ms 18304 KB Output is correct
29 Correct 23 ms 18176 KB Output is correct
30 Correct 20 ms 18176 KB Output is correct
31 Correct 19 ms 17920 KB Output is correct
32 Correct 19 ms 18304 KB Output is correct
33 Correct 17 ms 17920 KB Output is correct
34 Correct 18 ms 18048 KB Output is correct
35 Correct 19 ms 18176 KB Output is correct
36 Correct 19 ms 18048 KB Output is correct
37 Correct 20 ms 18168 KB Output is correct
38 Correct 17 ms 17920 KB Output is correct
39 Correct 24 ms 18168 KB Output is correct
40 Correct 24 ms 18020 KB Output is correct
41 Correct 22 ms 18048 KB Output is correct
42 Correct 21 ms 18176 KB Output is correct
43 Correct 20 ms 18176 KB Output is correct
44 Correct 19 ms 17920 KB Output is correct
45 Correct 21 ms 18176 KB Output is correct
46 Correct 25 ms 18176 KB Output is correct
47 Correct 20 ms 17920 KB Output is correct
48 Incorrect 20 ms 18148 KB Output isn't correct
49 Halted 0 ms 0 KB -