oj.uz

Submission #797235

# Submission time Handle Problem Language Result Execution time Memory
797235 2023-07-29T08:15:47 Z vjudge1 Food Court (JOI21_foodcourt) C++17
14 / 100
 1000 ms 187268 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];
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;
    }
    while(q--){
        cin>>k;
        if(k == 1){
            cin>>l>>r>>x>>y;
            for(i = l; i <=r ;i++)
                d[i].pb(x) , st.insert(i);
        }else if(k == 2){
            cin>>l>>r>>x;
            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{
            cin>>x>>y;
            if(d[x].size() >= y)
                cout<<d[x][y - 1]<<"\n";
            else
                cout<<0<<"\n";
        }
    }
}

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:97: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]
   97 |             if(d[x].size() >= y)
      |                ~~~~~~~~~~~~^~~~
foodcourt.cpp:32:16: warning: unused variable 'j' [-Wunused-variable]
   32 |     ll q , i , j , m ,n, z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = -1;
      |                ^
foodcourt.cpp:32:26: warning: unused variable 'z' [-Wunused-variable]
   32 |     ll q , i , j , m ,n, z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = -1;
      |                          ^
foodcourt.cpp:32:38: warning: unused variable 'f' [-Wunused-variable]
   32 |     ll q , i , j , m ,n, z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = -1;
      |                                      ^
foodcourt.cpp:32:61: warning: unused variable 'mn' [-Wunused-variable]
   32 |     ll q , i , j , m ,n, z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = -1;
      |                                                             ^~
foodcourt.cpp:32:74: warning: unused variable 'mx' [-Wunused-variable]
   32 |     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 43 ms 56404 KB Output is correct
