oj.uz

답안 #797291

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
797291 2023-07-29T08:51:21 Z vjudge1 푸드 코트 (JOI21_foodcourt) C++17
14 / 100
 1000 ms 234716 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(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:38: warning: variable 'f' set but not used [-Wunused-but-set-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

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 56396 KB Output is correct
2 Correct 48 ms 63324 KB Output is correct
3 Correct 49 ms 66952 KB Output is correct
4 Correct 68 ms 79460 KB Output is correct
5 Correct 28 ms 49148 KB Output is correct
6 Correct 28 ms 49044 KB Output is correct
7 Correct 53 ms 71948 KB Output is correct
8 Correct 52 ms 71388 KB Output is correct
9 Correct 51 ms 71280 KB Output is correct
10 Correct 64 ms 72524 KB Output is correct
11 Correct 59 ms 73104 KB Output is correct
12 Correct 52 ms 72060 KB Output is correct
13 Correct 58 ms 82588 KB Output is correct
14 Correct 71 ms 90548 KB Output is correct
15 Correct 51 ms 71772 KB Output is correct
16 Correct 65 ms 90112 KB Output is correct
17 Correct 40 ms 60508 KB Output is correct
18 Correct 56 ms 67608 KB Output is correct
19 Correct 27 ms 49352 KB Output is correct
20 Correct 26 ms 49332 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 56396 KB Output is correct
2 Correct 48 ms 63324 KB Output is correct
3 Correct 49 ms 66952 KB Output is correct
4 Correct 68 ms 79460 KB Output is correct
5 Correct 28 ms 49148 KB Output is correct
6 Correct 28 ms 49044 KB Output is correct
7 Correct 53 ms 71948 KB Output is correct
8 Correct 52 ms 71388 KB Output is correct
9 Correct 51 ms 71280 KB Output is correct
10 Correct 64 ms 72524 KB Output is correct
11 Correct 59 ms 73104 KB Output is correct
12 Correct 52 ms 72060 KB Output is correct
13 Correct 58 ms 82588 KB Output is correct
14 Correct 71 ms 90548 KB Output is correct
15 Correct 51 ms 71772 KB Output is correct
16 Correct 65 ms 90112 KB Output is correct
17 Correct 40 ms 60508 KB Output is correct
18 Correct 56 ms 67608 KB Output is correct
19 Correct 27 ms 49352 KB Output is correct
20 Correct 26 ms 49332 KB Output is correct
21 Correct 42 ms 62072 KB Output is correct
22 Correct 44 ms 63292 KB Output is correct
23 Correct 44 ms 68592 KB Output is correct
24 Correct 67 ms 79508 KB Output is correct
25 Correct 27 ms 49040 KB Output is correct
26 Correct 28 ms 49136 KB Output is correct
27 Correct 48 ms 68940 KB Output is correct
28 Correct 61 ms 72384 KB Output is correct
29 Correct 58 ms 72144 KB Output is correct
30 Correct 50 ms 71620 KB Output is correct
31 Correct 52 ms 68440 KB Output is correct
32 Correct 56 ms 68384 KB Output is correct
33 Correct 54 ms 81356 KB Output is correct
34 Correct 69 ms 90452 KB Output is correct
35 Correct 54 ms 78896 KB Output is correct
36 Correct 68 ms 89812 KB Output is correct
37 Correct 25 ms 49336 KB Output is correct
38 Correct 32 ms 49400 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 51808 KB Output is correct
2 Correct 87 ms 51748 KB Output is correct
3 Correct 77 ms 51788 KB Output is correct
4 Correct 101 ms 51928 KB Output is correct
5 Correct 124 ms 51788 KB Output is correct
6 Correct 93 ms 51784 KB Output is correct
7 Correct 50 ms 51748 KB Output is correct
8 Correct 42 ms 51792 KB Output is correct
9 Correct 81 ms 52228 KB Output is correct
10 Correct 68 ms 51780 KB Output is correct
11 Correct 65 ms 51940 KB Output is correct
12 Correct 62 ms 51788 KB Output is correct
13 Correct 72 ms 51772 KB Output is correct
14 Correct 92 ms 51828 KB Output is correct
15 Correct 107 ms 51856 KB Output is correct
16 Correct 116 ms 51868 KB Output is correct

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 154 ms 117844 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 56396 KB Output is correct
2 Correct 48 ms 63324 KB Output is correct
3 Correct 49 ms 66952 KB Output is correct
4 Correct 68 ms 79460 KB Output is correct
5 Correct 28 ms 49148 KB Output is correct
6 Correct 28 ms 49044 KB Output is correct
7 Correct 53 ms 71948 KB Output is correct
8 Correct 52 ms 71388 KB Output is correct
9 Correct 51 ms 71280 KB Output is correct
10 Correct 64 ms 72524 KB Output is correct
11 Correct 59 ms 73104 KB Output is correct
12 Correct 52 ms 72060 KB Output is correct
13 Correct 58 ms 82588 KB Output is correct
14 Correct 71 ms 90548 KB Output is correct
15 Correct 51 ms 71772 KB Output is correct
16 Correct 65 ms 90112 KB Output is correct
17 Correct 40 ms 60508 KB Output is correct
18 Correct 56 ms 67608 KB Output is correct
19 Correct 27 ms 49352 KB Output is correct
20 Correct 26 ms 49332 KB Output is correct
21 Correct 61 ms 51808 KB Output is correct
22 Correct 87 ms 51748 KB Output is correct
23 Correct 77 ms 51788 KB Output is correct
24 Correct 101 ms 51928 KB Output is correct
25 Correct 124 ms 51788 KB Output is correct
26 Correct 93 ms 51784 KB Output is correct
27 Correct 50 ms 51748 KB Output is correct
28 Correct 42 ms 51792 KB Output is correct
29 Correct 81 ms 52228 KB Output is correct
30 Correct 68 ms 51780 KB Output is correct
31 Correct 65 ms 51940 KB Output is correct
32 Correct 62 ms 51788 KB Output is correct
33 Correct 72 ms 51772 KB Output is correct
34 Correct 92 ms 51828 KB Output is correct
35 Correct 107 ms 51856 KB Output is correct
36 Correct 116 ms 51868 KB Output is correct
37 Execution timed out 1070 ms 68328 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1079 ms 234716 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 56396 KB Output is correct
2 Correct 48 ms 63324 KB Output is correct
3 Correct 49 ms 66952 KB Output is correct
4 Correct 68 ms 79460 KB Output is correct
5 Correct 28 ms 49148 KB Output is correct
6 Correct 28 ms 49044 KB Output is correct
7 Correct 53 ms 71948 KB Output is correct
8 Correct 52 ms 71388 KB Output is correct
9 Correct 51 ms 71280 KB Output is correct
10 Correct 64 ms 72524 KB Output is correct
11 Correct 59 ms 73104 KB Output is correct
12 Correct 52 ms 72060 KB Output is correct
13 Correct 58 ms 82588 KB Output is correct
14 Correct 71 ms 90548 KB Output is correct
15 Correct 51 ms 71772 KB Output is correct
16 Correct 65 ms 90112 KB Output is correct
17 Correct 40 ms 60508 KB Output is correct
18 Correct 56 ms 67608 KB Output is correct
19 Correct 27 ms 49352 KB Output is correct
20 Correct 26 ms 49332 KB Output is correct
21 Correct 42 ms 62072 KB Output is correct
22 Correct 44 ms 63292 KB Output is correct
23 Correct 44 ms 68592 KB Output is correct
24 Correct 67 ms 79508 KB Output is correct
25 Correct 27 ms 49040 KB Output is correct
26 Correct 28 ms 49136 KB Output is correct
27 Correct 48 ms 68940 KB Output is correct
28 Correct 61 ms 72384 KB Output is correct
29 Correct 58 ms 72144 KB Output is correct
30 Correct 50 ms 71620 KB Output is correct
31 Correct 52 ms 68440 KB Output is correct
32 Correct 56 ms 68384 KB Output is correct
33 Correct 54 ms 81356 KB Output is correct
34 Correct 69 ms 90452 KB Output is correct
35 Correct 54 ms 78896 KB Output is correct
36 Correct 68 ms 89812 KB Output is correct
37 Correct 25 ms 49336 KB Output is correct
38 Correct 32 ms 49400 KB Output is correct
39 Correct 61 ms 51808 KB Output is correct
40 Correct 87 ms 51748 KB Output is correct
41 Correct 77 ms 51788 KB Output is correct
42 Correct 101 ms 51928 KB Output is correct
43 Correct 124 ms 51788 KB Output is correct
44 Correct 93 ms 51784 KB Output is correct
45 Correct 50 ms 51748 KB Output is correct
46 Correct 42 ms 51792 KB Output is correct
47 Correct 81 ms 52228 KB Output is correct
48 Correct 68 ms 51780 KB Output is correct
49 Correct 65 ms 51940 KB Output is correct
50 Correct 62 ms 51788 KB Output is correct
51 Correct 72 ms 51772 KB Output is correct
52 Correct 92 ms 51828 KB Output is correct
53 Correct 107 ms 51856 KB Output is correct
54 Correct 116 ms 51868 KB Output is correct
55 Execution timed out 1070 ms 68328 KB Time limit exceeded
56 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 56396 KB Output is correct
2 Correct 48 ms 63324 KB Output is correct
3 Correct 49 ms 66952 KB Output is correct
4 Correct 68 ms 79460 KB Output is correct
5 Correct 28 ms 49148 KB Output is correct
6 Correct 28 ms 49044 KB Output is correct
7 Correct 53 ms 71948 KB Output is correct
8 Correct 52 ms 71388 KB Output is correct
9 Correct 51 ms 71280 KB Output is correct
10 Correct 64 ms 72524 KB Output is correct
11 Correct 59 ms 73104 KB Output is correct
12 Correct 52 ms 72060 KB Output is correct
13 Correct 58 ms 82588 KB Output is correct
14 Correct 71 ms 90548 KB Output is correct
15 Correct 51 ms 71772 KB Output is correct
16 Correct 65 ms 90112 KB Output is correct
17 Correct 40 ms 60508 KB Output is correct
18 Correct 56 ms 67608 KB Output is correct
19 Correct 27 ms 49352 KB Output is correct
20 Correct 26 ms 49332 KB Output is correct
21 Correct 42 ms 62072 KB Output is correct
22 Correct 44 ms 63292 KB Output is correct
23 Correct 44 ms 68592 KB Output is correct
24 Correct 67 ms 79508 KB Output is correct
25 Correct 27 ms 49040 KB Output is correct
26 Correct 28 ms 49136 KB Output is correct
27 Correct 48 ms 68940 KB Output is correct
28 Correct 61 ms 72384 KB Output is correct
29 Correct 58 ms 72144 KB Output is correct
30 Correct 50 ms 71620 KB Output is correct
31 Correct 52 ms 68440 KB Output is correct
32 Correct 56 ms 68384 KB Output is correct
33 Correct 54 ms 81356 KB Output is correct
34 Correct 69 ms 90452 KB Output is correct
35 Correct 54 ms 78896 KB Output is correct
36 Correct 68 ms 89812 KB Output is correct
37 Correct 25 ms 49336 KB Output is correct
38 Correct 32 ms 49400 KB Output is correct
39 Correct 61 ms 51808 KB Output is correct
40 Correct 87 ms 51748 KB Output is correct
41 Correct 77 ms 51788 KB Output is correct
42 Correct 101 ms 51928 KB Output is correct
43 Correct 124 ms 51788 KB Output is correct
44 Correct 93 ms 51784 KB Output is correct
45 Correct 50 ms 51748 KB Output is correct
46 Correct 42 ms 51792 KB Output is correct
47 Correct 81 ms 52228 KB Output is correct
48 Correct 68 ms 51780 KB Output is correct
49 Correct 65 ms 51940 KB Output is correct
50 Correct 62 ms 51788 KB Output is correct
51 Correct 72 ms 51772 KB Output is correct
52 Correct 92 ms 51828 KB Output is correct
53 Correct 107 ms 51856 KB Output is correct
54 Correct 116 ms 51868 KB Output is correct
55 Runtime error 154 ms 117844 KB Execution killed with signal 11
56 Halted 0 ms 0 KB -