Submission #341854

#TimeUsernameProblemLanguageResultExecution timeMemory
341854boykutHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++14
13 / 100
516 ms10348 KiB
#include <bits/stdc++.h> using namespace std; #define work_with_io ios::sync_with_stdio(0);cin.tie(0); //#define int long long signed main() { std::work_with_io; int q = 1; //cin >> q; while (q--) { int n, m; cin >> n >> m; int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } int dp[n]; dp[0] = 1; for (int i = 1; i < n; i++) { if (a[i] >= a[i - 1]) dp[i] = dp[i - 1] + 1; else dp[i] = 1; } for (int tmp = m; tmp--;) { int l, r, k; cin >> l >> r >> k; l--;r--; if (r-l+1 <= dp[r]) 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...