oj.uz

Submission #878370

# Submission time Handle Problem Language Result Execution time Memory
878370 2023-11-24T08:58:13 Z heeheeheehaaw Simple game (IZhO17_game) C++17
0 / 100
 1 ms 604 KB 
#include <bits/stdc++.h>

using namespace std;

int aib[100005];
int v[100005];
int n, q;

void update(int poz, int val)
{
    for(int i = poz; i <= n; i += (i & (-i)))
        aib[i] += val;
    return;
}

int query(int poz)
{
    int sum = 0;
    for(int i = poz; i >= 1; i -= (i & (-i)))
        sum += aib[i];
    return sum;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    cin>>n>>q;
    for(int i = 1; i <= n; i++)
        cin>>v[i];
    for(int i = 2; i <= n; i++)
    {
        int sus = max(v[i], v[i - 1]);
        int jos = min(v[i], v[i - 1]);
        update(jos, 1);
        update(sus, -1);
    }

    for(int i = 1; i <= q; i++)
    {
        int tip;
        cin>>tip;
        if(tip == 1)
        {
            int a, b;
            cin>>a>>b;
            if(a > 1)
            {
                int st = a - 1;
                int sus = max(v[st], v[a]), jos = min(v[st], v[a]);
                update(sus, 1);
                update(jos, -1);
                sus = max(v[st], b);
                jos = min(v[st], b);
                update(sus, -1);
                update(jos, 1);
            }
            if(a < n)
            {
                int st = a + 1;
                int sus = max(v[st], v[a]), jos = min(v[st], v[a]);
                update(sus, 1);
                update(jos, -1);
                sus = max(v[st], b);
                jos = min(v[st], b);
                update(sus, -1);
                update(jos, 1);
            }

            v[a] = b;
        }
        else
        {
            int a;
            cin>>a;
            cout<<query(a)<<'\n';
        }
    }
    return 0;
}

/*

3 3
1 5 1
2 3
1 1 5
2 3

*/

Subtask #1
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Runtime error 1 ms 604 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #2
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Runtime error 1 ms 604 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #3
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Runtime error 1 ms 604 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -