Submission #167968

#	Time	Username	Problem	Language	Result	Execution time	Memory
167968		Rakhmand	Simple game (IZhO17_game)	C++14	100 / 100	226 ms	11264 KiB

game

//
//  ROIGold.cpp
//  Main calisma
//
//  Created by Rakhman on 05/02/2019.
//  Copyright © 2019 Rakhman. All rights reserved.
//
 
#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cassert>
#include <iterator>
 
#define ios ios_base::sync_with_stdio(0), cout.tie(0), cin.tie(0);
#define S second
#define F first
#define pb push_back
#define nl '\n'
#define NL cout << '\n';
#define EX exit(0)
#define all(s) s.begin(), s.end()
#define no_answer return cout << 0, 0;
#define FOR(i, start, finish, k) for(int i = start; i <= finish; i += k)
 
const int MXN = 1e6 + 200;
const long long MNN = 4e2 + 200;
const long long MOD = 1e9 + 7;
const long long INF = 1e18;
const int OO = 1e9 + 500;
 
typedef long long llong;
typedef unsigned long long ullong;
 
using namespace std;
 
int n, m, h[MXN], t[MXN * 4], mod[MXN * 4];

void upd(int v, int tl, int tr, int ind, int x){
    if(tl == tr){
        t[v] += x;
        return ;
    }
    int tm = (tl + tr) / 2;
    if(ind <= tm){
        upd(v + v, tl, tm, ind, x);
    }else{
        upd(v + v + 1, tm + 1, tr, ind, x);
    }
    t[v] = t[v + v] + t[v + v + 1];
}

llong get(int v, int tl, int tr, int L, int R){
    if(L <= tl && tr <= R){
        return t[v];
    }
    if(tl > R || tr < L || L > R){
        return 0;
    }
    int tm = (tl + tr) / 2;
    return get(v + v, tl, tm, L, R) + get(v + v + 1, tm + 1, tr, L, R);
}

void del(int pos){
    if(pos > 1){
        if(h[pos - 1] > h[pos]){
            upd(1, 1, 1000000, h[pos] + 1, -1);
            upd(1, 1, 1000000, h[pos - 1], 1);
        }else if(h[pos - 1] < h[pos]){
            upd(1, 1, 1000000, h[pos - 1] + 1, -1);
            upd(1, 1, 1000000, h[pos], 1);
        }
    }
}

void add(int pos){
    if(pos > 1) {
        if(h[pos - 1] > h[pos]){
            upd(1, 1, 1000000, h[pos] + 1, 1);
            upd(1, 1, 1000000, h[pos - 1], -1);
        }else if(h[pos - 1] < h[pos]){
            upd(1, 1, 1000000, h[pos - 1] + 1, 1);
            upd(1, 1, 1000000, h[pos], -1);
        }
    }
}

int main () {
    ios;
    cin >> n >> m;
    for(int i = 1; i <= n; i++){
        cin >> h[i];
        add(i);
    }
    for(int i = 1; i <= m; i++){
        int pos, val, type, H;
        cin >> type;
        if(type == 1){
            cin >> pos >> val;
            del(pos);
            if(pos + 1 <= n) del(pos + 1);
            h[pos] = val;
            add(pos);
            if(pos + 1 <= n) add(pos + 1);
        }else{
            cin >> H;
            cout << get(1, 1, 1000000, 1, H) << nl;
        }
    }
}

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