oj.uz

답안 #499356

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
499356 2021-12-28T04:59:07 Z tmn2005 Simple game (IZhO17_game) C++17
22 / 100
 1000 ms 1608 KB 
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;

#define ar array
#define fr first
#define sc second

#define vec vector
#define ret return

#define ins insert
#define mk make_pair
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_back

#define int long long

#define pii pair<int,int>

#define all(s) s.begin(), s.end()
#define allr(s) s.rbegin(), s.rend()

#define NeedForSpeed ios::sync_with_stdio(0),cin.tie(0);
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
const int N=1e6+12,INF=1e9,mod = 1e9+7;
bool iswowel(char n){ n = toupper(n); if(n == 'A' || n == 'O' || n == 'U' || n == 'E' || n == 'I') return true; else return false;}
int n,m,k,x,y,l,r,o,ans,res,ok,mx,mn = INF;
int a[N],b,c;

int get(int x){
	int r = 0;
	for(int i=2; i<=n; i++){
		if(a[i-1] < x && x < a[i] || a[i-1] > x && x > a[i])r++;
	}
	ret r;
}
main(){
	NeedForSpeed
	//freopen ("game.in","r", stdin);
	//freopen ("game.out","w", stdout);
    cin>>n>>m;
    for(int i=1; i<=n; i++){
    	cin>>a[i];
	}
	while(m--){
		cin>>o;
		if(o == 1){
			cin>>x>>y;
			a[x] = y;
		}
		else{
			cin>>x;
			cout<<get(x)<<endl;
		}
	}



	return 0;
}

Compilation message

game.cpp: In function 'long long int get(long long int)':
game.cpp:37:17: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   37 |   if(a[i-1] < x && x < a[i] || a[i-1] > x && x > a[i])r++;
      |      ~~~~~~~~~~~^~~~~~~~~~~
game.cpp: At global scope:
game.cpp:41:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   41 | main(){
      | ^~~~

Subtask #1
22.0 / 22.0

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

Subtask #2
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 3 ms 328 KB Output is correct
3 Correct 3 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 3 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Execution timed out 1086 ms 1608 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #3
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 3 ms 328 KB Output is correct
3 Correct 3 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 3 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Execution timed out 1086 ms 1608 KB Time limit exceeded
9 Halted 0 ms 0 KB -