2 Correct 45 ms 63444 KB Output is correct
3 Correct 46 ms 66992 KB Output is correct
4 Correct 59 ms 79508 KB Output is correct
5 Correct 33 ms 49128 KB Output is correct
6 Correct 27 ms 49108 KB Output is correct
7 Correct 53 ms 71900 KB Output is correct
8 Correct 51 ms 71380 KB Output is correct
9 Correct 51 ms 71368 KB Output is correct
10 Correct 53 ms 72432 KB Output is correct
11 Correct 54 ms 73068 KB Output is correct
12 Correct 53 ms 72028 KB Output is correct
13 Correct 60 ms 82660 KB Output is correct
14 Correct 69 ms 90496 KB Output is correct
15 Correct 51 ms 71880 KB Output is correct
16 Correct 76 ms 90072 KB Output is correct
17 Correct 40 ms 60556 KB Output is correct
18 Correct 50 ms 67528 KB Output is correct
19 Correct 27 ms 49364 KB Output is correct
20 Correct 28 ms 49420 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 56404 KB Output is correct
2 Correct 45 ms 63444 KB Output is correct
3 Correct 46 ms 66992 KB Output is correct
4 Correct 59 ms 79508 KB Output is correct
5 Correct 33 ms 49128 KB Output is correct
6 Correct 27 ms 49108 KB Output is correct
7 Correct 53 ms 71900 KB Output is correct
8 Correct 51 ms 71380 KB Output is correct
9 Correct 51 ms 71368 KB Output is correct
10 Correct 53 ms 72432 KB Output is correct
11 Correct 54 ms 73068 KB Output is correct
12 Correct 53 ms 72028 KB Output is correct
13 Correct 60 ms 82660 KB Output is correct
14 Correct 69 ms 90496 KB Output is correct
15 Correct 51 ms 71880 KB Output is correct
16 Correct 76 ms 90072 KB Output is correct
17 Correct 40 ms 60556 KB Output is correct
18 Correct 50 ms 67528 KB Output is correct
19 Correct 27 ms 49364 KB Output is correct
20 Correct 28 ms 49420 KB Output is correct
21 Correct 41 ms 62044 KB Output is correct
22 Correct 44 ms 63308 KB Output is correct
23 Correct 46 ms 68612 KB Output is correct
24 Correct 68 ms 79564 KB Output is correct
25 Correct 38 ms 49116 KB Output is correct
26 Correct 37 ms 49136 KB Output is correct
27 Correct 53 ms 68900 KB Output is correct
28 Correct 55 ms 72420 KB Output is correct
29 Correct 55 ms 72172 KB Output is correct
30 Correct 51 ms 71608 KB Output is correct
31 Correct 60 ms 68452 KB Output is correct
32 Correct 52 ms 68344 KB Output is correct
33 Correct 61 ms 81372 KB Output is correct
34 Correct 67 ms 90364 KB Output is correct
35 Correct 55 ms 78864 KB Output is correct
36 Correct 69 ms 89804 KB Output is correct
37 Correct 26 ms 49316 KB Output is correct
38 Correct 29 ms 49420 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 49108 KB Output is correct
2 Correct 72 ms 49112 KB Output is correct
3 Correct 95 ms 49108 KB Output is correct
4 Correct 79 ms 49132 KB Output is correct
5 Correct 98 ms 49140 KB Output is correct
6 Correct 104 ms 49248 KB Output is correct
7 Correct 38 ms 49160 KB Output is correct
8 Correct 39 ms 49100 KB Output is correct
9 Correct 66 ms 49720 KB Output is correct
10 Correct 61 ms 49124 KB Output is correct
11 Correct 77 ms 49456 KB Output is correct
12 Correct 60 ms 49124 KB Output is correct
13 Correct 77 ms 49164 KB Output is correct
14 Correct 83 ms 49164 KB Output is correct
15 Correct 98 ms 49356 KB Output is correct
16 Correct 98 ms 49352 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Runtime error 63 ms 99300 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 43 ms 56404 KB Output is correct
2 Correct 45 ms 63444 KB Output is correct
3 Correct 46 ms 66992 KB Output is correct
4 Correct 59 ms 79508 KB Output is correct
5 Correct 33 ms 49128 KB Output is correct
6 Correct 27 ms 49108 KB Output is correct
7 Correct 53 ms 71900 KB Output is correct
8 Correct 51 ms 71380 KB Output is correct
9 Correct 51 ms 71368 KB Output is correct
10 Correct 53 ms 72432 KB Output is correct
11 Correct 54 ms 73068 KB Output is correct
12 Correct 53 ms 72028 KB Output is correct
13 Correct 60 ms 82660 KB Output is correct
14 Correct 69 ms 90496 KB Output is correct
15 Correct 51 ms 71880 KB Output is correct
16 Correct 76 ms 90072 KB Output is correct
17 Correct 40 ms 60556 KB Output is correct
18 Correct 50 ms 67528 KB Output is correct
19 Correct 27 ms 49364 KB Output is correct
20 Correct 28 ms 49420 KB Output is correct
21 Correct 66 ms 49108 KB Output is correct
22 Correct 72 ms 49112 KB Output is correct
23 Correct 95 ms 49108 KB Output is correct
24 Correct 79 ms 49132 KB Output is correct
25 Correct 98 ms 49140 KB Output is correct
26 Correct 104 ms 49248 KB Output is correct
27 Correct 38 ms 49160 KB Output is correct
28 Correct 39 ms 49100 KB Output is correct
29 Correct 66 ms 49720 KB Output is correct
30 Correct 61 ms 49124 KB Output is correct
31 Correct 77 ms 49456 KB Output is correct
32 Correct 60 ms 49124 KB Output is correct
33 Correct 77 ms 49164 KB Output is correct
34 Correct 83 ms 49164 KB Output is correct
35 Correct 98 ms 49356 KB Output is correct
36 Correct 98 ms 49352 KB Output is correct
37 Execution timed out 1084 ms 65924 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

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

