Submission #837038

#	Time	Username	Problem	Language	Result	Execution time	Memory
837038		MODDI	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	0 / 100	3018 ms	37088 KiB

sortbooks

#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--;
		bool can = true;
		set<int> store;
		set<int> s;
		for(int i = l; i <= r; i++)	s.insert(arr[i]);
		
		vi arrr;
		for(auto t : s)	arrr.pb(t);
		
		int id = arrr.size()-1;
		for(int i = r; i >= l; i--){
			while(id>=0 && store.find(arrr[id]) != store.end()){
				store.erase(arrr[id]);id--;
			}
//			cout<<i<<endl;
//			for(auto t : store)
//				cout<<t<<" ";
//			cout<<endl;
			if(store.size() == 0)	store.insert(arr[i]);
			else{
				if(arr[i] + *store.rbegin() > k){
					can = false;
					break;
				}
				else	store.insert(arr[i]);
			}
		}
		cout<<can<<endl;
	}

	return 0;
}

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