# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
334086 | boykut | Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) | C++14 | 534 ms | 10348 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
vector < int > w(n);
for (int i = 0; i < n; i++)
cin >> w[i];
vector < int > dp(n);
dp[0] = 1;
for (int i = 1; i < n; i++) {
if (w[i] >= w[i - 1])
dp[i] = dp[i - 1] + 1;
else
dp[i] = 1;
}
while (m--) {
int l, r, k;
cin >> l >> r >> k;
l--; r--;
/*vector < int > a;
for(int i = l; i <= r; i++)
a.push_back(w[i]);
/*for(int k = 0; k < a.size(); k++) {
for (int i = 0; i < a.size(); i++) {
for (int j = i + 1; j < a.size(); j++) {
if (a[i] > a[j] && a[i]+a[j] <= k)
swap(a[i], a[j]);
}
}
}
bool x = true;
for(int i = 0; i < a.size(); i++)
cout << a[i] << ' ';
x &= a[i] >= a[i-1];
if (x) cout << "1\n";
else cout << "0\n";
cout << '\n';*/
if(r-l+1 <= dp[r]) cout << "1\n";
else cout << "0\n";
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |