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;
#define endl '\n'
#define ll long long
#define all(a) a.begin(), a.end()
#define fastio ios::sync_with_stdio(0), cin.tie(0);
#define fs first
#define ss second
#define print(a) \
for (auto x : a) \
cout << x << ' '; \
cout << endl;
#define printmp(a) \
for (auto x : a) \
cout << x.fs << ' ' << x.ss << endl;
void solve()
{
int n, q;
cin >> n >> q;
vector<int> a(n);
int mn = 1e9;
for (int i = 0; i < n; i++)
cin >> a[i], mn = min(mn, a[i]);
vector<int> dp(n);
for(int i = 0; i < n - 1; i ++)
dp[i + 1] = a[i + 1] < a[i];
for(int i = 1; i < n; i ++)
dp[i] += dp[i - 1];
while (q--)
{
int l, r, k;
cin >> l >> r >> k;
bool flag = 1;
l--;
r--;
if(mn > k){
cout << (dp[l] == dp[r]) << endl;
continue;
}
int mx = 0;
for (int i = l; i <= r; i++)
{
if(mx > a[i] and mx + a[i] > k){
flag = 0;
break;
}
mx = max(mx, a[i]);
}
if (flag)
cout << 1 << endl;
else
cout << 0 << endl;
}
}
signed main()
{
fastio
int t = 1;
// cin >> t;
while (t--)
{
solve();
cout << endl;
}
}
# | 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... |