Submission #52982

#	Time	Username	Problem	Language	Result	Execution time	Memory
52982		Alexa2001	Pyramid Base (IOI08_pyramid_base)	C++17	5 / 100	2024 ms	110200 KiB

pyramid_base

#include <bits/stdc++.h>
#define left_son (node<<1)
#define right_son ((node<<1)|1)
#define mid ((st+dr)>>1)

using namespace std;

const int Nmax = 1e6 + 5;

int n, N, M, money;
vector< pair<int,int> > start[Nmax], finish[Nmax];

class SegmentTree
{
    int lazy[Nmax<<2], L[Nmax<<2], R[Nmax<<2], best[Nmax<<2], mn[Nmax<<2];

    public:
        void update(int node, int st, int dr, int Left, int Right, int add)
        {
            if(Left<=st && dr<=Right)
            {
                mn[node] += add;
                lazy[node] += add;
                return;
            }

            if(lazy[node])
            {
                lazy[left_son] += lazy[node];
                lazy[right_son] += lazy[node];
                mn[left_son] += add;
                mn[right_son] += add;
                lazy[node] = 0;
            }

            if(Left<=mid) update(left_son, st, mid, Left, Right, add);
            if(mid<Right) update(right_son, mid+1, dr, Left, Right, add);

            mn[node] = min(mn[left_son], mn[right_son]);

            if(mn[left_son] == mn[right_son])
            {
                L[node] = L[left_son] + (L[left_son] == mid-st+1 ? L[right_son] : 0);
                R[node] = R[right_son] + (R[right_son] == dr-mid ? R[left_son] : 0);
                best[node] = max(best[left_son], best[right_son]);
                best[node] = max(best[node], R[left_son] + L[right_son]);
            }
            else if(mn[node] == mn[left_son])
            {
                L[node] = L[left_son];
                R[node] = 0;
                best[node] = best[left_son];
            }
            else
            {
                L[node] = 0;
                R[node] = R[right_son];
                best[node] = best[right_son];
            }
        }

        int query()
        {
            return mn[1] == 0 ? best[1] : 0;
        }

        void build(int node, int st, int dr)
        {
            mn[node] = lazy[node] = 0;
            L[node] = R[node] = best[node] = dr-st+1;

            if(st == dr) return;

            build(left_son, st, mid);
            build(right_son, mid+1, dr);
        }
} aint;

void solve0()
{
    int i, j, X1, Y1, X2, Y2, C;
    int ans = 0;

    aint.build(1, 1, M);

    for(i=1; i<=n; ++i)
    {
        cin >> X1 >> Y1 >> X2 >> Y2 >> C;
        start[X1].push_back({Y1, Y2});
        finish[X2].push_back({Y1, Y2});
    }

    j = 0;
    for(i=1; i<=N; ++i)
        if(i==1 || !finish[i-1].empty())
        {
            for(auto e : finish[i-1])
                aint.update(1, 1, M, e.first, e.second, -1);

            while(j+1 <= N && aint.query() >= j-i+1)
            {
                ++j;
                for(auto e : start[j])
                    aint.update(1, 1, M, e.first, e.second, 1);
            }

            if(j == N) ans = max(ans, N-i+1);
                else ans = max(ans, j-i);
        }
    cout << ans << '\n';
}

int main()
{
  //  freopen("input", "r", stdin);
  //  freopen("output", "w", stdout);
    cin.sync_with_stdio(false);

    cin >> N >> M >> money >> n;

    if(!money) solve0(); /// subtask 1 + 3
      //  else solve(); /// subtask 2

    return 0;
}

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