Submission #1093230

#TimeUsernameProblemLanguageResultExecution timeMemory
1093230andrewpHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++14
8 / 100
3067 ms14072 KiB
//Dedicated to my love, ivaziva #pragma GCC optimize("Ofast") #include <bits/stdc++.h> using namespace std; using pii = pair<int, int>; using ll = int64_t; #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define dbg(x) cerr << #x << ": " << x << '\n'; int32_t main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); cerr.tie(nullptr); int n, q; cin >> n >> q; vector<int> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } while (q--) { int l, r, k; cin >> l >> r >> k, l--, r--; int ans = 0; for (int i = l; i <= r; i++) { for (int j = i - 1; j >= l; j--) { if (a[j] > a[i]) { ans = max(ans, a[i] + a[j]); break; } } } cout << (ans <= k ? '1' : '0') << '\n'; } return 0; }
#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...