oj.uz

답안 #57433

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
57433 2018-07-15T03:21:39 Z Benq Simple game (IZhO17_game) C++14
100 / 100
 135 ms 22812 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;


template<class T, int SZ> struct BIT {
    T bit[SZ+1];
    
    BIT() { memset(bit,0,sizeof bit); }
    
    void upd(int k, T val) { // add val to index k
        for( ;k <= SZ; k += (k&-k)) bit[k] += val;
    }
    
    T query(int k) {
        T temp = 0;
        for (;k > 0;k -= (k&-k)) temp += bit[k];
        return temp;
    }
    T query(int l, int r) { return query(r)-query(l-1); } // range query [l,r]
};

BIT<int,1000000> B;
int N,M,h[MX];

void ins(int a, int b, int c = 1) {
    if (a > b) swap(a,b);
    B.upd(a,c);
    B.upd(b+1,-c);
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N >> M;
    FOR(i,1,N+1) cin >> h[i];
    FOR(i,1,N) ins(h[i],h[i+1]);
    F0R(i,M) {
        int t; cin >> t;
        if (t == 1) {
            int pos, val; cin >> pos >> val;
            if (pos > 1) {
                ins(h[pos-1],h[pos],-1);
                ins(h[pos-1],val,1);
            }
            if (pos < N) {
                ins(h[pos],h[pos+1],-1);
                ins(val,h[pos+1],1);
            }
            h[pos] = val;
        } else {
            int pos; cin >> pos;
            cout << B.query(pos) << "\n";
        }
    }
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4344 KB Output is correct
2 Correct 7 ms 4588 KB Output is correct
3 Correct 7 ms 4588 KB Output is correct
4 Correct 7 ms 4588 KB Output is correct
5 Correct 6 ms 4588 KB Output is correct
6 Correct 8 ms 4708 KB Output is correct
7 Correct 6 ms 4832 KB Output is correct

Subtask #2
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4344 KB Output is correct
2 Correct 7 ms 4588 KB Output is correct
3 Correct 7 ms 4588 KB Output is correct
4 Correct 7 ms 4588 KB Output is correct
5 Correct 6 ms 4588 KB Output is correct
6 Correct 8 ms 4708 KB Output is correct
7 Correct 6 ms 4832 KB Output is correct
8 Correct 85 ms 6144 KB Output is correct
9 Correct 112 ms 8228 KB Output is correct
10 Correct 63 ms 9936 KB Output is correct
11 Correct 59 ms 10168 KB Output is correct
12 Correct 65 ms 12020 KB Output is correct
13 Correct 76 ms 13436 KB Output is correct

Subtask #3
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4344 KB Output is correct
2 Correct 7 ms 4588 KB Output is correct
3 Correct 7 ms 4588 KB Output is correct
4 Correct 7 ms 4588 KB Output is correct
5 Correct 6 ms 4588 KB Output is correct
6 Correct 8 ms 4708 KB Output is correct
7 Correct 6 ms 4832 KB Output is correct
8 Correct 85 ms 6144 KB Output is correct
9 Correct 112 ms 8228 KB Output is correct
10 Correct 63 ms 9936 KB Output is correct
11 Correct 59 ms 10168 KB Output is correct
12 Correct 65 ms 12020 KB Output is correct
13 Correct 76 ms 13436 KB Output is correct
14 Correct 117 ms 15056 KB Output is correct
15 Correct 134 ms 17104 KB Output is correct
16 Correct 110 ms 18904 KB Output is correct
17 Correct 135 ms 20948 KB Output is correct
18 Correct 128 ms 22812 KB Output is correct