oj.uz

Submission #953012

# Submission time Handle Problem Language Result Execution time Memory
953012 2024-03-25T10:10:07 Z groshi Food Court (JOI21_foodcourt) C++17
68 / 100
 345 ms 68912 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
int drzewo[4000000][2];
int drzewo2[4000000];
int lazy[4000000];
int t[300000];
int l[300000];
int r[300000];
int c[300000];
int k[300000];
int a[300000];
int b[300000];
int wynik[300000];
vector<pair<int,int> > dodaaj[300000],usun[300000],essa[300000];
int pot=1;
void dodaj(int x,int co,int gdzie)
{
    x++;
    for(;x<=2*1e5;x+=x&-x)
        drzewo[x][gdzie]+=co;
}
int zap(int x,int gdzie)
{
    x++;
    int wynik=0;
    for(;x;x&=(x-1))
        wynik+=drzewo[x][gdzie];
    return wynik;
}
int szukaj(int x,int gdziee)
{
    int gdzie=0;
    for(int i=19;i>=0;i--)
    {
        if((gdzie|(1<<i))<=2*1e5 && drzewo[(gdzie|(1<<i))][gdziee]<x)
        {
            gdzie|=(1<<i);
            x-=drzewo[gdzie][gdziee];
        }
    }
    return gdzie;
}
void propaguj(int x)
{
    drzewo2[x*2]+=lazy[x];
    drzewo2[x*2+1]+=lazy[x];
    lazy[x*2]+=lazy[x];
    lazy[x*2+1]+=lazy[x];
    lazy[x]=0;
}
void dodaj2(int x,int l,int r,int L,int R,int ile)
{
    if(R<l || L>r)
        return;
    if(L<=l && r<=R)
    {
        drzewo2[x]+=ile;
        lazy[x]+=ile;
        return;
    }
    propaguj(x);
    int mid=(l+r)/2;
    dodaj2(x*2,l,mid,L,R,ile);
    dodaj2(x*2+1,mid+1,r,L,R,ile);
    drzewo2[x]=min(drzewo2[x*2],drzewo2[x*2+1]);
}
int zap2(int x,int l,int r,int L,int R)
{
    if(R<l || L>r)
        return 0;
    if(L<=l && r<=R)
        return drzewo2[x];
    propaguj(x);
    int mid=(l+r)/2;
    int wynik=min(zap2(x*2,l,mid,L,R),zap2(x*2+1,mid+1,r,L,R));
    drzewo2[x]=min(drzewo2[x*2],drzewo2[x*2+1]);
    return wynik;
}
int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n,m,q;
    cin>>n>>m>>q;
    while(pot<=q)
        pot*=2;
    pot--;
    for(int i=1;i<=q;i++)
    {
        cin>>t[i];
        if(t[i]==1)
        {
            cin>>l[i]>>r[i]>>c[i]>>k[i];
            dodaaj[l[i]].push_back({i,k[i]});
            dodaaj[r[i]+1].push_back({i,-k[i]});
        }
        else if(t[i]==2)
        {
            cin>>l[i]>>r[i]>>k[i];
            usun[l[i]].push_back({i,k[i]});
            usun[r[i]+1].push_back({i,-k[i]});
        }
        else{
            cin>>a[i]>>b[i];
            essa[a[i]].push_back({i,b[i]});
        }
    }
    for(int i=1;i<=n;i++)
    {
        for(int j=0;j<usun[i].size();j++)
        {
            //cout<<"dodaje "<<usun[i][j].first<<" "<<-usun[i][j].second<<"\n";
            dodaj(usun[i][j].first,-usun[i][j].second,0);
            dodaj2(1,pot+1,q+pot,usun[i][j].first+pot,q+pot,-usun[i][j].second);
        }
        for(int j=0;j<dodaaj[i].size();j++)
        {
            //cout<<"dodaje 2 "<<dodaaj[i][j].first<<" "<<dodaaj[i][j].second<<"\n";
            dodaj(dodaaj[i][j].first,dodaaj[i][j].second,0);
            dodaj(dodaaj[i][j].first,dodaaj[i][j].second,1);
            dodaj2(1,pot+1,q+pot,dodaaj[i][j].first+pot,q+pot,dodaaj[i][j].second);
        }
        for(int j=0;j<essa[i].size();j++)
        {
            int gdzie=essa[i][j].first;
            int ile=essa[i][j].second;
            //cout<<ile<<"\n";
            //cout<<zap(gdzie,1)<<" "<<zap(gdzie,0)<<" "<<zap2(1,0,q,0,gdzie+1)<<"\n";
            ile+=zap(gdzie,1)-zap(gdzie,0)+min(zap2(1,pot+1,q+pot,pot+1,gdzie+pot),0LL);
            //cout<<"mam teraz "<<ile<<"\n";
            if(ile>zap(gdzie,1))
                wynik[gdzie]=-1;
            else wynik[gdzie]=szukaj(ile,1);
            //cout<<gdzie<<": "<<wynik[gdzie]<<"\n";
        }
    }
    for(int i=1;i<=q;i++)
    {
        if(t[i]==3)
        {
            if(wynik[i]==-1)
                cout<<"0\n";
            else cout<<c[wynik[i]]<<"\n";
        }
    }
}

