oj.uz

Submission #797292

# Submission time Handle Problem Language Result Execution time Memory
797292 2023-07-29T08:51:51 Z vjudge1 Food Court (JOI21_foodcourt) C++17
7 / 100
 1000 ms 247776 KB 

// Author : حسن

#include <bits/stdc++.h>



using namespace std;

#define TL ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define rall(s) s.rbegin(),s.rend()
#define all(s) s.begin(),s.end()
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ld long double
#define YES cout<<"YES\n"
#define Yes cout<<"Yes\n"
#define yes cout<<"yes\n"
#define NO cout<<"NO\n"
#define No cout<<"No\n"
#define no cout<<"no\n"


const int N = 7e4 + 9 , mod = 1e9 + 7;
ll  a[N] = {},  c[N] , dp[N] = {} , b[N];
deque<ll>d[N];
vector<pair<ll,ll>>v[N];
struct qu{
    ll k , l, r , x , y;
};
void solve(){
    ll q , i , j , m ,n, z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = -1;
    cin>>n>>m>>q;
    set<ll>st;
    if(n <= 2000 && q <= 2000){
    while(q--){
        cin>>k;
        if(k == 1){
            cin>>l>>r>>x>>y;
            for(i = l; i <=r ;i++){
                v[i].pb({y , x}) , b[i] += y;
                if(d[i].size() == 0)
                d[i].pb(y);
                else
                    d[i].pb(d[i].back() + y);
            }
        }else if(k == 2){
            cin>>l>>r>>x;
                for(i = l; i <= r; i++){
                    c[i] += x;
                    if(b[i]  < c[i])
                        c[i] = b[i];
                }
        }else{
            cin>>x>>y;
            if(b[x] - c[x] >= y){
                k = c[x] + y;
                l = 0;
                r = v[x].size() - 1;
                while(l != r){
                    m = (l + r) / 2;
                    if(d[x][m] >= k)
                        r = m ;
                    else
                        l = m + 1;
                }
                cout<<v[x][l].se<<"\n";
            }else {
            cout<<0<<"\n";
            }
        }
    }
    return;
    }
    vector<qu>vc;
    f = 0;
    l = r = x = y = 0;
    while(q--){
        cin>>k;
        if(k == 1){
            cin>>l>>r>>x>>y;
            vc.pb({k , l , r , x, y });
            if(y != 1)
                f = 1;
        }else if(k == 2){
            cin>>l>>r>>x;
            if(x != 1)
                f = 1;
            vc.pb({k , l , r , x, y});
        }else{
            cin>>x>>y;
            vc.pb({k , l , r , x, y });
        }
    }
    z = 0;
    for(auto to : vc){
        k = to.k , l = to.l , r = to.r , x = to.x , y = to.y;
        if(f == 1){
        if(k == 1){
            for(i = l; i <=r ;i++)
                d[i].pb(x) , st.insert(i);
        }else if(k == 2){
            auto it = st.lower_bound(l);
            while(st.size() && it != st.end() && *it <= r){
            i = *it;
            s = 0;
            while(d[i].size() && s < x){
                d[i].pop_front();
                s++;
            }
            if(d[i].size() == 0)
                st.erase(i);
            it = st.lower_bound(i + 1);
            }
        }else{
            if(d[x].size() >= y)
                cout<<d[x][y - 1]<<"\n";
            else
                cout<<0<<"\n";
        }
        }else {
            if(k == 3){
                deque<int>v;
                for(i = 0; i < z; i++){
                    if(vc[i].k == 1 && vc[i].l <= x && vc[i].r >= x)
                        v.pb(vc[i].x);
                    if(vc[i].k == 2 && vc[i].l <= x && vc[i].r >= x && v.size())
                        v.pop_front();
                }
                if(v.size() >= y)
                    cout<<v[y - 1]<<"\n";
                else
                    cout<<0<<"\n";
            }
        }
        z++;
    }
}

int main(){

     TL;/*
     #ifndef ONLINE_JUDGE
     freopen("input.txt", "r", stdin);
     freopen("output.txt", "w", stdout);
     #endif
     */

int t = 1;
//cin>>t;

while(t--)
     {
     solve();
     }

}
// Author : حسن

