oj.uz

Submission #797232

# Submission time Handle Problem Language Result Execution time Memory
797232 2023-07-29T08:13:41 Z vjudge1 Food Court (JOI21_foodcourt) C++17
9 / 100
 1000 ms 133520 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<int>d[N];
vector<pair<int,int>>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<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 34 ms 52572 KB Output is correct
2 Correct 39 ms 56076 KB Output is correct
3 Correct 45 ms 57820 KB Output is correct
4 Correct 51 ms 65232 KB Output is correct
5 Correct 28 ms 49064 KB Output is correct
6 Correct 29 ms 49108 KB Output is correct
7 Correct 46 ms 60656 KB Output is correct
8 Correct 45 ms 60368 KB Output is correct
9 Correct 45 ms 60340 KB Output is correct
10 Correct 46 ms 61104 KB Output is correct
11 Correct 46 ms 61500 KB Output is correct
12 Correct 45 ms 60800 KB Output is correct
13 Correct 52 ms 67432 KB Output is correct
14 Correct 71 ms 70624 KB Output is correct
15 Correct 48 ms 59792 KB Output is correct
16 Correct 73 ms 70480 KB Output is correct
17 Correct 39 ms 54604 KB Output is correct
18 Correct 42 ms 58144 KB Output is correct
19 Correct 27 ms 49236 KB Output is correct
20 Correct 27 ms 49276 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 52572 KB Output is correct
2 Correct 39 ms 56076 KB Output is correct
3 Correct 45 ms 57820 KB Output is correct
4 Correct 51 ms 65232 KB Output is correct
5 Correct 28 ms 49064 KB Output is correct
6 Correct 29 ms 49108 KB Output is correct
7 Correct 46 ms 60656 KB Output is correct
8 Correct 45 ms 60368 KB Output is correct
9 Correct 45 ms 60340 KB Output is correct
10 Correct 46 ms 61104 KB Output is correct
11 Correct 46 ms 61500 KB Output is correct
12 Correct 45 ms 60800 KB Output is correct
13 Correct 52 ms 67432 KB Output is correct
14 Correct 71 ms 70624 KB Output is correct
15 Correct 48 ms 59792 KB Output is correct
16 Correct 73 ms 70480 KB Output is correct
17 Correct 39 ms 54604 KB Output is correct
18 Correct 42 ms 58144 KB Output is correct
19 Correct 27 ms 49236 KB Output is correct
20 Correct 27 ms 49276 KB Output is correct
21 Incorrect 37 ms 55380 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 49048 KB Output is correct
2 Correct 82 ms 49108 KB Output is correct
3 Correct 75 ms 49136 KB Output is correct
4 Correct 80 ms 49124 KB Output is correct
5 Correct 94 ms 49128 KB Output is correct
6 Correct 94 ms 49072 KB Output is correct
7 Correct 39 ms 49044 KB Output is correct
8 Correct 38 ms 49108 KB Output is correct
9 Correct 71 ms 49732 KB Output is correct
10 Correct 71 ms 49132 KB Output is correct
11 Correct 68 ms 49440 KB Output is correct
12 Correct 63 ms 49116 KB Output is correct
13 Correct 74 ms 49140 KB Output is correct
14 Correct 80 ms 49108 KB Output is correct
15 Correct 112 ms 49344 KB Output is correct
16 Correct 131 ms 49332 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Runtime error 62 ms 99284 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 34 ms 52572 KB Output is correct
2 Correct 39 ms 56076 KB Output is correct
3 Correct 45 ms 57820 KB Output is correct
4 Correct 51 ms 65232 KB Output is correct
5 Correct 28 ms 49064 KB Output is correct
6 Correct 29 ms 49108 KB Output is correct
7 Correct 46 ms 60656 KB Output is correct
8 Correct 45 ms 60368 KB Output is correct
9 Correct 45 ms 60340 KB Output is correct
10 Correct 46 ms 61104 KB Output is correct
11 Correct 46 ms 61500 KB Output is correct
12 Correct 45 ms 60800 KB Output is correct
13 Correct 52 ms 67432 KB Output is correct
14 Correct 71 ms 70624 KB Output is correct
15 Correct 48 ms 59792 KB Output is correct
16 Correct 73 ms 70480 KB Output is correct
17 Correct 39 ms 54604 KB Output is correct
18 Correct 42 ms 58144 KB Output is correct
19 Correct 27 ms 49236 KB Output is correct
20 Correct 27 ms 49276 KB Output is correct
21 Correct 78 ms 49048 KB Output is correct
22 Correct 82 ms 49108 KB Output is correct
23 Correct 75 ms 49136 KB Output is correct
24 Correct 80 ms 49124 KB Output is correct
25 Correct 94 ms 49128 KB Output is correct
26 Correct 94 ms 49072 KB Output is correct
27 Correct 39 ms 49044 KB Output is correct
28 Correct 38 ms 49108 KB Output is correct
29 Correct 71 ms 49732 KB Output is correct
30 Correct 71 ms 49132 KB Output is correct
31 Correct 68 ms 49440 KB Output is correct
32 Correct 63 ms 49116 KB Output is correct
33 Correct 74 ms 49140 KB Output is correct
34 Correct 80 ms 49108 KB Output is correct
35 Correct 112 ms 49344 KB Output is correct
36 Correct 131 ms 49332 KB Output is correct
37 Execution timed out 1080 ms 63488 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 1081 ms 133520 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 52572 KB Output is correct
2 Correct 39 ms 56076 KB Output is correct
3 Correct 45 ms 57820 KB Output is correct
4 Correct 51 ms 65232 KB Output is correct
5 Correct 28 ms 49064 KB Output is correct
6 Correct 29 ms 49108 KB Output is correct
7 Correct 46 ms 60656 KB Output is correct
8 Correct 45 ms 60368 KB Output is correct
9 Correct 45 ms 60340 KB Output is correct
10 Correct 46 ms 61104 KB Output is correct
11 Correct 46 ms 61500 KB Output is correct
12 Correct 45 ms 60800 KB Output is correct
13 Correct 52 ms 67432 KB Output is correct
14 Correct 71 ms 70624 KB Output is correct
15 Correct 48 ms 59792 KB Output is correct
16 Correct 73 ms 70480 KB Output is correct
17 Correct 39 ms 54604 KB Output is correct
18 Correct 42 ms 58144 KB Output is correct
19 Correct 27 ms 49236 KB Output is correct
20 Correct 27 ms 49276 KB Output is correct
21 Incorrect 37 ms 55380 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 52572 KB Output is correct
2 Correct 39 ms 56076 KB Output is correct
3 Correct 45 ms 57820 KB Output is correct
4 Correct 51 ms 65232 KB Output is correct
5 Correct 28 ms 49064 KB Output is correct
6 Correct 29 ms 49108 KB Output is correct
7 Correct 46 ms 60656 KB Output is correct
8 Correct 45 ms 60368 KB Output is correct
9 Correct 45 ms 60340 KB Output is correct
10 Correct 46 ms 61104 KB Output is correct
11 Correct 46 ms 61500 KB Output is correct
12 Correct 45 ms 60800 KB Output is correct
13 Correct 52 ms 67432 KB Output is correct
14 Correct 71 ms 70624 KB Output is correct
15 Correct 48 ms 59792 KB Output is correct
16 Correct 73 ms 70480 KB Output is correct
17 Correct 39 ms 54604 KB Output is correct
18 Correct 42 ms 58144 KB Output is correct
19 Correct 27 ms 49236 KB Output is correct
20 Correct 27 ms 49276 KB Output is correct
21 Incorrect 37 ms 55380 KB Output isn't correct
22 Halted 0 ms 0 KB -