Subtask #7
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 56404 KB Output is correct
2 Correct 45 ms 63444 KB Output is correct
3 Correct 46 ms 66992 KB Output is correct
4 Correct 59 ms 79508 KB Output is correct
5 Correct 33 ms 49128 KB Output is correct
6 Correct 27 ms 49108 KB Output is correct
7 Correct 53 ms 71900 KB Output is correct
8 Correct 51 ms 71380 KB Output is correct
9 Correct 51 ms 71368 KB Output is correct
10 Correct 53 ms 72432 KB Output is correct
11 Correct 54 ms 73068 KB Output is correct
12 Correct 53 ms 72028 KB Output is correct
13 Correct 60 ms 82660 KB Output is correct
14 Correct 69 ms 90496 KB Output is correct
15 Correct 51 ms 71880 KB Output is correct
16 Correct 76 ms 90072 KB Output is correct
17 Correct 40 ms 60556 KB Output is correct
18 Correct 50 ms 67528 KB Output is correct
19 Correct 27 ms 49364 KB Output is correct
20 Correct 28 ms 49420 KB Output is correct
21 Correct 41 ms 62044 KB Output is correct
22 Correct 44 ms 63308 KB Output is correct
23 Correct 46 ms 68612 KB Output is correct
24 Correct 68 ms 79564 KB Output is correct
25 Correct 38 ms 49116 KB Output is correct
26 Correct 37 ms 49136 KB Output is correct
27 Correct 53 ms 68900 KB Output is correct
28 Correct 55 ms 72420 KB Output is correct
29 Correct 55 ms 72172 KB Output is correct
30 Correct 51 ms 71608 KB Output is correct
31 Correct 60 ms 68452 KB Output is correct
32 Correct 52 ms 68344 KB Output is correct
33 Correct 61 ms 81372 KB Output is correct
34 Correct 67 ms 90364 KB Output is correct
35 Correct 55 ms 78864 KB Output is correct
36 Correct 69 ms 89804 KB Output is correct
37 Correct 26 ms 49316 KB Output is correct
38 Correct 29 ms 49420 KB Output is correct
39 Correct 66 ms 49108 KB Output is correct
40 Correct 72 ms 49112 KB Output is correct
41 Correct 95 ms 49108 KB Output is correct
42 Correct 79 ms 49132 KB Output is correct
43 Correct 98 ms 49140 KB Output is correct
44 Correct 104 ms 49248 KB Output is correct
45 Correct 38 ms 49160 KB Output is correct
46 Correct 39 ms 49100 KB Output is correct
47 Correct 66 ms 49720 KB Output is correct
48 Correct 61 ms 49124 KB Output is correct
49 Correct 77 ms 49456 KB Output is correct
50 Correct 60 ms 49124 KB Output is correct
51 Correct 77 ms 49164 KB Output is correct
52 Correct 83 ms 49164 KB Output is correct
53 Correct 98 ms 49356 KB Output is correct
54 Correct 98 ms 49352 KB Output is correct
55 Execution timed out 1084 ms 65924 KB Time limit exceeded
56 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 56404 KB Output is correct
2 Correct 45 ms 63444 KB Output is correct
3 Correct 46 ms 66992 KB Output is correct
4 Correct 59 ms 79508 KB Output is correct
5 Correct 33 ms 49128 KB Output is correct
6 Correct 27 ms 49108 KB Output is correct
7 Correct 53 ms 71900 KB Output is correct
8 Correct 51 ms 71380 KB Output is correct
9 Correct 51 ms 71368 KB Output is correct
10 Correct 53 ms 72432 KB Output is correct
11 Correct 54 ms 73068 KB Output is correct
12 Correct 53 ms 72028 KB Output is correct
13 Correct 60 ms 82660 KB Output is correct
14 Correct 69 ms 90496 KB Output is correct
15 Correct 51 ms 71880 KB Output is correct
16 Correct 76 ms 90072 KB Output is correct
17 Correct 40 ms 60556 KB Output is correct
18 Correct 50 ms 67528 KB Output is correct
19 Correct 27 ms 49364 KB Output is correct
20 Correct 28 ms 49420 KB Output is correct
21 Correct 41 ms 62044 KB Output is correct
22 Correct 44 ms 63308 KB Output is correct
23 Correct 46 ms 68612 KB Output is correct
24 Correct 68 ms 79564 KB Output is correct
25 Correct 38 ms 49116 KB Output is correct
26 Correct 37 ms 49136 KB Output is correct
27 Correct 53 ms 68900 KB Output is correct
28 Correct 55 ms 72420 KB Output is correct
29 Correct 55 ms 72172 KB Output is correct
30 Correct 51 ms 71608 KB Output is correct
31 Correct 60 ms 68452 KB Output is correct
32 Correct 52 ms 68344 KB Output is correct
33 Correct 61 ms 81372 KB Output is correct
34 Correct 67 ms 90364 KB Output is correct
35 Correct 55 ms 78864 KB Output is correct
36 Correct 69 ms 89804 KB Output is correct
37 Correct 26 ms 49316 KB Output is correct
38 Correct 29 ms 49420 KB Output is correct
39 Correct 66 ms 49108 KB Output is correct
40 Correct 72 ms 49112 KB Output is correct
41 Correct 95 ms 49108 KB Output is correct
42 Correct 79 ms 49132 KB Output is correct
43 Correct 98 ms 49140 KB Output is correct
44 Correct 104 ms 49248 KB Output is correct
45 Correct 38 ms 49160 KB Output is correct
46 Correct 39 ms 49100 KB Output is correct
47 Correct 66 ms 49720 KB Output is correct
48 Correct 61 ms 49124 KB Output is correct
49 Correct 77 ms 49456 KB Output is correct
50 Correct 60 ms 49124 KB Output is correct
51 Correct 77 ms 49164 KB Output is correct
52 Correct 83 ms 49164 KB Output is correct
53 Correct 98 ms 49356 KB Output is correct
54 Correct 98 ms 49352 KB Output is correct
55 Runtime error 63 ms 99300 KB Execution killed with signal 11
56 Halted 0 ms 0 KB -