제출 #1143577

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1143577		crispxx	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++20	8 / 100	3095 ms	42372 KiB

sortbooks

	/**
	 *    author: a.k
	 *    created: idk
	**/
	#include <bits/stdc++.h>
	using namespace std;
	 
	#define all(x) x.begin(), x.end()
	#define int long long
	#define nl '\n'

	signed main() {
		ios::sync_with_stdio(false);
		cin.tie(nullptr);
		
		int n, m; cin >> n >> m;
		
		vector<int> a(n);
		
		for(auto &u : a) cin >> u;
		
		while(m--) {
			int l, r, k; cin >> l >> r >> k;
			l--;
			
			priority_queue<int> pq;
			for(int i = l; i < r; i++) pq.emplace(a[i]);
					
			bool flag = true;
			
			while(!pq.empty()) {
				int u = pq.top();
				pq.pop();
				
				set<int> st;
				
				for(int i = r - 1; i >= l; i--) {
					if(a[i] == u) {
						auto it = st.upper_bound(k - a[i]);
						if(it != st.end()) flag = false;
						break;
					}
					if(a[i] < u) st.emplace(a[i]);
				}
				
				if(!flag) break;
			}
			
			cout << flag << nl;
		}
	}

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