oj.uz

Submission #619581

# Submission time Handle Problem Language Result Execution time Memory
619581 2022-08-02T13:09:54 Z nohaxjustsoflo Simple game (IZhO17_game) C++17
100 / 100
 439 ms 15484 KB 
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<ll,null_type,less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> order_set;
mt19937 mt_rand(chrono::high_resolution_clock::now().time_since_epoch().count());
//uniform_int_distribution<int> gen; ///(min, max)
//int random() {return gen(mt_rand);}
const int mxN=3e5+5;
const int mod=998244353;
const int mxlogN=20;
const int mxK=26;
const int inf=2e9;
const int K=600;
int a[mxN];
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n, m; cin >> n >> m;
    order_set add,sub;
    for(int i=0; i<n; i++)
    {
        cin >> a[i];
        if(i) add.insert(min(a[i],a[i-1]));
        if(i) sub.insert(max(a[i],a[i-1]));
    }
    for(int i=0; i<m; i++)
    {
        int t; cin >> t;
        if(t==1)
        {
            int i,v; cin >> i >> v; i--;
            if(i > 0) add.erase(add.lower_bound(min(a[i],a[i-1])-1));
            if(i > 0) sub.erase(sub.lower_bound(max(a[i],a[i-1])-1));
            if(i+1<n) add.erase(add.lower_bound(min(a[i],a[i+1])-1));
            if(i+1<n) sub.erase(sub.lower_bound(max(a[i],a[i+1])-1));
            a[i]=v;
            if(i > 0) add.insert(min(a[i],a[i-1]));
            if(i > 0) sub.insert(max(a[i],a[i-1]));
            if(i+1<n) add.insert(min(a[i],a[i+1]));
            if(i+1<n) sub.insert(max(a[i],a[i+1]));
        }
        else
        {
            int H; cin >> H;
            cout << add.order_of_key(H)-sub.order_of_key(H) << "\n";
        }
    }
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 472 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 480 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 472 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 480 KB Output is correct
8 Correct 117 ms 14144 KB Output is correct
9 Correct 214 ms 15440 KB Output is correct
10 Correct 213 ms 15436 KB Output is correct
11 Correct 150 ms 14104 KB Output is correct
12 Correct 178 ms 15200 KB Output is correct
13 Correct 157 ms 15180 KB Output is correct

Subtask #3
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 472 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 480 KB Output is correct
8 Correct 117 ms 14144 KB Output is correct
9 Correct 214 ms 15440 KB Output is correct
10 Correct 213 ms 15436 KB Output is correct
11 Correct 150 ms 14104 KB Output is correct
12 Correct 178 ms 15200 KB Output is correct
13 Correct 157 ms 15180 KB Output is correct
14 Correct 427 ms 15368 KB Output is correct
15 Correct 420 ms 15484 KB Output is correct
16 Correct 439 ms 15480 KB Output is correct
17 Correct 414 ms 15348 KB Output is correct
18 Correct 427 ms 15384 KB Output is correct