Submission #382028

#	Time	Username	Problem	Language	Result	Execution time	Memory
382028		topovik	Janjetina (COCI21_janjetina)	C++14	15 / 110	1616 ms	432864 KiB

Main

#include <bits/stdc++.h>
#include <chrono>
#pragma comment(linker, "/stack:200000000")
#define f first
#define s second
#define pb push_back

using namespace std;

typedef long long ll;
typedef long double ld;

namespace RANDOM
{
    ll Time()
    {
        return chrono::system_clock().now().time_since_epoch().count();
    }
    mt19937 rnd(Time());
}
using namespace RANDOM;

const ll N = 1e5 + 100;

struct tree;
struct tree1;

struct tree1{
    ll l, r;
    tree1 *L, *R;
    ll sm;
    bool used = 1;

    void clear()
    {
        if (used)
        {
            used = 0;
            if (L != NULL) L -> used = 1;
            if (R != NULL) R -> used = 1;
            sm = 0;
        }
    }

    tree1(ll _l, ll _r)
    {
        l = _l, r = _r;
        L = NULL;
        R = NULL;
        sm = 0;
        used = 0;
    }

    void push()
    {
        if (l == r) return;
        ll mdl = (l + r) >> 1;
        if (L == NULL) L = new tree1(l, mdl);
        if (R == NULL) R = new tree1(mdl + 1, r);
    }

    void insert(ll x)
    {
        push();
        clear();
        if (l > x || r < x) return;
        sm++;
        if (l == r) return;
        L -> insert(x);
        R -> insert(x);
    }

    ll sum(ll x)
    {
        push();
        clear();
        if (l > x) return 0;
        if (r <= x) return sm;
        return L -> sum(x) + R -> sum(x);
    }
};

struct tree{
    ll l, r;
    tree *L, *R;
    tree1 *sm = NULL;
    bool used = 0;


    tree(ll _l, ll _r)
    {
        used = 0;
        l = _l, r = _r;
        L = NULL;
        R = NULL;
        sm = NULL;
    }

    void clear()
    {
        if (used)
        {
            used = 0;
            if (L != NULL) L -> used = 1;
            if (R != NULL) R -> used = 1;
            if (sm != NULL) sm -> used = 1;
        }
    }

    void push()
    {
        if (sm == NULL) sm = new tree1(0, N);
        if (l == r) return;
        ll mdl = (l + r) >> 1;
        if (L == NULL) L = new tree(l, mdl);
        if (R == NULL) R = new tree(mdl + 1, r);
    }

    void insert(ll x, ll y)
    {
        push();
        clear();
        if (l > x || r < x) return;
        sm -> insert(y);
        if (l == r) return;
        L -> insert(x, y);
        R -> insert(x, y);
    }

    ll sum(ll x, ll y)
    {
        push();
        clear();
        if (l > x) return 0;
        if (r <= x) return sm -> sum(y);
        return L -> sum(x, y) + R -> sum(x, y);
    }
};

tree *root;
vector <ll> a[N];
vector <ll> b[N];
ll sz[N];
bool mrk[N];
ll kol, k;
ll ans = 0;

ll Kol(ll x, ll y)
{
    if (mrk[x]) return 0;
    sz[x] = 1;
    for (ll i = 0; i < a[x].size(); i++)
        if (a[x][i] != y) sz[x] += Kol(a[x][i], x);
    return sz[x];
}

ll Find_Centroid(ll x, ll y)
{
    for (ll i = 0; i < a[x].size(); i++)
        if (a[x][i] != y && !mrk[a[x][i]] && sz[a[x][i]] > kol / 2) return Find_Centroid(a[x][i], x);
    return x;
}

void Rec(ll x, ll y, ll sz, ll mx, vector <pair<ll, ll> > *push)
{
    if (mrk[x]) return;
    push -> pb({sz, mx});
    for (ll i = 0; i < a[x].size(); i++)
        if (a[x][i] != y) Rec(a[x][i], x, sz + 1, max(mx, b[x][i]), push);
}

