oj.uz

답안 #837030

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
837030 2023-08-24T20:00:34 Z MODDI Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
0 / 100
 3000 ms 12032 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<long long, long long> pll;
typedef pair<int,int> pii;
typedef vector<long long> vl;
typedef vector<int> vi;
int n, m;
vi arr;
int main(){
	cin>>n>>m;
	for(int i = 0; i < n; i++){
		int a;
		cin>>a;
		arr.pb(a);
	}
	while(m--){
		int l, r, k;
		cin>>l>>r>>k;
		l--; r--;
		// minimum and maximum number that are not in the desired place
		vi here;
		for(int i = l; i <= r; i++)	here.pb(i);
			
		sort(here.begin(), here.end());
		int s = 0, e = (int)here.size()-1;
		while(s <(int)here.size() && arr[l+s] == here[s])	s++;
		while(e >= 0 && arr[r-e] == here[e]) e--;
		if(e <= s)	cout<<0<<endl;
		else{
			int maxi = 0, mini = 1e9;
			for(int i = s; i <= e; i++){
				maxi = max(maxi, arr[i]);
//				mini = min(mini, arr[i]);
			}
			for(int i = l; i <= r; i++)
				mini = min(mini, arr[i]);
			if(maxi + mini <= k)	cout<<1<<endl;
			else cout<<0<<endl;	
		}
		
	}

	return 0;
}

Subtask #1
0 / 8.0

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

Subtask #2
0 / 9.0

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

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3051 ms 12032 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3057 ms 1680 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

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

Subtask #6
0 / 23.0

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