Compilation message

foodcourt.cpp: In function 'int32_t main()':
foodcourt.cpp:112:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  112 |         for(int j=0;j<usun[i].size();j++)
      |                     ~^~~~~~~~~~~~~~~
foodcourt.cpp:118:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  118 |         for(int j=0;j<dodaaj[i].size();j++)
      |                     ~^~~~~~~~~~~~~~~~~
foodcourt.cpp:125:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  125 |         for(int j=0;j<essa[i].size();j++)
      |                     ~^~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 43608 KB Output is correct
2 Correct 10 ms 43612 KB Output is correct
3 Correct 9 ms 43700 KB Output is correct
4 Correct 10 ms 43868 KB Output is correct
5 Correct 9 ms 45660 KB Output is correct
6 Correct 8 ms 43612 KB Output is correct
7 Correct 9 ms 43648 KB Output is correct
8 Correct 10 ms 43868 KB Output is correct
9 Correct 10 ms 43868 KB Output is correct
10 Correct 10 ms 43868 KB Output is correct
11 Correct 9 ms 43868 KB Output is correct
12 Correct 10 ms 43828 KB Output is correct
13 Correct 10 ms 45660 KB Output is correct
14 Correct 9 ms 43880 KB Output is correct
15 Correct 9 ms 43608 KB Output is correct
16 Correct 10 ms 43700 KB Output is correct
17 Correct 9 ms 43612 KB Output is correct
18 Correct 10 ms 43648 KB Output is correct
19 Correct 11 ms 43612 KB Output is correct
20 Correct 10 ms 43748 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 43608 KB Output is correct
2 Correct 10 ms 43612 KB Output is correct
3 Correct 9 ms 43700 KB Output is correct
4 Correct 10 ms 43868 KB Output is correct
5 Correct 9 ms 45660 KB Output is correct
6 Correct 8 ms 43612 KB Output is correct
7 Correct 9 ms 43648 KB Output is correct
8 Correct 10 ms 43868 KB Output is correct
9 Correct 10 ms 43868 KB Output is correct
10 Correct 10 ms 43868 KB Output is correct
11 Correct 9 ms 43868 KB Output is correct
12 Correct 10 ms 43828 KB Output is correct
13 Correct 10 ms 45660 KB Output is correct
14 Correct 9 ms 43880 KB Output is correct
15 Correct 9 ms 43608 KB Output is correct
16 Correct 10 ms 43700 KB Output is correct
17 Correct 9 ms 43612 KB Output is correct
18 Correct 10 ms 43648 KB Output is correct
19 Correct 11 ms 43612 KB Output is correct
20 Correct 10 ms 43748 KB Output is correct
21 Correct 10 ms 43868 KB Output is correct
22 Correct 10 ms 43868 KB Output is correct
23 Correct 9 ms 43612 KB Output is correct
24 Correct 9 ms 43784 KB Output is correct
25 Correct 8 ms 43612 KB Output is correct
26 Correct 8 ms 43828 KB Output is correct
27 Correct 10 ms 43612 KB Output is correct
28 Correct 10 ms 43864 KB Output is correct
29 Correct 9 ms 43868 KB Output is correct
30 Correct 10 ms 43868 KB Output is correct
31 Correct 9 ms 43868 KB Output is correct
32 Correct 10 ms 43864 KB Output is correct
33 Correct 9 ms 45660 KB Output is correct
34 Correct 9 ms 43704 KB Output is correct
35 Correct 10 ms 43612 KB Output is correct
36 Correct 9 ms 43868 KB Output is correct
37 Correct 9 ms 43612 KB Output is correct
38 Correct 9 ms 43868 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 51928 KB Output is correct
2 Correct 72 ms 51988 KB Output is correct
3 Correct 65 ms 50000 KB Output is correct
4 Correct 78 ms 51756 KB Output is correct
5 Correct 67 ms 51800 KB Output is correct
6 Correct 77 ms 52308 KB Output is correct
7 Correct 36 ms 51504 KB Output is correct
8 Correct 37 ms 51704 KB Output is correct
9 Correct 72 ms 51796 KB Output is correct
10 Correct 63 ms 51992 KB Output is correct
11 Correct 66 ms 51796 KB Output is correct
12 Correct 72 ms 52200 KB Output is correct
13 Correct 56 ms 51364 KB Output is correct
14 Correct 61 ms 51796 KB Output is correct
15 Correct 63 ms 51792 KB Output is correct
16 Correct 64 ms 52192 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 345 ms 68912 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 43608 KB Output is correct
2 Correct 10 ms 43612 KB Output is correct
3 Correct 9 ms 43700 KB Output is correct
4 Correct 10 ms 43868 KB Output is correct
5 Correct 9 ms 45660 KB Output is correct
6 Correct 8 ms 43612 KB Output is correct
7 Correct 9 ms 43648 KB Output is correct
8 Correct 10 ms 43868 KB Output is correct
9 Correct 10 ms 43868 KB Output is correct
10 Correct 10 ms 43868 KB Output is correct
11 Correct 9 ms 43868 KB Output is correct
12 Correct 10 ms 43828 KB Output is correct
13 Correct 10 ms 45660 KB Output is correct
14 Correct 9 ms 43880 KB Output is correct
15 Correct 9 ms 43608 KB Output is correct
16 Correct 10 ms 43700 KB Output is correct
17 Correct 9 ms 43612 KB Output is correct
18 Correct 10 ms 43648 KB Output is correct
19 Correct 11 ms 43612 KB Output is correct
20 Correct 10 ms 43748 KB Output is correct
21 Correct 66 ms 51928 KB Output is correct
22 Correct 72 ms 51988 KB Output is correct
23 Correct 65 ms 50000 KB Output is correct
24 Correct 78 ms 51756 KB Output is correct
25 Correct 67 ms 51800 KB Output is correct
26 Correct 77 ms 52308 KB Output is correct
27 Correct 36 ms 51504 KB Output is correct
28 Correct 37 ms 51704 KB Output is correct
29 Correct 72 ms 51796 KB Output is correct
30 Correct 63 ms 51992 KB Output is correct
31 Correct 66 ms 51796 KB Output is correct
32 Correct 72 ms 52200 KB Output is correct
33 Correct 56 ms 51364 KB Output is correct
34 Correct 61 ms 51796 KB Output is correct
35 Correct 63 ms 51792 KB Output is correct
36 Correct 64 ms 52192 KB Output is correct
37 Correct 58 ms 51648 KB Output is correct
38 Correct 60 ms 51280 KB Output is correct
39 Correct 34 ms 50568 KB Output is correct
40 Correct 45 ms 50476 KB Output is correct
41 Correct 65 ms 52048 KB Output is correct
42 Correct 74 ms 52052 KB Output is correct
43 Correct 66 ms 50112 KB Output is correct
44 Correct 71 ms 51956 KB Output is correct
45 Correct 79 ms 52032 KB Output is correct
46 Correct 68 ms 52052 KB Output is correct
47 Correct 43 ms 50768 KB Output is correct
48 Correct 60 ms 51820 KB Output is correct
49 Correct 61 ms 51012 KB Output is correct
50 Correct 58 ms 51548 KB Output is correct
51 Correct 74 ms 52048 KB Output is correct
52 Correct 67 ms 52060 KB Output is correct
53 Correct 52 ms 51288 KB Output is correct
54 Correct 66 ms 51792 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 50004 KB Output is correct
2 Correct 64 ms 51540 KB Output is correct
3 Correct 74 ms 50256 KB Output is correct
4 Correct 49 ms 50772 KB Output is correct
5 Correct 59 ms 51280 KB Output is correct
6 Correct 88 ms 51540 KB Output is correct
7 Correct 37 ms 51384 KB Output is correct
8 Correct 37 ms 50328 KB Output is correct
9 Correct 50 ms 51852 KB Output is correct
10 Correct 47 ms 50680 KB Output is correct
11 Correct 60 ms 51280 KB Output is correct
12 Correct 60 ms 51280 KB Output is correct

