제출 #571439

#제출 시각아이디문제언어결과실행 시간메모리
571439AzamatRustamovHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++14
17 / 100
3077 ms6272 KiB
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, m; cin >> n >> m; int w[n]; for (int i=0; i<n; i++) cin >> w[i]; while (m--) { int l, r, k, x, y=1; cin >> l >> r >> k; x = w[l-1]; for (int i=l; i<r; i++) { if (x > w[i] && x + w[i] > k) { y = 0; break; } else if (x < w[i]) x = w[i]; } cout << y << '\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...