oj.uz

답안 #683974

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
683974 2023-01-19T20:33:34 Z speedyArda Simple game (IZhO17_game) C++14
100 / 100
 414 ms 19344 KB 
#include "bits/stdc++.h"

using namespace std;
const int MAXN = 1e6;
int seg[MAXN * 4 + 5], lazy[MAXN * 4 + 5], height[MAXN + 5];

void push(int v)
{
    lazy[v * 2] += lazy[v];
    lazy[v * 2 + 1] += lazy[v];
    seg[v * 2] += lazy[v];
    seg[v * 2 + 1] += lazy[v];
    lazy[v] = 0;
}

void update(int v, int tl, int tr, int l, int r, int add)
{
    //cout << v << " " << l << " " << r<< "\n";
    if(l > r)
        return;
    if(l == tl && r == tr)
    {
        seg[v] += add;
        lazy[v] += add;
        return;
    }
    push(v);
    int tm = (tl + tr) / 2;

    update(2 * v, tl, tm, l, min(tm, r), add);
    update(2 * v + 1, tm + 1, tr, max(tm + 1, l), r, add);
}

int get(int v, int tl, int tr, int pos)
{
    if(tl == tr)
        return seg[v];
    push(v);
    int tm = (tl + tr) / 2;
    if(tm >= pos)
        return get(2 * v, tl, tm, pos);
    else
        return get(2 * v + 1, tm + 1, tr, pos);
}

int main() 
{
    int n, m;
    cin >> n >> m;
    for(int i = 1; i <= n; i++)
    {
        cin >> height[i];
        if(i > 1)
        {
            //cout << min(height[i], height[i - 1]) << " " << max(height[i], height[i - 1]) << "\n";
            update(1, 1, MAXN, min(height[i], height[i - 1]), max(height[i], height[i - 1]), 1);
        }
    }

    for(int i = 1; i <= m; i++)
    {
        int type;
        cin >> type;
        if(type == 1)
        {
            int idx, val;
            cin >> idx >> val;
            //cout << height[idx - 1] << " " << height[idx] << " " << height[idx + 1] << "\n";
            if(idx > 1)
                update(1, 1, MAXN, min(height[idx], height[idx - 1]), max(height[idx], height[idx - 1]), -1);
            if(idx < n)
                update(1, 1, MAXN, min(height[idx], height[idx + 1]), max(height[idx], height[idx + 1]), -1);
            height[idx] = val;
            if(idx > 1)
                update(1, 1, MAXN, min(height[idx], height[idx - 1]), max(height[idx], height[idx - 1]), 1);
            if(idx < n)
                update(1, 1, MAXN, min(height[idx], height[idx + 1]), max(height[idx], height[idx + 1]), 1);
        } else 
        {
            int h;
            cin >> h;
            cout << get(1, 1, MAXN, h) << "\n";
        }
    }
}

Subtask #1
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 9 ms 14676 KB Output is correct
3 Correct 8 ms 14396 KB Output is correct
4 Correct 9 ms 14548 KB Output is correct
5 Correct 10 ms 14780 KB Output is correct
6 Correct 10 ms 14784 KB Output is correct
7 Correct 8 ms 12756 KB Output is correct

Subtask #2
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 9 ms 14676 KB Output is correct
3 Correct 8 ms 14396 KB Output is correct
4 Correct 9 ms 14548 KB Output is correct
5 Correct 10 ms 14780 KB Output is correct
6 Correct 10 ms 14784 KB Output is correct
7 Correct 8 ms 12756 KB Output is correct
8 Correct 191 ms 1712 KB Output is correct
9 Correct 274 ms 19292 KB Output is correct
10 Correct 280 ms 19328 KB Output is correct
11 Correct 202 ms 1628 KB Output is correct
12 Correct 232 ms 3180 KB Output is correct
13 Correct 227 ms 19160 KB Output is correct

Subtask #3
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 9 ms 14676 KB Output is correct
3 Correct 8 ms 14396 KB Output is correct
4 Correct 9 ms 14548 KB Output is correct
5 Correct 10 ms 14780 KB Output is correct
6 Correct 10 ms 14784 KB Output is correct
7 Correct 8 ms 12756 KB Output is correct
8 Correct 191 ms 1712 KB Output is correct
9 Correct 274 ms 19292 KB Output is correct
10 Correct 280 ms 19328 KB Output is correct
11 Correct 202 ms 1628 KB Output is correct
12 Correct 232 ms 3180 KB Output is correct
13 Correct 227 ms 19160 KB Output is correct
14 Correct 414 ms 19320 KB Output is correct
15 Correct 324 ms 19336 KB Output is correct
16 Correct 316 ms 19324 KB Output is correct
17 Correct 326 ms 19344 KB Output is correct
18 Correct 328 ms 19312 KB Output is correct