제출 #813103

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
813103		stefanopulos	Vinjete (COI22_vinjete)	C++17	100 / 100	684 ms	188468 KiB

Main

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
 
using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ldb;
 
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ldb,ldb> pdd;

#define ff(i,a,b) for(int i = a; i <= b; i++)
#define fb(i,b,a) for(int i = b; i >= a; i--)
#define trav(a,x) for(auto& a : x)
 
#define sz(a) (int)(a).size()
#define fi first
#define se second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

const int mod = 1000000007;
const int inf = 1e9 + 5;
const int mxN = 200005; 

int n, m;

vector<array<int,3>> g[mxN];

int idx = 0;
int root;
int ls[50 * mxN];
int rs[50 * mxN];
int mn[50 * mxN];
int cnt[50 * mxN];
int lenj[50 * mxN];

void propagate(int v, int tl, int tr){
    if(lenj[v] != 0){
        mn[v] += lenj[v];

        if(tl != tr){
            int mid = (tl + tr) / 2;

            if(!ls[v]){
                ls[v] = ++idx;
                mn[ls[v]] = 0;
                cnt[ls[v]] = mid - tl + 1;
            }
            lenj[ls[v]] += lenj[v];

            if(!rs[v]){
                rs[v] = ++idx;
                mn[rs[v]] = 0;
                cnt[rs[v]] = tr - mid;
            }
            lenj[rs[v]] += lenj[v];

        }

        lenj[v] = 0;
    }
}

void lazyupd(int& v, int tl, int tr, int l, int r, int val){
    if(!v){
        v = ++idx;
        mn[v] = 0;
        cnt[v] = tr - tl + 1;
    }

    propagate(v, tl, tr);
    if(tl > tr || l > tr || tl > r)return;
    if(tl >= l && tr <= r){
        lenj[v] += val;
        propagate(v, tl, tr);
        return;
    }
    int mid = (tl + tr) / 2;
    lazyupd(ls[v], tl, mid, l, r, val); lazyupd(rs[v], mid + 1, tr, l, r, val);
    
    mn[v] = min(mn[ls[v]], mn[rs[v]]);
    cnt[v] = (mn[v] == mn[ls[v]] ? cnt[ls[v]] : 0) 
    + (mn[v] == mn[rs[v]] ? cnt[rs[v]] : 0);
}

int res[mxN];
void dfs(int v, int p){

    res[v] = m - (mn[root] == 0 ? cnt[root] : 0);
    for(auto c : g[v]){
        int u = c[0];
        int l = c[1];
        int r = c[2];
        if(u != p){
            lazyupd(root,1,m,l,r,1);
            dfs(u, v);
            lazyupd(root,1,m,l,r,-1);
        }
    }

}

int main(){
    cin.tie(0)->sync_with_stdio(0);

    cin >> n >> m;
    ff(i,1,n - 1){
        int u, v, l, r;
        cin >> u >> v >> l >> r;
        g[u].pb({v, l, r});
        g[v].pb({u, l, r});
    }

    dfs(1, -1);

    ff(i,2,n)cout << res[i] << '\n';

    return 0;
}
/*

3 8
2 1 1 7
3 2 3 8

// probati bojenje sahovski
*/
 
 
 
 
 

• Subtask 1: 11 / 11
• Subtask 2: 13 / 13
• Subtask 3: 16 / 16
• Subtask 4: 29 / 29
• Subtask 5: 31 / 31