oj.uz

Submission #967486

# Submission time Handle Problem Language Result Execution time Memory
967486 2024-04-22T08:31:55 Z vjudge1 Simple game (IZhO17_game) C++17
100 / 100
 41 ms 7256 KB 
#include <bits/stdc++.h>

#define ll long long
#define all(x) x.begin(), x.end()
#define Neco "Simple game"
#define resp(x) sort(all(x)), x.resize(unique(all(x)) - x.begin())
#define getbit(x,i) ((x >> i)&1)
#define _left id * 2, l, mid
#define _right id * 2 + 1, mid + 1, r
#define cntbit(x) __builtin_popcountll(x)
#define fi(i, a, b) for(int i = a; i <= b; i++)
#define fid(i, a, b) for(int i = a; i >= b; i--)
#define maxn (int) 1e6 + 7

using namespace std;

const ll mod = 1e9 + 7; //972663749
const ll base = 911382323;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

ll GetRandom(ll l, ll r)
{
    return uniform_int_distribution<ll> (l, r)(rng);
}

int n, q;
int a[maxn];

struct BIT {
    int bit[maxn];
    void update(int l, int r, int val) {
        if(l > r) swap(l, r);
        for(; l < maxn; l += (l & -l)) bit[l] += val;
        for(++r; r < maxn; r += (r & -r)) bit[r] -= val;
    }

    int get(int x, int ans = 0) {
        for(; x > 0; x -= (x & -x)) ans += bit[x];
        return ans;
    }
} Bit;

void solve()
{

    cin >> n >> q;
    fi(i, 1, n) {
        cin >> a[i];
        if(i > 1) Bit.update(a[i - 1], a[i], 1);
    }

    fi(i, 1, q) {
        int type, x, y;
        cin >> type >> x;

        if(type == 2) cout << Bit.get(x) << '\n';
        else {
            cin >> y;
            if(x > 1) Bit.update(a[x - 1], a[x], -1);
            if(x < n) Bit.update(a[x + 1], a[x], -1);

            a[x] = y;
            if(x > 1) Bit.update(a[x - 1], a[x], 1);
            if(x < n) Bit.update(a[x + 1], a[x], 1);
        }

    }


}


int main()
{

    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    if(fopen(Neco".inp", "r")) {
        freopen(Neco".inp", "r", stdin);
        freopen(Neco".out", "w", stdout);
    }


    int nTest = 1;
//    cin >> nTest;


    while(nTest--)
    {
        solve();
    }


    return 0;
}

Compilation message

game.cpp: In function 'int main()':
game.cpp:82:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   82 |         freopen(Neco".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
game.cpp:83:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   83 |         freopen(Neco".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4696 KB Output is correct
6 Correct 1 ms 4696 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4696 KB Output is correct
6 Correct 1 ms 4696 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 26 ms 6748 KB Output is correct
9 Correct 30 ms 7160 KB Output is correct
10 Correct 30 ms 7252 KB Output is correct
11 Correct 25 ms 6744 KB Output is correct
12 Correct 29 ms 7256 KB Output is correct
13 Correct 28 ms 7160 KB Output is correct

Subtask #3
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4696 KB Output is correct
6 Correct 1 ms 4696 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 26 ms 6748 KB Output is correct
9 Correct 30 ms 7160 KB Output is correct
10 Correct 30 ms 7252 KB Output is correct
11 Correct 25 ms 6744 KB Output is correct
12 Correct 29 ms 7256 KB Output is correct
13 Correct 28 ms 7160 KB Output is correct
14 Correct 39 ms 6992 KB Output is correct
15 Correct 39 ms 6944 KB Output is correct
16 Correct 41 ms 6904 KB Output is correct
17 Correct 39 ms 6996 KB Output is correct
18 Correct 38 ms 6996 KB Output is correct