# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1071393 | vjudge1 | Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) | C++17 | 3066 ms | 31364 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;
#define int long long
#define pb push_back
#define sz(x) x.size()
#define nl '\n'
#define F first
#define S second
const int N = 1e6 + 1;
const int inf = 1e18;
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n, q;
cin >>n >>q;
int a[n + 1];
for( int i = 1; i <= n; ++i )
cin >>a[i];
while( q-- )
{
int l, r, k;
bool ch = false;
cin >>l >>r >>k;
vector< int >v;
v.pb(0);
for( int i = l; i <= r; ++i )
v.pb( a[i] );
int p[r - l + 2];
p[0] = 0;
for( int i = 1; i < sz(v); ++i )
{
p[i] = max(p[i - 1], v[i]);
if( i > 0 && p[i - 1] > v[i] && p[i - 1] + v[i] > k )
ch = true;
}
cout <<(ch ? 0 : 1) <<nl;
}
}
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... |