Submission #335834

#	Time	Username	Problem	Language	Result	Execution time	Memory
335834		beksultan04	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	0 / 100	1509 ms	35476 KiB

sortbooks

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define OK puts("OK");
#define fr first
#define sc second
#define ret return
#define scan1(a) scanf("%lld",&a);
#define scan2(a,b) scanf("%lld %lld",&a, &b);
#define scan3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define pb push_back
#define endi puts("");
const int N = 1e6+12,INF=1e9+7;
int q[N],der[4*N],a[N];
void build(int v,int l,int r){
    if (l==r){
        der[v]=q[l];
    }
    else {
        int m=l+r>>1;
        build(v<<1,l,m);
        build((v<<1)+1,m+1,r);
        der[v] = max(der[v<<1],der[(v<<1)+1]);
    }
}

int get_ans(int v,int l,int r,int ql,int qr){
    if (qr < l || ql > r)ret 0;
    if (ql <= l && r <= qr)ret der[v];
    int m  = l+r>>1;
    ret max(get_ans(v<<1,l,m,ql,qr),get_ans((v<<1)+1,m+1,r,ql,qr));
}

main(){
    int n,t,i,j,k;
    scan2(n,t)
    for (i=1;i<=n;++i){
        scan1(a[i])
    }
    for (i=1;i<n;++i){
        if (a[i] > a[i+1])
            q[i] = a[i+1]+a[i];
    }
    build(1,1,n);

    while (t--){
        int l,r,k;
        scan3(l,r,k)
        int x = get_ans(1,1,n,l,r);
        cout <<(x<=k)<<"\n";
    }

}

Compilation message (stderr)

sortbooks.cpp: In function 'void build(long long int, long long int, long long int)':
sortbooks.cpp:22:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   22 |         int m=l+r>>1;
      |               ~^~
sortbooks.cpp: In function 'long long int get_ans(long long int, long long int, long long int, long long int, long long int)':
sortbooks.cpp:32:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   32 |     int m  = l+r>>1;
      |              ~^~
sortbooks.cpp: At global scope:
sortbooks.cpp:36:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   36 | main(){
      |      ^
sortbooks.cpp: In function 'int main()':
sortbooks.cpp:37:15: warning: unused variable 'j' [-Wunused-variable]
   37 |     int n,t,i,j,k;
      |               ^
sortbooks.cpp:37:17: warning: unused variable 'k' [-Wunused-variable]
   37 |     int n,t,i,j,k;
      |                 ^
sortbooks.cpp:10:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   10 | #define scan2(a,b) scanf("%lld %lld",&a, &b);
      |                    ~~~~~^~~~~~~~~~~~~~~~~~~~
sortbooks.cpp:38:5: note: in expansion of macro 'scan2'
   38 |     scan2(n,t)
      |     ^~~~~
sortbooks.cpp:9:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    9 | #define scan1(a) scanf("%lld",&a);
      |                  ~~~~~^~~~~~~~~~~
sortbooks.cpp:40:9: note: in expansion of macro 'scan1'
   40 |         scan1(a[i])
      |         ^~~~~
sortbooks.cpp:11:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   11 | #define scan3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
      |                      ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
sortbooks.cpp:50:9: note: in expansion of macro 'scan3'
   50 |         scan3(l,r,k)
      |         ^~~~~

• Subtask 1: 0 / 8
• Subtask 2: 0 / 9
• Subtask 3: 0 / 13
• Subtask 4: 0 / 17
• Subtask 5: 0 / 30
• Subtask 6: 0 / 23