Submission #335913

#	Time	Username	Problem	Language	Result	Execution time	Memory
335913		beksultan04	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	0 / 100	3091 ms	262144 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],ans;
vector <int> tr[N*4];
void mer(vector <int> &a,vector <int> &b,vector <int> &v,int &mx){
    int l=0,r=0;
    while (l < a.size() && r < b.size()){
        if (a[l] <= b[r]){
            v.pb(a[l]);
            l++;
        }
        else {
            mx = max(mx,a[l]+b.back());
            v.pb(b[r]);
            r++;
        }
    }
    while (l < a.size()){
        if (!b.empty())
            mx = max(mx,a[l]+b.back());
        v.pb(a[l]);
        l++;
    }
    while (r < b.size()){
        v.pb(b[r]);
        r++;
    }

}

void build(int v,int l,int r){
    if (l==r){
        der[v] = 0;
        tr[v].pb(q[l]);
    }
    else {
        int m=l+r>>1;
        build(v<<1,l,m);
        build((v<<1)+1,m+1,r);
        int mx = max(der[v<<1],der[(v<<1)+1]);
        mer(tr[v<<1],tr[(v<<1)+1],tr[v],mx);
        der[v] = mx;
    }
}

vector <int> get_ans(int v,int l,int r,int ql,int qr){
    if (l> qr || r < ql)ret {};
    if (ql <= l && r <= qr){
        ans = max(ans,der[v]);
        ret tr[v];
    }
    int m = l +r>>1;
    vector <int> a,b,c;
    a = get_ans(v<<1,l,m,ql,qr);
    b = get_ans((v<<1)+1,m+1,r,ql,qr);
    mer(a,b,c,ans);
    ret c;
}
main(){
    int n,t,i,j;
    scan2(n,t)
    for (i=1;i<=n;++i){
        scan1(q[i])
    }
    build(1,1,n);
    while (t--){
        int l,r,k;
        scan3(l,r,k)
        vector <int> v = get_ans(1,1,n,l,r);
        cout <<(ans<=k)<<"\n";
        ans=0;
    }
}

Compilation message (stderr)

sortbooks.cpp: In function 'void mer(std::vector<long long int>&, std::vector<long long int>&, std::vector<long long int>&, long long int&)':
sortbooks.cpp:20:14: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |     while (l < a.size() && r < b.size()){
      |            ~~^~~~~~~~~~
sortbooks.cpp:20:30: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |     while (l < a.size() && r < b.size()){
      |                            ~~^~~~~~~~~~
sortbooks.cpp:31:14: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |     while (l < a.size()){
      |            ~~^~~~~~~~~~
sortbooks.cpp:37:14: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |     while (r < b.size()){
      |            ~~^~~~~~~~~~
sortbooks.cpp: In function 'void build(long long int, long long int, long long int)':
sortbooks.cpp:50:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   50 |         int m=l+r>>1;
      |               ~^~
sortbooks.cpp: In function 'std::vector<long long int> get_ans(long long int, long long int, long long int, long long int, long long int)':
sortbooks.cpp:65:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   65 |     int m = l +r>>1;
      |             ~~^~
sortbooks.cpp: At global scope:
sortbooks.cpp:72:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   72 | main(){
      |      ^
sortbooks.cpp: In function 'int main()':
sortbooks.cpp:73:15: warning: unused variable 'j' [-Wunused-variable]
   73 |     int n,t,i,j;
      |               ^
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:74:5: note: in expansion of macro 'scan2'
   74 |     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:76:9: note: in expansion of macro 'scan1'
   76 |         scan1(q[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:81:9: note: in expansion of macro 'scan3'
   81 |         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