제출 #1093935

#제출 시각아이디문제언어결과실행 시간메모리
1093935stdfloatHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++17
0 / 100
5004 ms262144 KiB
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

int main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);

	int n, q;
	cin >> n >> q;

	vector<int> a(n);
	for (auto &i : a)
		cin >> i;

	while (q--) {
		int l, r, k;
		cin >> l >> r >> k; l--; r--;

		vector<int> v = a;
		sort(v.begin() + l, v.begin() + r + 1);

		int mn = (int)1e9, mx = -1;
		while (++l <= r) {
			cout << l << ' ' << a[l] << '\n';
			mn = min(mn, a[l]);
			if (a[l] != v[l]) mx = max(mx, a[l]);
		}

		cout << (mx == -1 || mn + mx <= k) << '\n';
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...