Submission #1188079

#	Time	Username	Problem	Language	Result	Execution time	Memory
1188079		Aliyyiakbar	Vinjete (COI22_vinjete)	C++20	27 / 100	3100 ms	251700 KiB

Main

#include <bits/stdc++.h>
// author: vusal
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;

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

#define int long long

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int oo = 1e18 + 9;
const int sz = 5e4+7;
const int MOD = 1e9+7;

int n, m;
vector<array<int,3>>g[sz];
bitset<sz> bs[sz];

void dfs(int node, int par)
{
    for (auto to : g[node])
    {
        if (to[0] != par)
        {
            bs[to[0]] = bs[node];
            for (int i = to[1]; i <= to[2]; ++i)
            {
                bs[to[0]][i] = 1;
            }
            dfs(to[0], node);
        }
    }
}

void solve()
{
    cin >> n >> m;

    for(int i = 0; i < n -1; i++)
    {
        int u, v, l, r;
        cin >> u >> v >> l >> r;

        g[u].push_back({v, l, r});
        g[v].push_back({u, l, r});
    }
    dfs(1, -1);

    for(int i = 2; i <= n; i++)
    {
        cout << bs[i].count() << '\n';
    }
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int tc = 1;
    // cin >> tc;
    for(int i = 1; i <= tc; i++)
    {
        //cout << "Case " << i << ":";
        solve();
    }
    return 0;
}

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