# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
401289 | NintsiChkhaidze | Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) | C++14 | 3060 ms | 8484 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>
#define pb push_back
#define mod 1000000007
#define ll long long
#define int long long
using namespace std;
const int N = 200005;
int a[N],b[N];
main (){
ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);
int n,q;
cin>>n>>q;
for (int i=1;i<=n;i++)
cin>>a[i];
while(q--){
int l,r,k;
cin>>l>>r>>k;
bool q=1;
b[l] = 0;
for (int i= l + 1;i<=r;i++){
b[i] = b[i - 1];
if (b[i] < a[i - 1]) b[i] = a[i - 1];
if (b[i] > a[i] && b[i] + a[i] > k) {q=0; break;}
}
cout<<q<<"\n";
}
}
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... |