oj.uz

Submission #570713

# Submission time Handle Problem Language Result Execution time Memory
570713 2022-05-31T06:38:04 Z saarang123 Simple game (IZhO17_game) C++17
22 / 100
 1000 ms 1240 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

const int MXN = 100 * 1000 + 3;
int bit[MXN * 10], a[MXN], n, q;

void upd(int x, int v = 1) {
	for(; x <= n; x += (x & -x))
		bit[x] += v;
}

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

int qry(int x) {
	int res = 0;
	for(; x > 0; x -= (x & -x))
		res += bit[x];
	return res;
}

signed main() {
    std::ios::sync_with_stdio(0);
    std::cin.tie(0);
    cin >> n >> q;
    for(int i = 1; i <= n; i++) {
    	cin >> a[i];
    	if(i > 1) {
    		int x = min(a[i - 1], a[i]);
    		int y = max(a[i - 1], a[i]);
    		upd(x, y, 1);
    	}
    }
    while(q--) {
    	int tp; cin >> tp;
    	if(tp == 1) {
    		int i, val;
    		cin >> i >> val;
    		if(i > 1) {
	    		int x = min(a[i - 1], a[i]);
	    		int y = max(a[i - 1], a[i]);
	    		upd(x, y, -1);
    		}
    		if(i < n) {
    			int x = min(a[i + 1], a[i]);
	    		int y = max(a[i + 1], a[i]);
	    		upd(x, y, -1);
    		}
    		a[i] = val;
    		if(i > 1) {
	    		int x = min(a[i - 1], a[i]);
	    		int y = max(a[i - 1], a[i]);
	    		upd(x, y, 1);
    		}
    		if(i < n) {
    			int x = min(a[i + 1], a[i]);
	    		int y = max(a[i + 1], a[i]);
	    		upd(x, y, 1);
    		}
    	} else {
    		int h; cin >> h;
    		//cout << qry(h) << '\n';
    		int ans = 0;
    		for(int i = 2; i <= n; i++)
    			ans += ((a[i - 1] <= h && h <= a[i]) || (a[i - 1] >= h && h >= a[i]));
    		cout << ans << '\n';
    	}
    }
    return 0;
}

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 212 KB Output is correct
3 Correct 3 ms 340 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct

Subtask #2
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 212 KB Output is correct
3 Correct 3 ms 340 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Execution timed out 1068 ms 1240 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #3
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 212 KB Output is correct
3 Correct 3 ms 340 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Execution timed out 1068 ms 1240 KB Time limit exceeded
9 Halted 0 ms 0 KB -