제출 #1161067

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1161067		crafticat	Duathlon (APIO18_duathlon)	C++20	0 / 100	591 ms	25028 KiB

count_triplets

#include <bits/stdc++.h>

using namespace std;

#define F0R(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define ROF(i, a, b) for (ll i = (a); i >= (b); i--)
#define REP(i, n) for (ll i = (n); i >= 0; i--)

using ll = long long;
template<typename T>
using V = vector<T>;
using vi = vector<ll>;

constexpr ll INF = 1e15 + 7;

template<bool operMax>
struct Seg
{
    Seg<operMax>* left=  nullptr, *right = nullptr;
    ll l, r, mid, v = operMax ? -INF : INF;
    bool sparse = false;

    Seg(ll l, ll r) : l(l), r(r), mid((l + r) / 2)
    {

    }

    void push()
    {
        if (sparse) return;
        sparse = true;
        if (r - l > 1)
        {
            left = new Seg(l, mid);
            right = new Seg(mid, r);
        }
    }

    ll q(ll a, ll b)
    {
        push();
        if (b <= l or a >= r) return operMax ? -INF : INF;
        if (a <= l and b>= r) return v;
        return operMax ? max(left->q(a, b), right->q(a, b)) : min(left->q(a, b), right->q(a, b));
    }

    void update(ll x, ll u)
    {
        push();
        if (r - l <= 1)
        {
            // Same position?
            v = u;
            return;
        }

        if (x < mid)
            left->update(x, u);
        else
            right->update(x, u);
        v = operMax ? max(left->v, right->v) : min(left->v, right->v);
    }
};

template<bool operMax>
struct Seg2d
{
    Seg2d<operMax>* left = nullptr, *right = nullptr;
    ll l, r, mid;
    Seg<operMax>* v= nullptr;
    bool sparse = false;

    Seg2d(ll l, ll r) : l(l), r(r), mid((l + r) / 2)
    {

        v = new Seg<operMax>(0,INF);
    }

    void push()
    {
        if (sparse) return;
        sparse = true;
        if (r - l > 1)
        {
            left = new Seg2d(l, mid);
            right = new Seg2d(mid, r);
        }
    }

    ll q(ll a, ll b, ll x, ll y)
    {
        push();
        if (b <= l or a >= r) return operMax ? -INF : INF;
        if (a <= l and b >= r)
        {
            return v->q(x, y);
        }

        return operMax ? max({left->q(a,b,x,y), right->q(a,b,x,y)}) : min(left->q(a,b,x,y), right->q(a,b,x,y));
    }

    void update(ll x, ll y, ll z)
    {
        push();
        if (r - l <= 1)
        {
            v->update(y, z);
            return;
        }
        if (x < mid)
            left->update(x, y, z);
        else
            right->update(x, y, z);
        v->update(y, operMax ? max(left->v->q(y, y + 1),right->v->q(y, y + 1)) : min(left->v->q(y, y + 1),right->v->q(y, y + 1)));
    }
};

Seg2d<true> *maxSeg = nullptr;
Seg2d<false> *minSeg = nullptr;
V<multiset<ll>> polls;
ll amount = 0;

void addSeg(ll l, ll r, ll x)
{
    if (x == -1)
    {
        maxSeg->update(l, r, -INF);
        minSeg->update(l, r, INF);
    } else
    {
        maxSeg->update(l, r, x);
        minSeg->update(l, r, x);
    }
}
ll query(ll x)
{
    ll y = maxSeg->q(0, x + 1, x + 1, INF);
    ll z = minSeg->q(0, x + 1, x + 1, INF);

    ll ans = max(abs(x - y), abs(z - x));
    if (amount < 0) return -1;
    return ans > (ll) 1e9 ? -1 : ans;
}

void add(ll x, ll t)
{
    if (polls[t].size() > 1) amount--;

    auto it = polls[t].lower_bound(x);
    ll after = it == polls[t].end() ? INF : *it;
    ll before = it == polls[t].begin() ? -INF : *--it;
    ll mid = (before + after) / 2;
    ll mid1 = (before + x) / 2, mid2 = (after + x) / 2;


    polls[t].insert(x);
    if (polls[t].size() > 1) amount++;

}
void del(ll x,ll t)
{
    if (polls[t].size() > 1) amount--;

    auto it = polls[t].lower_bound(x);

    ll after = it == polls[t].end() ? INF : *it;
    ll before = it == polls[t].begin() ? -INF : *--it;
    ll mid = (before + after) / 2;
    ll mid1 = (before + x) / 2, mid2 = (after + x) / 2;


    if (polls[t].size() > 1) amount++;
}

int main()
{
    ll n, k, q; cin >> n >> k >> q;
    V<tuple<ll,ll,ll,ll>> updates; // Add time, Type, Pos, TypeX
    // Ins, Query, Del
    vi results(q);

    F0R(i, n)
    {
        ll x, t, a, b; cin >> x >> t >> a >> b;
        updates.emplace_back(a, 1, x, t);
        updates.emplace_back(b, 3, x, t);
    }

    amount = -k;
    ll t = 0;
    while (q--)
    {
        ll l, y; cin >> l >> y;
        updates.emplace_back(y, 2, l, t++);
    }

    sort(updates.begin(), updates.end());

    polls.resize(k);
    maxSeg = new Seg2d<true>(0, INF);
    minSeg = new Seg2d<false>(0, INF);

    F0R(i, k)
    {
        add(-INF, i);
    }


    for (auto [time, type, pos, typeX] : updates)
    {
        typeX--;
        if (type == 1)
        {
            add(pos, typeX);
        }
        if (type == 2)
        {
            typeX++;
            results[typeX] = query(pos);
        }
        if (type == 3)
        {
            del(pos, typeX);
        }
    }

    for (auto x : results)
        cout << x << '\n';
    return 0;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 11
• Subtask 3: 0 / 8
• Subtask 4: 0 / 10
• Subtask 5: 0 / 13
• Subtask 6: 0 / 15
• Subtask 7: 0 / 20
• Subtask 8: 0 / 8
• Subtask 9: 0 / 10