oj.uz

답안 #890436

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
890436 2023-12-21T08:58:48 Z alex_2008 Simple game (IZhO17_game) C++14
22 / 100
 1000 ms 5460 KB 
#include <bits/stdc++.h>
using namespace std;
 
const int N=1e5+5, M=1e6+10;
int a[N], b[M];
int n,m;
 
void precalc(){
	for(int i=0; i<n-1; i++){
		for(int j = min(a[i], a[i+1]); j <= max(a[i], a[i+1]); j++){
			b[j]++;
		}
		
	}
}
 
int main() {
	cin>>n>>m;
	int mx=-1;
	for(int i=0; i<n; i++){cin>>a[i]; mx=max(mx, a[i]);}
	if(n <= 1000 && m<=1000){
		for(int i=0; i<m; i++){
			int q;
			cin>>q;
			if(q==2){
				long long anss=0;
				int h;
				cin>>h;
				for(int i=0; i<n-1; i++){
					if(a[i] >= h && a[i+1] <= h)anss++;
					else if(a[i] <= h && a[i+1] >= h)anss++;
				}
				cout<<anss<<endl;
			}else{
				int c,d;
				cin>>c>>d;
				a[c-1] = d;
			}
		}
		return 0;
	}
	precalc();
//	for(int i=1; i<=mx; i++)cout<<b[i]<<" ";
//	cout<<endl;
	for(int i=0; i<m; i++){
		int q;
		cin>>q;
		if(q==2){
			int h;
			cin>>h;
			cout<<b[h]<<"\n";
		}else{
			int a,b;
			cin>>a>>b;
		}
	}
	
}

Subtask #1
22.0 / 22.0

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

Subtask #2
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 4 ms 2396 KB Output is correct
3 Correct 3 ms 2500 KB Output is correct
4 Correct 5 ms 2512 KB Output is correct
5 Correct 3 ms 2396 KB Output is correct
6 Correct 3 ms 2396 KB Output is correct
7 Correct 3 ms 2396 KB Output is correct
8 Correct 153 ms 3328 KB Output is correct
9 Execution timed out 1048 ms 5460 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #3
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 4 ms 2396 KB Output is correct
3 Correct 3 ms 2500 KB Output is correct
4 Correct 5 ms 2512 KB Output is correct
5 Correct 3 ms 2396 KB Output is correct
6 Correct 3 ms 2396 KB Output is correct
7 Correct 3 ms 2396 KB Output is correct
8 Correct 153 ms 3328 KB Output is correct
9 Execution timed out 1048 ms 5460 KB Time limit exceeded
10 Halted 0 ms 0 KB -