제출 #249881

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
249881		TranGiaHuy1508	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	0 / 100	608 ms	16784 KiB

sortbooks

#include <bits/stdc++.h>
using namespace std;

#define int long long

typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;

signed main(){
	int n, m; cin >> n >> m;
	vi w; w.assign(n, 0);
	for (int i=0; i<n; i++) cin >> w[i];
	for (int i=0; i<m; i++){
		int l, r, k;
		cin >> l >> r >> k; l--; r--;
		//Solve
		vii v; v.assign(r-l+1, ii());
		int res=0;
		for (int i=l; i<=r; i++) v[i-l]=ii(w[i], i);
		sort(v.begin(), v.end());
		for (int p=0; p<r-l+1; p++){
			int a = v[p].first;
			int b = v[p].second;
			if (b==0) continue;
			int c = w[max_element(w.begin()+l, w.begin()+l+b)-w.begin()];
			if (a<c) res = max(res, a+c);
			if (res>k) break;
		}
		if (res<=k) cout << 1 << endl;
		else cout << 0 << endl;
		//cout << res << endl;
		//EndSolve
	}
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 9
• Subtask 3: 0 / 13
• Subtask 4: 0 / 17
• Subtask 5: 0 / 30
• Subtask 6: 0 / 23