oj.uz

Submission #945566

# Submission time Handle Problem Language Result Execution time Memory
945566 2024-03-14T04:46:36 Z berr Spring cleaning (CEOI20_cleaning) C++17
100 / 100
 101 ms 25956 KB 
#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
 
const int N=2e5;
vector<vector<int>> g(N);  
vector<int> tin(N), c(N), tout(N);
int leafs;
struct LCA {                                                
        int root, n, cnt;
 
        vector<array<int, 21>> par;
        vector<int>  d;
 
        LCA(int _n, int r){ 
            n = _n;
            par.resize(n);
            d.assign(n, 0);
            root = r; cnt = 0;
 
            d[root] = -1;
            dfs(root, root);
 
            for (int i = 1; i < 21; i++){
                for(int l = 0; l<n; l++){
                    par[l][i] = par[par[l][i-1]][i-1];
                }
            }
        }
        
        void dfs(int v, int p){
            par[v][0] = p;
            tin[v] = cnt++;
            d[v] = d[p]+1;
            for (auto i: g[v]){
                if (i != p) dfs(i, v), c[v]+=c[i]; 
            }
            if(g[v].size()==1) c[v]++, leafs++;
            tout[v] = cnt++;
        }
 
        bool ia(int u, int v){
            return tin[u] <= tin[v] && tout[u] >= tout[v];
        }
 
        int operator()(int u, int v){
 
            if(ia(u, v)) return u;
            if(ia(v, u)) return v;
 
            for(int i = 20; i>=0; i--){
                if(!ia(par[u][i], v)) u=par[u][i];
            }
 
            return par[u][0];
        }
      
      int distance(int u, int v){
        return d[u]+d[v]-2*d[(*this)(u, v)];
      }
};  
 
int32_t main(){
    ios_base::sync_with_stdio(false); cin.tie(0);
 
    int n, q; cin >> n >> q;
 
    vector<array<int, 2>> count(n);
    int root=0;
    for(int i =0; i<n-1; i++){
        int x, y; cin >> x >> y;
        x--; y--;
        g[x].push_back(y);
        g[y].push_back(x);
 
        if(g[x].size()>1) root = x;
        if(g[y].size()>1) root = y;
    }
 
   LCA lca(n, root);
 
    
    int ans = 0;
 
    auto dfs2=[&](int v, int p, auto&& dfs2)->void{
        //cout<<v+1<<" "<<c[v]<<"\n";
        if(c[v] %2) count[v][1]++;
        else count[v][0]++, ans++;
        for(auto i: g[v]){
            if(i!=p){
                count[i][0]+=count[v][0];
                count[i][1]+=count[v][1];
                dfs2(i, v, dfs2);
            }
        }
    };
 
    dfs2(root, root, dfs2) ;
 
    int tmpans = ans, tmpleafs=leafs;
    while(q--){
        int d; cin >> d;
        vector<int> ar(d),a, up;
 
        for(auto &i: ar) cin >> i, i--;
 
        sort(ar.begin(), ar.end(), [&](int x, int y){
            return tin[x] < tin[y];
        }); 
 
        int k=1;
        for(int i=1; i<d; i++){
            if(ar[i]==ar[i-1])k++;
            else{
                 if(g[ar[i-1]].size()==1){
                    leafs+=k-1;
                    if(k%2==0) a.push_back(ar[i-1]);
 
                    k = 1;
                }
                else{
                    leafs+=k;
                    if(k%2==1) a.push_back(ar[i-1]);
                    k=1;
                }
            }
        }
 
        if(g[ar[d-1]].size()==1){
            leafs+=k-1;
            if(k%2==0)  a.push_back(ar[d-1]);
        }
        else{
            leafs+=k;
            if(k%2==1)  a.push_back(ar[d-1]);
        }
 
        up = a; 
 
        if(up.size()){
           
            for(int i=0; i<a.size()-1; i++){
                up.push_back(lca(a[i], a[i+1]));
            }   
 
 
            sort(up.begin(), up.end(), [&](int x, int y){
                return tin[x] < tin[y];
            });
            
            vector<int> upp;
 
            for(int i=0; i<up.size(); i++){
                if(i==0||up[i]!=up[i-1]) upp.push_back(up[i]);
            }
            up=upp;
            upp.clear();
 
 
            if(up.size()){
                stack<int> st;
                st.push(0);
 
                vector<int> p(up.size()), v(up.size()), s(up.size());
                vector<vector<int>> adj(up.size());
                vector<int> aa(up.size());
 
                sort(up.begin(), up.end(), [&](int x, int y){
                    return tin[x] < tin[y];
                });
 
                for(int i=1; i<up.size(); i++) {
                    while(st.size() && tout[up[st.top()]] < tin[up[i]]){
                        st.pop();
                    }
                    if(st.size())
                    adj[st.top()].push_back(i), aa[i]++, p[i]=st.top();
                    else p[i]=i;
                    st.push(i);
                }   
 
                auto dfsa=[&](int ve, auto&&dfsa)->void{
 
                    for(auto i: adj[ve]){
                        dfsa(i, dfsa), v[ve]+=v[i];
                    }
                };
                int pos=0;
                for(int l=0; l<a.size(); l++){
                    while(pos<up.size()&&up[pos]!=a[l]) pos++;
                    if(pos<up.size()&&up[pos]==a[l]) v[pos]++;
                }
 
                for(int i=0; i<up.size(); i++){
                    if(aa[i]==0) dfsa(i, dfsa);
                }
 
 
 
                 for(int i=0; i<up.size(); i++){
                    if(p[i]==i){
                        auto x = count[up[i]];
                        if(v[i]%2){    
 
                            ans-=x[0]; ans+=x[1];
 
                        }
 
 
                    }
                    else if(v[i]%2){
                        auto x=count[up[i]], y=count[up[p[i]]];
                        x[0]-=y[0];
                        x[1]-=y[1];
                        ans-=x[0]; ans+=x[1];
                    }
                }
 
            }
        }
 
        if((leafs%2)!=0) cout<<-1<<"\n";
        else cout<<ans-1+d+n-1<<"\n";
 
        ans=tmpans; leafs=tmpleafs;
    }
}

