oj.uz

답안 #35056

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
35056 2017-11-17T20:27:33 Z model_code Simple game (IZhO17_game) C++11
100 / 100
 119 ms 6388 KB 
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <bitset>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <cassert>
#include <queue>

#define mp make_pair
#define pb push_back


typedef long long ll;
typedef long double ld;

using namespace std;
const int MAXN = 120000;
const int MX = 1000010;

int n, m;
int h[MAXN];
int fv[MX];

void add(int x, int d) {
	for (; x < MX; x |= (x + 1))
		fv[x] += d;
}

int get(int x) {
	int ans = 0;
	for (; x >= 0; x = (x & (x + 1)) - 1)
		ans += fv[x];
	return ans;
}



int main() {
	scanf("%d%d", &n, &m);
	for (int i = 0; i < n; ++i)
		scanf("%d", h + i);
	for (int i = 0; i < n - 1; ++i) {
		add(min(h[i], h[i + 1]), 1);
		add(max(h[i], h[i + 1]), -1);
	}
	for (int i = 0; i < m; ++i) {
		int t;
		scanf("%d", &t);
		if (t == 1) {
			int p, v;
			scanf("%d%d", &p, &v);
			--p;
			if (p < n - 1) {
				add(min(h[p], h[p + 1]), -1);
				add(max(h[p], h[p + 1]), 1);
				add(min(v, h[p + 1]), 1);
				add(max(v, h[p + 1]), -1);
			}
			if (p > 0) {
				add(min(h[p], h[p - 1]), -1);
				add(max(h[p], h[p - 1]), 1);
				add(min(v, h[p - 1]), 1);
				add(max(v, h[p - 1]), -1);
			}
			h[p] = v;
		}
		else {
			int x;
			scanf("%d", &x);
			printf("%d\n", get(x));
		}
	}
	return 0;
}

Compilation message

game.cpp: In function 'int main()':
game.cpp:45:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &m);
                       ^
game.cpp:47:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", h + i);
                     ^
game.cpp:54:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &t);
                  ^
game.cpp:57:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d%d", &p, &v);
                         ^
game.cpp:75:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d", &x);
                   ^

Subtask #1
22.0 / 22.0

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

Subtask #2
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 6388 KB Output is correct
2 Correct 3 ms 6388 KB Output is correct
3 Correct 3 ms 6388 KB Output is correct
4 Correct 0 ms 6388 KB Output is correct
5 Correct 0 ms 6388 KB Output is correct
6 Correct 3 ms 6388 KB Output is correct
7 Correct 0 ms 6388 KB Output is correct
8 Correct 49 ms 6388 KB Output is correct
9 Correct 89 ms 6388 KB Output is correct
10 Correct 79 ms 6388 KB Output is correct
11 Correct 46 ms 6388 KB Output is correct
12 Correct 63 ms 6388 KB Output is correct
13 Correct 66 ms 6388 KB Output is correct

Subtask #3
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 6388 KB Output is correct
2 Correct 3 ms 6388 KB Output is correct
3 Correct 3 ms 6388 KB Output is correct
4 Correct 0 ms 6388 KB Output is correct
5 Correct 0 ms 6388 KB Output is correct
6 Correct 3 ms 6388 KB Output is correct
7 Correct 0 ms 6388 KB Output is correct
8 Correct 49 ms 6388 KB Output is correct
9 Correct 89 ms 6388 KB Output is correct
10 Correct 79 ms 6388 KB Output is correct
11 Correct 46 ms 6388 KB Output is correct
12 Correct 63 ms 6388 KB Output is correct
13 Correct 66 ms 6388 KB Output is correct
14 Correct 119 ms 6388 KB Output is correct
15 Correct 109 ms 6388 KB Output is correct
16 Correct 89 ms 6388 KB Output is correct
17 Correct 119 ms 6388 KB Output is correct
18 Correct 113 ms 6388 KB Output is correct