Submission #1014495

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1014495	2024-07-05 04:09:01	vjudge1	Cake 3 (JOI19_cake3)	C++17	100 / 100	737 ms	106824 KiB

cake3

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<bits/stdc++.h>
using namespace std;
#define lolwhy(l,r) (qry(rt[l],rt[r+1],m)-2*cake[r].first+2*cake[l].first)
vector<pair<int,int>> cake;
struct node{
    int l,r,c;
    long long v;
} T[1<<22];
int rt[1<<18],CC,CV;
int nn1(int a,int b){
    T[++CC]={T[a].l,T[a].r,T[a].c+1,T[a].v+b};
    return CC;
}
int nn2(int a,int b){
    T[++CC]={a,b,T[a].c+T[b].c,T[a].v+T[b].v};
    return CC;
}
long long qry(int l,int r,int k){
    if(!r)return 0;
    if(T[r].c-T[l].c==k)
        return T[r].v-T[l].v;
    if(T[T[r].r].c-T[T[l].r].c>k)
        return qry(T[l].r,T[r].r,k);
    return qry(T[l].l,T[r].l,k-T[T[r].r].c+
        T[T[l].r].c)+T[T[r].r].v-T[T[l].r].v;
}
int ad(int i,int l,int r,int p,int v){
    if(l==r)return nn1(i,v);
    if(l+r>>1<p)return nn2(T[i].l,ad(T[i].r,l+r+2>>1,r,p,v));
    return nn2(ad(T[i].l,l,l+r>>1,p,v),T[i].r);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Compilation message (stderr)

cake3.cpp: In function 'int ad(int, int, int, int, int)':
cake3.cpp:29:9: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   29 |     if(l+r>>1<p)return nn2(T[i].l,ad(T[i].r,l+r+2>>1,r,p,v));
      |        ~^~
cake3.cpp:29:48: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   29 |     if(l+r>>1<p)return nn2(T[i].l,ad(T[i].r,l+r+2>>1,r,p,v));
      |                                             ~~~^~
cake3.cpp:30:29: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   30 |     return nn2(ad(T[i].l,l,l+r>>1,p,v),T[i].r);
      |                            ~^~
cake3.cpp: In function 'void solve(int, int, int, int, int)':
cake3.cpp:36:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   36 |     int mid=l+r>>1,op=0;
      |             ~^~

• Subtask 1: 5 / 5
• Subtask 2: 19 / 19
• Subtask 3: 76 / 76