제출 #917945

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
917945		Whisper	Simple game (IZhO17_game)	C++17	100 / 100	262 ms	36268 KiB

game

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;
using T = tuple<ll, ll, ll>;

//#define int long long
#define Base 41
#define sz(a) (int)a.size()
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define all(x) x.begin() , x.end()
#define pii pair<int , int>
#define fi first
#define se second
#define Lg(x) 31 - __builtin_clz(x)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 1e6 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
int N, Q;
int h[MAX];

struct SegTree{
    vector<int> st, lazy;
    int n;
    void init(int _n){
        this -> n = _n;
        st.resize((n << 2) + 5);
        lazy.resize((n << 2) + 5);
    }
    void pushDown(int id, int l, int r){
        if (!lazy[id]) return;
        int &res = lazy[id];
        int mid = (l + r) >> 1;
        st[id << 1] += (mid - l + 1) * res;
        st[id << 1 | 1] += (r - mid) * res;
        lazy[id << 1] += res;
        lazy[id << 1 | 1] += res;
        res = 0;
    }
    void modify(int id, int l, int r, int u, int v, int val){
        if (u > r || v < l) return;
        if (u <= l && v >= r){
            st[id] += (r - l + 1) * val;
            lazy[id] += val;
            return;
        }
        int mid = (l + r) >> 1;
        pushDown(id, l, r);
        modify(id << 1, l, mid, u, v, val);
        modify(id << 1 | 1, mid + 1, r, u, v, val);
        st[id] = st[id << 1] + st[id << 1 | 1];
    }
    int query(int id, int l, int r, int u, int v){
        if (u > r || v < l) return 0;
        if (u <= l && v >= r) return st[id];
        pushDown(id, l, r);
        int mid = (l + r) >> 1;
        int ql = query(id << 1, l, mid, u, v);
        int qr = query(id << 1 | 1, mid + 1, r, u, v);
        return ql + qr;
    }
    void modify(int l, int r, int val){
        modify(1, 1, n, l, r, val);
    }
} st;

void upd(int l, int r, int val){
    l = h[l], r = h[r];
    if (l > r) swap(l, r);
    st.modify(l, r, val);
}

void Whisper(){
    cin >> N >> Q;
    for (int i = 1; i <= N; ++i) cin >> h[i];
    st.init(MAX);
    for (int i = 1; i < N; ++i){
        int l = h[i], r = h[i + 1];
        if (l > r) swap(l, r);
        st.modify(l, r, 1);
    }
    for (int i = 1; i <= Q; ++i){
        int cmd; cin >> cmd;
        if(cmd == 1){
            int pos, val; cin >> pos >> val;
            if (pos + 1 <= N)
                upd(pos, pos + 1, -1);
            if (pos - 1 >= 1)
                upd(pos, pos - 1, -1);
            h[pos] = val;
            if (pos + 1 <= N)
                upd(pos, pos + 1, 1);
            if (pos - 1 >= 1)
                upd(pos, pos - 1, 1);
        }
        else{
            int height; cin >> height;
            cout << st.query(1, 1, MAX, height, height) << '\n';
        }
    }
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

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