제출 #1093939

#제출 시각아이디문제언어결과실행 시간메모리
1093939stdfloatHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++17
0 / 100
3056 ms38228 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--; bool tr = true; for (int i = l; i < r && tr; i++) { for (int j = i + 1; j < n && tr; j++) if (a[i] > a[j]) tr = (a[i] + a[j] <= k); } cout << tr << '\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...