oj.uz

답안 #1086369

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1086369 2024-09-10T10:50:57 Z steveonalex Simple game (IZhO17_game) C++17
100 / 100
 49 ms 6996 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

struct FenwickTree{
    int n;
    vector<int> a;

    FenwickTree(int _n){
        n = _n;
        a.resize(n+1);
    }

    void update(int i, int v){
        while(i <= n){
            a[i] += v;
            i += LASTBIT(i);
        }
    }

    void update(int l, int r, int v){
        update(l, v); update(r + 1, -v);
    }

    int get(int i){
        int ans = 0;
        while(i > 0){
            ans += a[i];
            i -= LASTBIT(i);
        }
        return ans;
    }
};

int main(void){
    ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
    clock_t start = clock();

    int n, q; cin >> n >> q;
    vector<int> a(n+1);
    for(int i = 1; i<=n; ++i) cin >> a[i];

    const int N = 1e6 + 69;
    FenwickTree bit(N);
    for(int i = 1; i<n; ++i){
        bit.update(min(a[i], a[i+1]), max(a[i], a[i+1]), 1);
    }

    while(q--){
        int type; cin >> type;
        if (type == 1){
            int i, val; cin >> i >> val;
            if (i > 1) bit.update(min(a[i-1], a[i]), max(a[i-1], a[i]), -1);
            if (i < n) bit.update(min(a[i+1], a[i]), max(a[i+1], a[i]), -1);

            a[i] = val;

            if (i > 1) bit.update(min(a[i-1], a[i]), max(a[i-1], a[i]), 1);
            if (i < n) bit.update(min(a[i+1], a[i]), max(a[i+1], a[i]), 1);
        }
        else{
            int H; cin >> H;
            cout << bit.get(H) << "\n";
        }
    }

    cerr << "Time elapsed: " << clock() - start << " ms\n";
    return 0;
}

Subtask #1
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4184 KB Output is correct
2 Correct 2 ms 4188 KB Output is correct
3 Correct 2 ms 4188 KB Output is correct
4 Correct 2 ms 4188 KB Output is correct
5 Correct 2 ms 4188 KB Output is correct
6 Correct 2 ms 4188 KB Output is correct
7 Correct 2 ms 4188 KB Output is correct

Subtask #2
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4184 KB Output is correct
2 Correct 2 ms 4188 KB Output is correct
3 Correct 2 ms 4188 KB Output is correct
4 Correct 2 ms 4188 KB Output is correct
5 Correct 2 ms 4188 KB Output is correct
6 Correct 2 ms 4188 KB Output is correct
7 Correct 2 ms 4188 KB Output is correct
8 Correct 24 ms 5520 KB Output is correct
9 Correct 30 ms 6996 KB Output is correct
10 Correct 28 ms 6992 KB Output is correct
11 Correct 24 ms 5600 KB Output is correct
12 Correct 27 ms 6748 KB Output is correct
13 Correct 27 ms 6716 KB Output is correct

Subtask #3
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4184 KB Output is correct
2 Correct 2 ms 4188 KB Output is correct
3 Correct 2 ms 4188 KB Output is correct
4 Correct 2 ms 4188 KB Output is correct
5 Correct 2 ms 4188 KB Output is correct
6 Correct 2 ms 4188 KB Output is correct
7 Correct 2 ms 4188 KB Output is correct
8 Correct 24 ms 5520 KB Output is correct
9 Correct 30 ms 6996 KB Output is correct
10 Correct 28 ms 6992 KB Output is correct
11 Correct 24 ms 5600 KB Output is correct
12 Correct 27 ms 6748 KB Output is correct
13 Correct 27 ms 6716 KB Output is correct
14 Correct 49 ms 6992 KB Output is correct
15 Correct 43 ms 6736 KB Output is correct
16 Correct 41 ms 6996 KB Output is correct
17 Correct 40 ms 6736 KB Output is correct
18 Correct 41 ms 6740 KB Output is correct