Subtask #7
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 43608 KB Output is correct
2 Correct 10 ms 43612 KB Output is correct
3 Correct 9 ms 43700 KB Output is correct
4 Correct 10 ms 43868 KB Output is correct
5 Correct 9 ms 45660 KB Output is correct
6 Correct 8 ms 43612 KB Output is correct
7 Correct 9 ms 43648 KB Output is correct
8 Correct 10 ms 43868 KB Output is correct
9 Correct 10 ms 43868 KB Output is correct
10 Correct 10 ms 43868 KB Output is correct
11 Correct 9 ms 43868 KB Output is correct
12 Correct 10 ms 43828 KB Output is correct
13 Correct 10 ms 45660 KB Output is correct
14 Correct 9 ms 43880 KB Output is correct
15 Correct 9 ms 43608 KB Output is correct
16 Correct 10 ms 43700 KB Output is correct
17 Correct 9 ms 43612 KB Output is correct
18 Correct 10 ms 43648 KB Output is correct
19 Correct 11 ms 43612 KB Output is correct
20 Correct 10 ms 43748 KB Output is correct
21 Correct 10 ms 43868 KB Output is correct
22 Correct 10 ms 43868 KB Output is correct
23 Correct 9 ms 43612 KB Output is correct
24 Correct 9 ms 43784 KB Output is correct
25 Correct 8 ms 43612 KB Output is correct
26 Correct 8 ms 43828 KB Output is correct
27 Correct 10 ms 43612 KB Output is correct
28 Correct 10 ms 43864 KB Output is correct
29 Correct 9 ms 43868 KB Output is correct
30 Correct 10 ms 43868 KB Output is correct
31 Correct 9 ms 43868 KB Output is correct
32 Correct 10 ms 43864 KB Output is correct
33 Correct 9 ms 45660 KB Output is correct
34 Correct 9 ms 43704 KB Output is correct
35 Correct 10 ms 43612 KB Output is correct
36 Correct 9 ms 43868 KB Output is correct
37 Correct 9 ms 43612 KB Output is correct
38 Correct 9 ms 43868 KB Output is correct
39 Correct 66 ms 51928 KB Output is correct
40 Correct 72 ms 51988 KB Output is correct
41 Correct 65 ms 50000 KB Output is correct
42 Correct 78 ms 51756 KB Output is correct
43 Correct 67 ms 51800 KB Output is correct
44 Correct 77 ms 52308 KB Output is correct
45 Correct 36 ms 51504 KB Output is correct
46 Correct 37 ms 51704 KB Output is correct
47 Correct 72 ms 51796 KB Output is correct
48 Correct 63 ms 51992 KB Output is correct
49 Correct 66 ms 51796 KB Output is correct
50 Correct 72 ms 52200 KB Output is correct
51 Correct 56 ms 51364 KB Output is correct
52 Correct 61 ms 51796 KB Output is correct
53 Correct 63 ms 51792 KB Output is correct
54 Correct 64 ms 52192 KB Output is correct
55 Correct 58 ms 51648 KB Output is correct
56 Correct 60 ms 51280 KB Output is correct
57 Correct 34 ms 50568 KB Output is correct
58 Correct 45 ms 50476 KB Output is correct
59 Correct 65 ms 52048 KB Output is correct
60 Correct 74 ms 52052 KB Output is correct
61 Correct 66 ms 50112 KB Output is correct
62 Correct 71 ms 51956 KB Output is correct
63 Correct 79 ms 52032 KB Output is correct
64 Correct 68 ms 52052 KB Output is correct
65 Correct 43 ms 50768 KB Output is correct
66 Correct 60 ms 51820 KB Output is correct
67 Correct 61 ms 51012 KB Output is correct
68 Correct 58 ms 51548 KB Output is correct
69 Correct 74 ms 52048 KB Output is correct
70 Correct 67 ms 52060 KB Output is correct
71 Correct 52 ms 51288 KB Output is correct
72 Correct 66 ms 51792 KB Output is correct
73 Correct 71 ms 50004 KB Output is correct
74 Correct 64 ms 51540 KB Output is correct
75 Correct 74 ms 50256 KB Output is correct
76 Correct 49 ms 50772 KB Output is correct
77 Correct 59 ms 51280 KB Output is correct
78 Correct 88 ms 51540 KB Output is correct
79 Correct 37 ms 51384 KB Output is correct
80 Correct 37 ms 50328 KB Output is correct
81 Correct 50 ms 51852 KB Output is correct
82 Correct 47 ms 50680 KB Output is correct
83 Correct 60 ms 51280 KB Output is correct
84 Correct 60 ms 51280 KB Output is correct
85 Correct 61 ms 51492 KB Output is correct
86 Correct 70 ms 51796 KB Output is correct
87 Correct 63 ms 51608 KB Output is correct
88 Correct 85 ms 51968 KB Output is correct
89 Correct 47 ms 51024 KB Output is correct
90 Correct 70 ms 52052 KB Output is correct
91 Correct 60 ms 51408 KB Output is correct
92 Correct 54 ms 51268 KB Output is correct
93 Correct 69 ms 52048 KB Output is correct
94 Correct 71 ms 52052 KB Output is correct
95 Correct 75 ms 51840 KB Output is correct
96 Correct 69 ms 51980 KB Output is correct
97 Correct 73 ms 51988 KB Output is correct
98 Correct 73 ms 51764 KB Output is correct
99 Correct 45 ms 50884 KB Output is correct
100 Correct 51 ms 51192 KB Output is correct
101 Correct 61 ms 51836 KB Output is correct
102 Correct 64 ms 52048 KB Output is correct

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 43608 KB Output is correct
2 Correct 10 ms 43612 KB Output is correct
3 Correct 9 ms 43700 KB Output is correct
4 Correct 10 ms 43868 KB Output is correct
5 Correct 9 ms 45660 KB Output is correct
6 Correct 8 ms 43612 KB Output is correct
7 Correct 9 ms 43648 KB Output is correct
8 Correct 10 ms 43868 KB Output is correct
9 Correct 10 ms 43868 KB Output is correct
10 Correct 10 ms 43868 KB Output is correct
11 Correct 9 ms 43868 KB Output is correct
12 Correct 10 ms 43828 KB Output is correct
13 Correct 10 ms 45660 KB Output is correct
14 Correct 9 ms 43880 KB Output is correct
15 Correct 9 ms 43608 KB Output is correct
16 Correct 10 ms 43700 KB Output is correct
17 Correct 9 ms 43612 KB Output is correct
18 Correct 10 ms 43648 KB Output is correct
19 Correct 11 ms 43612 KB Output is correct
20 Correct 10 ms 43748 KB Output is correct
21 Correct 10 ms 43868 KB Output is correct
22 Correct 10 ms 43868 KB Output is correct
23 Correct 9 ms 43612 KB Output is correct
24 Correct 9 ms 43784 KB Output is correct
25 Correct 8 ms 43612 KB Output is correct
26 Correct 8 ms 43828 KB Output is correct
27 Correct 10 ms 43612 KB Output is correct
28 Correct 10 ms 43864 KB Output is correct
29 Correct 9 ms 43868 KB Output is correct
30 Correct 10 ms 43868 KB Output is correct
31 Correct 9 ms 43868 KB Output is correct
32 Correct 10 ms 43864 KB Output is correct
33 Correct 9 ms 45660 KB Output is correct
34 Correct 9 ms 43704 KB Output is correct
35 Correct 10 ms 43612 KB Output is correct
36 Correct 9 ms 43868 KB Output is correct
37 Correct 9 ms 43612 KB Output is correct
38 Correct 9 ms 43868 KB Output is correct
39 Correct 66 ms 51928 KB Output is correct
40 Correct 72 ms 51988 KB Output is correct
41 Correct 65 ms 50000 KB Output is correct
42 Correct 78 ms 51756 KB Output is correct
43 Correct 67 ms 51800 KB Output is correct
44 Correct 77 ms 52308 KB Output is correct
45 Correct 36 ms 51504 KB Output is correct
46 Correct 37 ms 51704 KB Output is correct
47 Correct 72 ms 51796 KB Output is correct
48 Correct 63 ms 51992 KB Output is correct
49 Correct 66 ms 51796 KB Output is correct
50 Correct 72 ms 52200 KB Output is correct
51 Correct 56 ms 51364 KB Output is correct
52 Correct 61 ms 51796 KB Output is correct
53 Correct 63 ms 51792 KB Output is correct
54 Correct 64 ms 52192 KB Output is correct
55 Incorrect 345 ms 68912 KB Output isn't correct
56 Halted 0 ms 0 KB -