제출 #879249

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
879249		12345678	Simple game (IZhO17_game)	C++17	100 / 100	156 ms	11412 KiB

game

#include <bits/stdc++.h>

using namespace std;

const int nx=1e5+5, mx=1e6+5;
int n, m, h[nx], t, x, y;

struct segtree
{
    int lz[4*mx];
    void pushlz(int l, int r, int i)
    {
        if (l==r) return;
        lz[2*i]+=lz[i];
        lz[2*i+1]+=lz[i];
        lz[i]=0;
    }
    void update(int l, int r, int i, int ql, int qr, int vl)
    {
        pushlz(l, r, i);
        if (ql<=l&&r<=qr) return lz[i]+=vl, pushlz(l, r, i), void();
        if (qr<l||r<ql) return;
        int md=(l+r)/2;
        update(l, md, 2*i, ql, qr, vl);
        update(md+1, r, 2*i+1, ql, qr, vl);
    }
    int query(int l, int r, int i, int idx)
    {
        pushlz(l, r, i);
        if (l==r) return lz[i];
        int md=(l+r)/2;
        if (idx<=md) return query(l, md, 2*i, idx);
        return query(md+1, r, 2*i+1, idx);
    }
} s;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>m;
    for (int i=1; i<=n; i++) cin>>h[i];
    for (int i=2; i<=n; i++) s.update(1, mx-1, 1, min(h[i], h[i-1]), max(h[i], h[i-1]), 1);
    while (m--)
    {
        cin>>t;
        if (t==1) 
        {
            cin>>x>>y;
            if (x!=1) s.update(1, mx-1, 1, min(h[x], h[x-1]), max(h[x], h[x-1]), -1);
            if (x!=n) s.update(1, mx-1, 1, min(h[x+1], h[x]), max(h[x+1], h[x]), -1);
            h[x]=y;
            if (x!=1) s.update(1, mx-1, 1, min(h[x], h[x-1]), max(h[x], h[x-1]), 1);
            if (x!=n) s.update(1, mx-1, 1, min(h[x+1], h[x]), max(h[x+1], h[x]), 1);
        }
        else cin>>x, cout<<s.query(1, mx-1, 1, x)<<'\n';
    }
}

• Subtask 1: 22 / 22
• Subtask 2: 27 / 27
• Subtask 3: 51 / 51