제출 #1150059

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1150059		monkey133	Vinjete (COI22_vinjete)	C++20	0 / 100	2 ms	2888 KiB

Main

#include <bits/stdc++.h>
//#include "includeall.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%lld", &x);
#define input2(x, y) scanf("%lld%lld", &x, &y);
#define input3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define input4(x, y, z, a) scanf("%lld%lld%lld%lld", &x, &y, &z, &a);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define all(x) x.begin(), x.end()
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define FOR(i, x, n) for (ll i =x; i<=n; ++i) 
#define RFOR(i, x, n) for (ll i =x; i>=n; --i) 
#pragma GCC optimize("O3","unroll-loops")
using namespace std;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
//using namespace __gnu_pbds;
//#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
//#define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<ll, pi> pii;
typedef pair<pi, pi> piii;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

struct node{

    ll s, e, m; 
    pi val; 
    ll lazy; 
    node *l, *r; 
	node (ll S, ll E)
{	 
       s = S, e = E, m = (s+e)/2;
       val = mp(0, e-s + 1);
       lazy = 0; 
       l=r=nullptr;
 
    }
    void create()
    {
	   if(s != e && l==nullptr)
       { 
           l = new node(s, m); 
           r = new node(m+1, e); 
       }
    }
 
	void propogate()
	{
       if (lazy==0) return; 
       create();
       val.f+=lazy; 
       if (s != e){ 
           l->lazy+=lazy;
           r->lazy+=lazy;
       }
       lazy=0; 
    }
	void update(ll S, ll E, ll V)
	{ 
	   propogate();
       if(s==S && e==E) lazy += V; 
       else{ 
           create();
           if(E <= m) l->update(S, E, V); 
           else if (m < S) r->update(S, E, V); 
           else l->update(S, m, V),r->update(m+1, E, V);
           l->propogate(),r->propogate();
           if (l->val.f == r->val.f) val = mp(l->val.f, l->val.s + r->val.s);
           else val = min(l->val, r->val);
       }
    }

} *root;

ll n, m;
vector<pii> adj[100005];
ll ans[100005];

void dfs(ll x = 1, ll p = -1)
{
	root->propogate();
	assert(root->val.f >=0);
	ans[x] = m - ((root->val.f <= 0)?root->val.s :0);
	for (pii u: adj[x]) if (u.f !=p)
	{
		root->update(u.s.f, u.s.s, 1);
		dfs(u.f, x);
		root->update(u.s.f, u.s.s, -1);
	}
}


int main()
{
	cin >> n >> m;
	root = new node(1, m);
	for (ll i=0; i<n-1; ++i)
	{
		ll l, r, u, v;
		cin >> u >> v >> l >> r;
		adj[u].pb(mp(v, mp(l, r)));
	}
	dfs();
	for (ll i=2; i<=n; ++i) cout << ans[i] << endl;

	return 0;
}

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