Submission #338853

# Submission time Handle Problem Language Result Execution time Memory
338853 2020-12-24T05:09:06 Z beksultan04 Monkey and Apple-trees (IZhO12_apple) C++14
0 / 100
412 ms 253164 KB
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scan1(a) scanf("%d",&a);
#define scan2(a,b) scanf("%d %d",&a, &b);
#define scan3(a,b,c) scanf("%d %d %d",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
const int N = 1e7+12,INF=1e9+7;
int der[4*N],pus[4*N];

inline void push(int v,int l,int r){
    if (l > r || pus[v] < 0) ret;
    der[v]=pus[v]*(r-l+1);
    if (l != r) {
        pus[(v<<1)+1]=pus[v];
        pus[v<<1]=pus[v];
    }
    pus[v]=-1;
}

void update(int v,int l,int r,int ql,int qr){
    push(v,l,r);
    if (l > qr || r < ql)ret ;
    if (ql <= l && r <= qr){
        pus[v]=1;
        push(v,l,r);
        ret ;
    }
    else {
        int m = l+r>>1;
        push(v,l,r);
        update(v<<1,l,m,ql,qr);
        push(v,l,r);
        update((v<<1)+1,m+1,r,ql,qr);
        push(v,l,r);
        der[v] = max(der[v<<1]+der[(v<<1)+1],der[v]);
    }

}

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

main(){
    int i,j,t,k,c=0,n;
    scan1(n)
    for (i=0;i<=N;++i){
        pus[i]=-1;
    }
    for (i=0;i<n;++i){
        int a,l,r;
        scan3(a,l,r)
        if (a==1){
            c = get_ans(1,1,N-11,min(l+c,N-11),min(r+c,N-11));
            cout <<c<<"\n";
        }
        else {
            update(1,1,N-11,min(l+c,N-11),min(r+c,N-11));
        }

    }
}

Compilation message

apple.cpp: In function 'void update(int, int, int, int, int)':
apple.cpp:41:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   41 |         int m = l+r>>1;
      |                 ~^~
apple.cpp: In function 'int get_ans(int, int, int, int, int)':
apple.cpp:57:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   57 |     int m = l+r>>1;
      |             ~^~
apple.cpp: At global scope:
apple.cpp:61:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   61 | main(){
      |      ^
apple.cpp: In function 'int main()':
apple.cpp:62:11: warning: unused variable 'j' [-Wunused-variable]
   62 |     int i,j,t,k,c=0,n;
      |           ^
apple.cpp:62:13: warning: unused variable 't' [-Wunused-variable]
   62 |     int i,j,t,k,c=0,n;
      |             ^
apple.cpp:62:15: warning: unused variable 'k' [-Wunused-variable]
   62 |     int i,j,t,k,c=0,n;
      |               ^
apple.cpp:11:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   11 | #define scan1(a) scanf("%d",&a);
      |                  ~~~~~^~~~~~~~~
apple.cpp:63:5: note: in expansion of macro 'scan1'
   63 |     scan1(n)
      |     ^~~~~
apple.cpp:13:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   13 | #define scan3(a,b,c) scanf("%d %d %d",&a,&b,&c);
      |                      ~~~~~^~~~~~~~~~~~~~~~~~~~~
apple.cpp:69:9: note: in expansion of macro 'scan3'
   69 |         scan3(a,l,r)
      |         ^~~~~
# Verdict Execution time Memory Grader output
1 Correct 22 ms 39532 KB Output is correct
2 Correct 23 ms 39532 KB Output is correct
3 Correct 23 ms 39532 KB Output is correct
4 Correct 43 ms 53868 KB Output is correct
5 Correct 46 ms 55788 KB Output is correct
6 Correct 46 ms 54892 KB Output is correct
7 Correct 46 ms 55916 KB Output is correct
8 Correct 188 ms 122988 KB Output is correct
9 Correct 328 ms 147948 KB Output is correct
10 Correct 361 ms 191724 KB Output is correct
11 Correct 394 ms 233196 KB Output is correct
12 Correct 412 ms 253164 KB Output is correct
13 Incorrect 82 ms 62956 KB Output isn't correct
14 Halted 0 ms 0 KB -