Submission #1040349

#TimeUsernameProblemLanguageResultExecution timeMemory
1040349vjudge1Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++17
17 / 100
3055 ms14436 KiB
#include <bits/stdc++.h> using namespace std; int a[1000005]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n, m; cin >> n >> m; for (int i = 1; i <= n; i++) cin >> a[i]; while (m--) { int l, r, w; cin >> l >> r >> w; int temp = 0; int temp2 = a[l]; for (int i = l + 1; i <= r; i++) { if (a[i] >= temp2) { temp2 = a[i]; } else { temp = max(temp, temp2 + a[i]); } } if (temp <= w) cout << 1 << "\n"; else cout << 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...