oj.uz

Submission #671928

# Submission time Handle Problem Language Result Execution time Memory
671928 2022-12-14T09:35:10 Z ghostwriter Simple game (IZhO17_game) C++17
100 / 100
 51 ms 6848 KB 
// #pragma GCC optimize ("Ofast")
// #pragma GCC target ("avx2")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
    #include <debug.h>
#else
    #define debug(...)
#endif
#define ft front
#define bk back
#define st first
#define nd second
#define ins insert
#define ers erase
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define bg begin
#define ed end
#define all(x) (x).bg(), (x).ed()
#define sz(x) (int)(x).size()
// #define int long long
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
#define FOR(i, l, r) for (int i = (l); i <= (r); ++i)
#define FOS(i, r, l) for (int i = (r); i >= (l); --i)
#define FRN(i, n) for (int i = 0; i < (n); ++i)
#define FSN(i, n) for (int i = (n) - 1; i >= 0; --i)
#define EACH(i, x) for (auto &i : (x))
#define WHILE while
template<typename T> T gcd(T a, T b) { T d2 = (a | b) & -(a | b); a /= d2; b /= d2; WHILE(b) { a = a % b; swap(a, b); } return a * d2; }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
void _assert(bool statement) { if (statement) return; cerr << "\n>> Assertion failed!\n"; exit(0); }
void _assert(bool statement, const str &message) { if (statement) return; cerr << "\n>> Assertion failed: " << message << '\n'; exit(0); }
void _error(const str &message) { cerr << "\n>> Error: " << message << '\n'; exit(0); }
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
----------------------------------------------------------------
    END OF TEMPLATE
----------------------------------------------------------------
    Tran The Bao - ghostwriter
    Training for VOI23 gold medal
----------------------------------------------------------------
    GOAT
----------------------------------------------------------------
*/
const int N = 1e5 + 5;
const int H = 1e6 + 5;
int n, m, h[N], f[H];
void upd(int pos, int v) { for (int i = pos; i < H; i += (i & -i)) f[i] += v; }
void upd(int l, int r, int v) { upd(l, v); upd(r + 1, -v); }
int get(int pos) { int rs = 0; for (int i = pos; i > 0; i -= (i & -i)) rs += f[i]; return rs; }
void add(int i) { if (i < 1 || i >= n) return; upd(min(h[i], h[i + 1]), max(h[i], h[i + 1]), 1); }
void del(int i) { if (i < 1 || i >= n) return; upd(min(h[i], h[i + 1]), max(h[i], h[i + 1]), -1); }
void input(int test_id) {
	cin >> n >> m;
	FOR(i, 1, n) cin >> h[i];
	FOR(i, 1, n - 1) add(i);
}
void solve(int test_id) {
	WHILE(m--) {
		int t;
		cin >> t;
		if (t == 1) {
			int pos, val;
			cin >> pos >> val;
			del(pos - 1);
			del(pos);
			h[pos] = val;
			add(pos - 1);
			add(pos);
			continue;
		}
		int h;
		cin >> h;
		cout << get(h) << '\n';
	}
}
void reinit(int test_id) {

}
signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);
    int test_num = 1;
    // cin >> test_num; // comment if the problem does not requires multitest
    FOR(i, 1, test_num) {
        input(i); // input in noninteractive problems for case #i
        solve(i); // main function to solve case #i
        reinit(i); // reinit global data to default used in case #i
    }
    #ifdef LOCAL
        cerr << "\nTime: " << setprecision(5) << fixed << (ldb)clock() / CLOCKS_PER_SEC << "ms.\n";
    #endif
    return 0;
}
/*
3 3
1 5 1
2 3
1 1 5
2 3
----------------------------------------------------------------
From Benq:
    stuff you should look for
        * int overflow, array bounds
        * special cases (n=1?)
        * do smth instead of nothing and stay organized
        * WRITE STUFF DOWN
        * DON'T GET STUCK ON ONE APPROACH
----------------------------------------------------------------
*/

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 4056 KB Output is correct
3 Correct 2 ms 4052 KB Output is correct
4 Correct 2 ms 4052 KB Output is correct
5 Correct 2 ms 4052 KB Output is correct
6 Correct 2 ms 4052 KB Output is correct
7 Correct 1 ms 340 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 4056 KB Output is correct
3 Correct 2 ms 4052 KB Output is correct
4 Correct 2 ms 4052 KB Output is correct
5 Correct 2 ms 4052 KB Output is correct
6 Correct 2 ms 4052 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 32 ms 1748 KB Output is correct
9 Correct 37 ms 6788 KB Output is correct
10 Correct 39 ms 6832 KB Output is correct
11 Correct 33 ms 1616 KB Output is correct
12 Correct 33 ms 2760 KB Output is correct
13 Correct 34 ms 2808 KB Output is correct

Subtask #3
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 4056 KB Output is correct
3 Correct 2 ms 4052 KB Output is correct
4 Correct 2 ms 4052 KB Output is correct
5 Correct 2 ms 4052 KB Output is correct
6 Correct 2 ms 4052 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 32 ms 1748 KB Output is correct
9 Correct 37 ms 6788 KB Output is correct
10 Correct 39 ms 6832 KB Output is correct
11 Correct 33 ms 1616 KB Output is correct
12 Correct 33 ms 2760 KB Output is correct
13 Correct 34 ms 2808 KB Output is correct
14 Correct 48 ms 6848 KB Output is correct
15 Correct 49 ms 6736 KB Output is correct
16 Correct 48 ms 6732 KB Output is correct
17 Correct 49 ms 6820 KB Output is correct
18 Correct 51 ms 6748 KB Output is correct