Compilation message

foodcourt.cpp: In function 'void solve()':
foodcourt.cpp:119:28: warning: comparison of integer expressions of different signedness: 'std::deque<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
  119 |             if(d[x].size() >= y)
      |                ~~~~~~~~~~~~^~~~
foodcourt.cpp:133:29: warning: comparison of integer expressions of different signedness: 'std::deque<int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
  133 |                 if(v.size() >= y)
      |                    ~~~~~~~~~^~~~
foodcourt.cpp:35:16: warning: unused variable 'j' [-Wunused-variable]
   35 |     ll q , i , j , m ,n, z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = -1;
      |                ^
foodcourt.cpp:35:61: warning: unused variable 'mn' [-Wunused-variable]
   35 |     ll q , i , j , m ,n, z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = -1;
      |                                                             ^~
foodcourt.cpp:35:74: warning: unused variable 'mx' [-Wunused-variable]
   35 |     ll q , i , j , m ,n, z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = -1;
      |                                                                          ^~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 56328 KB Output is correct
2 Correct 44 ms 63344 KB Output is correct
3 Correct 56 ms 67008 KB Output is correct
4 Correct 71 ms 79436 KB Output is correct
5 Correct 32 ms 49108 KB Output is correct
6 Correct 30 ms 49064 KB Output is correct
7 Correct 52 ms 71992 KB Output is correct
8 Correct 52 ms 71368 KB Output is correct
9 Correct 52 ms 71320 KB Output is correct
10 Correct 53 ms 72480 KB Output is correct
11 Correct 55 ms 73036 KB Output is correct
12 Correct 52 ms 71956 KB Output is correct
13 Correct 61 ms 82680 KB Output is correct
14 Correct 69 ms 90572 KB Output is correct
15 Correct 53 ms 71792 KB Output is correct
16 Correct 78 ms 90000 KB Output is correct
17 Correct 40 ms 60620 KB Output is correct
18 Correct 48 ms 67520 KB Output is correct
19 Correct 27 ms 49364 KB Output is correct
20 Correct 29 ms 49364 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 56328 KB Output is correct
2 Correct 44 ms 63344 KB Output is correct
3 Correct 56 ms 67008 KB Output is correct
4 Correct 71 ms 79436 KB Output is correct
5 Correct 32 ms 49108 KB Output is correct
6 Correct 30 ms 49064 KB Output is correct
7 Correct 52 ms 71992 KB Output is correct
8 Correct 52 ms 71368 KB Output is correct
9 Correct 52 ms 71320 KB Output is correct
10 Correct 53 ms 72480 KB Output is correct
11 Correct 55 ms 73036 KB Output is correct
12 Correct 52 ms 71956 KB Output is correct
13 Correct 61 ms 82680 KB Output is correct
14 Correct 69 ms 90572 KB Output is correct
15 Correct 53 ms 71792 KB Output is correct
16 Correct 78 ms 90000 KB Output is correct
17 Correct 40 ms 60620 KB Output is correct
18 Correct 48 ms 67520 KB Output is correct
19 Correct 27 ms 49364 KB Output is correct
20 Correct 29 ms 49364 KB Output is correct
21 Correct 44 ms 62024 KB Output is correct
22 Correct 43 ms 63316 KB Output is correct
23 Correct 48 ms 68684 KB Output is correct
24 Correct 59 ms 79564 KB Output is correct
25 Correct 29 ms 49100 KB Output is correct
26 Correct 29 ms 49152 KB Output is correct
27 Correct 50 ms 68920 KB Output is correct
28 Correct 57 ms 72400 KB Output is correct
29 Correct 54 ms 72124 KB Output is correct
30 Correct 54 ms 71680 KB Output is correct
31 Correct 50 ms 68436 KB Output is correct
32 Correct 51 ms 68276 KB Output is correct
33 Correct 60 ms 81340 KB Output is correct
34 Correct 73 ms 90444 KB Output is correct
35 Correct 57 ms 78880 KB Output is correct
36 Correct 77 ms 90020 KB Output is correct
37 Correct 27 ms 49224 KB Output is correct
38 Correct 29 ms 49364 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 51772 KB Output is correct
2 Correct 75 ms 51784 KB Output is correct
3 Correct 78 ms 51780 KB Output is correct
4 Correct 78 ms 51776 KB Output is correct
5 Correct 101 ms 51816 KB Output is correct
6 Correct 100 ms 51788 KB Output is correct
7 Correct 42 ms 51788 KB Output is correct
8 Correct 44 ms 51816 KB Output is correct
9 Correct 69 ms 52248 KB Output is correct
10 Correct 66 ms 51768 KB Output is correct
11 Correct 69 ms 51896 KB Output is correct
12 Correct 83 ms 51704 KB Output is correct
13 Execution timed out 1092 ms 51808 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Runtime error 130 ms 117796 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 56328 KB Output is correct
2 Correct 44 ms 63344 KB Output is correct
3 Correct 56 ms 67008 KB Output is correct
4 Correct 71 ms 79436 KB Output is correct
5 Correct 32 ms 49108 KB Output is correct
6 Correct 30 ms 49064 KB Output is correct
7 Correct 52 ms 71992 KB Output is correct
8 Correct 52 ms 71368 KB Output is correct
9 Correct 52 ms 71320 KB Output is correct
10 Correct 53 ms 72480 KB Output is correct
11 Correct 55 ms 73036 KB Output is correct
12 Correct 52 ms 71956 KB Output is correct
13 Correct 61 ms 82680 KB Output is correct
14 Correct 69 ms 90572 KB Output is correct
15 Correct 53 ms 71792 KB Output is correct
16 Correct 78 ms 90000 KB Output is correct
17 Correct 40 ms 60620 KB Output is correct
18 Correct 48 ms 67520 KB Output is correct
19 Correct 27 ms 49364 KB Output is correct
20 Correct 29 ms 49364 KB Output is correct
21 Correct 67 ms 51772 KB Output is correct
22 Correct 75 ms 51784 KB Output is correct
23 Correct 78 ms 51780 KB Output is correct
24 Correct 78 ms 51776 KB Output is correct
25 Correct 101 ms 51816 KB Output is correct
26 Correct 100 ms 51788 KB Output is correct
27 Correct 42 ms 51788 KB Output is correct
28 Correct 44 ms 51816 KB Output is correct
29 Correct 69 ms 52248 KB Output is correct
30 Correct 66 ms 51768 KB Output is correct
31 Correct 69 ms 51896 KB Output is correct
32 Correct 83 ms 51704 KB Output is correct
33 Execution timed out 1092 ms 51808 KB Time limit exceeded
34 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1098 ms 247776 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 56328 KB Output is correct
2 Correct 44 ms 63344 KB Output is correct
3 Correct 56 ms 67008 KB Output is correct
4 Correct 71 ms 79436 KB Output is correct
5 Correct 32 ms 49108 KB Output is correct
6 Correct 30 ms 49064 KB Output is correct
7 Correct 52 ms 71992 KB Output is correct
8 Correct 52 ms 71368 KB Output is correct
9 Correct 52 ms 71320 KB Output is correct
10 Correct 53 ms 72480 KB Output is correct
11 Correct 55 ms 73036 KB Output is correct
12 Correct 52 ms 71956 KB Output is correct
13 Correct 61 ms 82680 KB Output is correct
14 Correct 69 ms 90572 KB Output is correct
15 Correct 53 ms 71792 KB Output is correct
16 Correct 78 ms 90000 KB Output is correct
17 Correct 40 ms 60620 KB Output is correct
18 Correct 48 ms 67520 KB Output is correct
19 Correct 27 ms 49364 KB Output is correct
20 Correct 29 ms 49364 KB Output is correct
21 Correct 44 ms 62024 KB Output is correct
22 Correct 43 ms 63316 KB Output is correct
23 Correct 48 ms 68684 KB Output is correct
24 Correct 59 ms 79564 KB Output is correct
25 Correct 29 ms 49100 KB Output is correct
26 Correct 29 ms 49152 KB Output is correct
27 Correct 50 ms 68920 KB Output is correct
28 Correct 57 ms 72400 KB Output is correct
29 Correct 54 ms 72124 KB Output is correct
30 Correct 54 ms 71680 KB Output is correct
31 Correct 50 ms 68436 KB Output is correct
32 Correct 51 ms 68276 KB Output is correct
33 Correct 60 ms 81340 KB Output is correct
34 Correct 73 ms 90444 KB Output is correct
35 Correct 57 ms 78880 KB Output is correct
36 Correct 77 ms 90020 KB Output is correct
37 Correct 27 ms 49224 KB Output is correct
38 Correct 29 ms 49364 KB Output is correct
39 Correct 67 ms 51772 KB Output is correct
40 Correct 75 ms 51784 KB Output is correct
41 Correct 78 ms 51780 KB Output is correct
42 Correct 78 ms 51776 KB Output is correct
43 Correct 101 ms 51816 KB Output is correct
44 Correct 100 ms 51788 KB Output is correct
45 Correct 42 ms 51788 KB Output is correct
46 Correct 44 ms 51816 KB Output is correct
47 Correct 69 ms 52248 KB Output is correct
48 Correct 66 ms 51768 KB Output is correct
49 Correct 69 ms 51896 KB Output is correct
50 Correct 83 ms 51704 KB Output is correct
51 Execution timed out 1092 ms 51808 KB Time limit exceeded
52 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 56328 KB Output is correct
2 Correct 44 ms 63344 KB Output is correct
3 Correct 56 ms 67008 KB Output is correct
4 Correct 71 ms 79436 KB Output is correct
5 Correct 32 ms 49108 KB Output is correct
6 Correct 30 ms 49064 KB Output is correct
7 Correct 52 ms 71992 KB Output is correct
8 Correct 52 ms 71368 KB Output is correct
9 Correct 52 ms 71320 KB Output is correct
10 Correct 53 ms 72480 KB Output is correct
11 Correct 55 ms 73036 KB Output is correct
12 Correct 52 ms 71956 KB Output is correct
13 Correct 61 ms 82680 KB Output is correct
14 Correct 69 ms 90572 KB Output is correct
15 Correct 53 ms 71792 KB Output is correct
16 Correct 78 ms 90000 KB Output is correct
17 Correct 40 ms 60620 KB Output is correct
18 Correct 48 ms 67520 KB Output is correct
19 Correct 27 ms 49364 KB Output is correct
20 Correct 29 ms 49364 KB Output is correct
21 Correct 44 ms 62024 KB Output is correct
22 Correct 43 ms 63316 KB Output is correct
23 Correct 48 ms 68684 KB Output is correct
24 Correct 59 ms 79564 KB Output is correct
25 Correct 29 ms 49100 KB Output is correct
26 Correct 29 ms 49152 KB Output is correct
27 Correct 50 ms 68920 KB Output is correct
28 Correct 57 ms 72400 KB Output is correct
29 Correct 54 ms 72124 KB Output is correct
30 Correct 54 ms 71680 KB Output is correct
31 Correct 50 ms 68436 KB Output is correct
32 Correct 51 ms 68276 KB Output is correct
33 Correct 60 ms 81340 KB Output is correct
34 Correct 73 ms 90444 KB Output is correct
35 Correct 57 ms 78880 KB Output is correct
36 Correct 77 ms 90020 KB Output is correct
37 Correct 27 ms 49224 KB Output is correct
38 Correct 29 ms 49364 KB Output is correct
39 Correct 67 ms 51772 KB Output is correct
40 Correct 75 ms 51784 KB Output is correct
41 Correct 78 ms 51780 KB Output is correct
42 Correct 78 ms 51776 KB Output is correct
43 Correct 101 ms 51816 KB Output is correct
44 Correct 100 ms 51788 KB Output is correct
45 Correct 42 ms 51788 KB Output is correct
46 Correct 44 ms 51816 KB Output is correct
47 Correct 69 ms 52248 KB Output is correct
48 Correct 66 ms 51768 KB Output is correct
49 Correct 69 ms 51896 KB Output is correct
50 Correct 83 ms 51704 KB Output is correct
51 Execution timed out 1092 ms 51808 KB Time limit exceeded
52 Halted 0 ms 0 KB -