Compilation message

cleaning.cpp: In function 'int32_t main()':
cleaning.cpp:142:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  142 |             for(int i=0; i<a.size()-1; i++){
      |                          ~^~~~~~~~~~~
cleaning.cpp:153:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  153 |             for(int i=0; i<up.size(); i++){
      |                          ~^~~~~~~~~~
cleaning.cpp:172:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  172 |                 for(int i=1; i<up.size(); i++) {
      |                              ~^~~~~~~~~~
cleaning.cpp:189:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  189 |                 for(int l=0; l<a.size(); l++){
      |                              ~^~~~~~~~~
cleaning.cpp:190:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  190 |                     while(pos<up.size()&&up[pos]!=a[l]) pos++;
      |                           ~~~^~~~~~~~~~
cleaning.cpp:191:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  191 |                     if(pos<up.size()&&up[pos]==a[l]) v[pos]++;
      |                        ~~~^~~~~~~~~~
cleaning.cpp:194:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  194 |                 for(int i=0; i<up.size(); i++){
      |                              ~^~~~~~~~~~
cleaning.cpp:200:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  200 |                  for(int i=0; i<up.size(); i++){
      |                               ~^~~~~~~~~~

Subtask #1
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7512 KB Output is correct
2 Correct 32 ms 10072 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 8280 KB Output is correct
2 Correct 12 ms 8284 KB Output is correct
3 Correct 29 ms 20436 KB Output is correct
4 Correct 35 ms 18104 KB Output is correct
5 Correct 47 ms 21960 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 8796 KB Output is correct
2 Correct 13 ms 8796 KB Output is correct
3 Correct 40 ms 23268 KB Output is correct
4 Correct 61 ms 25956 KB Output is correct
5 Correct 33 ms 22096 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 10328 KB Output is correct
2 Correct 17 ms 10076 KB Output is correct
3 Correct 10 ms 9820 KB Output is correct
4 Correct 11 ms 10328 KB Output is correct
5 Correct 10 ms 10740 KB Output is correct
6 Correct 23 ms 10844 KB Output is correct

Subtask #5
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 15996 KB Output is correct
2 Correct 65 ms 15916 KB Output is correct
3 Correct 37 ms 11856 KB Output is correct
4 Correct 57 ms 15924 KB Output is correct
5 Correct 47 ms 15956 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 20392 KB Output is correct
2 Correct 101 ms 22868 KB Output is correct
3 Correct 91 ms 22616 KB Output is correct
4 Correct 101 ms 21840 KB Output is correct

Subtask #7
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7512 KB Output is correct
2 Correct 32 ms 10072 KB Output is correct
3 Correct 12 ms 8280 KB Output is correct
4 Correct 12 ms 8284 KB Output is correct
5 Correct 29 ms 20436 KB Output is correct
6 Correct 35 ms 18104 KB Output is correct
7 Correct 47 ms 21960 KB Output is correct
8 Correct 16 ms 8796 KB Output is correct
9 Correct 13 ms 8796 KB Output is correct
10 Correct 40 ms 23268 KB Output is correct
11 Correct 61 ms 25956 KB Output is correct
12 Correct 33 ms 22096 KB Output is correct
13 Correct 27 ms 10328 KB Output is correct
14 Correct 17 ms 10076 KB Output is correct
15 Correct 10 ms 9820 KB Output is correct
16 Correct 11 ms 10328 KB Output is correct
17 Correct 10 ms 10740 KB Output is correct
18 Correct 23 ms 10844 KB Output is correct
19 Correct 47 ms 15996 KB Output is correct
20 Correct 65 ms 15916 KB Output is correct
21 Correct 37 ms 11856 KB Output is correct
22 Correct 57 ms 15924 KB Output is correct
23 Correct 47 ms 15956 KB Output is correct
24 Correct 81 ms 20392 KB Output is correct
25 Correct 101 ms 22868 KB Output is correct
26 Correct 91 ms 22616 KB Output is correct
27 Correct 101 ms 21840 KB Output is correct
28 Correct 47 ms 15192 KB Output is correct
29 Correct 66 ms 22108 KB Output is correct
30 Correct 45 ms 21964 KB Output is correct
31 Correct 55 ms 25888 KB Output is correct
32 Correct 64 ms 15916 KB Output is correct
33 Correct 66 ms 19716 KB Output is correct
34 Correct 80 ms 21840 KB Output is correct
35 Correct 80 ms 22868 KB Output is correct