Submission #1094883

#TimeUsernameProblemLanguageResultExecution timeMemory
1094883KerimHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++17
17 / 100
3063 ms57164 KiB
#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 <= i; j++) mx = max(mx, F[j]); ans[it->ss]=mx<=k[it->ss]; } } for(int i=1;i<=q;i++) printf("%d\n",ans[i]); return 0; }

Compilation message (stderr)

sortbooks.cpp: In function 'int main()':
sortbooks.cpp:26:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |     scanf("%d%d",&n,&q);
      |     ~~~~~^~~~~~~~~~~~~~
sortbooks.cpp:28:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 |         scanf("%d",arr+i);
      |         ~~~~~^~~~~~~~~~~~
sortbooks.cpp:31:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |         scanf("%d%d%d",&l,&r,&k[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...