# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1094881 | Kerim | Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) | C++17 | 3054 ms | 76268 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 MAXN 1000009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x) cerr<< #x <<" = "<< x<<endl;
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
int F[MAXN],arr[MAXN],k[MAXN],ans[MAXN];
int d[MAXN];
vector<PII>adj[MAXN];
int main(){
// freopen("file.in", "r", stdin);
int n,q;
scanf("%d%d",&n,&q);
for(int i=1;i<=n;i++)
scanf("%d",arr+i);
for(int i=1;i<=q;i++){
int l,r;
scanf("%d%d%d",&l,&r,&k[i]);
adj[r].pb(mp(l,i));
}
for(int i=1;i<=n;i++){
d[i] = -1;
for (int j = i; j >= 1; j--)
if (arr[j] > arr[i]){
d[i] = j;
break;
}
if(~d[i])
F[d[i]] = max(F[d[i]], arr[i]+arr[d[i]]);
tr(it,adj[i]){
int mx = 0;
for (int j = it->ff; j <= n; j++)
mx = max(mx, F[j]);
if(mx<=k[it->ss])
ans[it->ss]=1;
}
}
for(int i=1;i<=q;i++)
printf("%d\n",ans[i]);
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... |