void Calc_Ans(ll x)
{
    vector <pair<ll, ll> > val[a[x].size()];
    ll m = a[x].size();
    for (ll i = 0; i < m; i++) Rec(a[x][i], x, 1, b[x][i], &val[i]);
    root -> used = 1;
    for (ll i = 0; i < m; i++)
    {
        for (ll j = 0; j < val[i].size(); j++) ans += root -> sum(val[i][j].s - val[i][j].f - k, val[i][j].s - 1);
        for (ll j = 0; j < val[i].size(); j++) root -> insert(val[i][j].f, val[i][j].s);
    }
    root -> used = 1;
    for (ll i = m - 1; i >= 0; i--)
    {
        for (ll j = 0; j < val[i].size(); j++) ans += root -> sum(val[i][j].s - val[i][j].f - k, val[i][j].s);
        for (ll j = 0; j < val[i].size(); j++) root -> insert(val[i][j].f, val[i][j].s);
    }
    for (ll i = 0; i < m; i++)
        for (ll j = 0; j < val[i].size(); j++) ans += ((val[i][j].s - val[i][j].f) >= k);
}

void Centroid(ll x)
{
    if (mrk[x]) return;
    kol = Kol(x, x);
    x = Find_Centroid(x, x);
    mrk[x] = 1;
    Calc_Ans(x);
    for (ll i = 0; i < a[x].size(); i++) Centroid(a[x][i]);
}

int main()
{
    root = new tree(0, N);
    ll n;
    cin >> n >> k;
    for (ll i = 0; i < n - 1; i++)
    {
        ll x, y, z;
        cin >> x >> y >> z;
        a[--x].pb(--y);
        a[y].pb(x);
        b[x].pb(z);
        b[y].pb(z);
    }
    Centroid(0);
    cout << ans * 2;
}

Compilation message (stderr)

Main.cpp:3: warning: ignoring #pragma comment  [-Wunknown-pragmas]
    3 | #pragma comment(linker, "/stack:200000000")
      | 
Main.cpp: In function 'll Kol(ll, ll)':
Main.cpp:152:22: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  152 |     for (ll i = 0; i < a[x].size(); i++)
      |                    ~~^~~~~~~~~~~~~
Main.cpp: In function 'll Find_Centroid(ll, ll)':
Main.cpp:159:22: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  159 |     for (ll i = 0; i < a[x].size(); i++)
      |                    ~~^~~~~~~~~~~~~
Main.cpp: In function 'void Rec(ll, ll, ll, ll, std::vector<std::pair<long long int, long long int> >*)':
Main.cpp:168:22: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  168 |     for (ll i = 0; i < a[x].size(); i++)
      |                    ~~^~~~~~~~~~~~~
Main.cpp: In function 'void Calc_Ans(ll)':
Main.cpp:180:26: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  180 |         for (ll j = 0; j < val[i].size(); j++) ans += root -> sum(val[i][j].s - val[i][j].f - k, val[i][j].s - 1);
      |                        ~~^~~~~~~~~~~~~~~
Main.cpp:181:26: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  181 |         for (ll j = 0; j < val[i].size(); j++) root -> insert(val[i][j].f, val[i][j].s);
      |                        ~~^~~~~~~~~~~~~~~
Main.cpp:186:26: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  186 |         for (ll j = 0; j < val[i].size(); j++) ans += root -> sum(val[i][j].s - val[i][j].f - k, val[i][j].s);
      |                        ~~^~~~~~~~~~~~~~~
Main.cpp:187:26: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  187 |         for (ll j = 0; j < val[i].size(); j++) root -> insert(val[i][j].f, val[i][j].s);
      |                        ~~^~~~~~~~~~~~~~~
Main.cpp:190:26: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  190 |         for (ll j = 0; j < val[i].size(); j++) ans += ((val[i][j].s - val[i][j].f) >= k);
      |                        ~~^~~~~~~~~~~~~~~
Main.cpp: In function 'void Centroid(ll)':
Main.cpp:200:22: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  200 |     for (ll i = 0; i < a[x].size(); i++) Centroid(a[x][i]);
      |                    ~~^~~~~~~~~~~~~

• Subtask 1: 15 / 15
• Subtask 2: 0 / 35
• Subtask 3: 0 / 60