oj.uz

답안 #386209

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
386209 2021-04-06T05:29:07 Z Kalashnikov Simple game (IZhO17_game) C++17
0 / 100
 4 ms 4076 KB 
#include <bits/stdc++.h>
 
#define ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define all(a) a.begin() , a.end()
#define F first
#define S second
 
using namespace std;
using ll = long long;
 
const int N = 1e6+5 , inf = 2e9 + 7;
const ll INF = 1e18 ,   mod = 1e9+7 , P = 6547;

int a[N] , f[N];

void upd(int pos , int val) {
	for(; pos < N; pos |= pos+1) {
		f[pos] += val;
	}
}

int get(int x) {
	int res = 0;
	for(; x > 0; x &= x+1 , x--) {
		res += f[x];
	}
	return res;
}

void solve() {
	int n , m;
	cin >> n >> m;
	for(int i = 1; i <= n; i ++) {
		cin >> a[i];
		if(i != 1) {
			upd(min(a[i] , a[i-1]) , 1);
			upd(max(a[i] , a[i-1]) , -1);
		}
	}
	while(m --) {
		int t;
		cin >> t;
		if(t == 1) {
			int i , val;
			cin >> i >> val;
			if(i != 1) {
				upd(min(a[i] , a[i-1]) , -1);
				upd(max(a[i] , a[i-1]) , 1);
			}
			if(i != n) {
				upd(min(a[i] , a[i+1]) , -1);
				upd(max(a[i] , a[i+1]) , 1);
			}
			a[i] = val;
			if(i != 1) {
				upd(min(a[i] , a[i-1]) , -1);
				upd(max(a[i] , a[i-1]) , 1);
			}
			if(i != n) {
				upd(min(a[i] , a[i+1]) , -1);
				upd(max(a[i] , a[i+1]) , 1);
			}
		}
		else {
			int x;
			cin >> x;
			cout << get(x) << '\n';
		}
	}
	
}
/*
*/
main() {
    ios;
    int tt = 1;
    //cin >> tt;
    while(tt --) {
        solve();
    }
    return 0;
}

Compilation message

game.cpp:75:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   75 | main() {
      |      ^

Subtask #1
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 4 ms 4076 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 4 ms 4076 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 4 ms 4076 KB Output isn't correct
3 Halted 0 ms 0 KB -