oj.uz

답안 #797289

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
797289 2023-07-29T08:50:51 Z vjudge1 푸드 코트 (JOI21_foodcourt) C++
14 / 100
 265 ms 189276 KB 
#include<bits/stdc++.h>
#define ll long long
#define fi first
#define se second
using namespace std ;
const int N = (1 << 18) ;
ll n, m, q, sum[2 * N + 1], psh[2 * N + 1] ;
deque<pair<ll, ll>> d[N + 1] ;
void push(ll l, ll r, ll v)
{
    if(!psh[v])
        return ;
    ll num = psh[v] ;
    psh[v] = 0 ;
    sum[v] += num * (r - l + 1) ;
    if(l == r)
        return ;
    psh[2 * v] += num ;
    psh[2 * v + 1] += num ;
}
void update(ll l, ll r, ll l1, ll r1, ll num, ll v)
{
    push(l, r, v) ;
    if(l > r1 || r < l1)
        return ;
    if(l1 <= l && r <= r1)
    {
        psh[v] = num ;
        push(l, r, v) ;
        return ;
    }
    ll mid = (l + r) >> 1 ;
    update(l, mid, l1, r1, num, v * 2) ;
    update(mid + 1, r, l1, r1, num, v * 2 + 1) ;
    sum[v] = sum[v * 2] + sum[v * 2 + 1] ;
}
ll get_sum(ll l, ll r, ll pos, ll v)
{
    push(l, r, v) ;
    if(l > pos || r < pos)
        return 0 ;
    if(l == r)
        return sum[v] ;
    ll mid = (l + r) >> 1 ;
    return get_sum(l, mid, pos, v * 2) + get_sum(mid + 1, r, pos, v * 2 + 1) ;
}
signed main()
{
    ios_base::sync_with_stdio( 0 ) ;
    cin.tie( 0 ) ;
    cout.tie( 0 ) ;
    cin >> n >> m >> q ;
    if(n <= 2000 && q <= 2000)
    {
        while(q--)
        {
            ll type, l, r, c, k, a, b ;
            cin >> type ;
            if(type == 1)
            {
                cin >> l >> r >> c >> k ;
                for(ll i = l ; i <= r ; i++)
                    d[i].push_back({c, k}) ;
            }
            if(type == 2)
            {
                cin >> l >> r >> k ;
                for(ll i = l ; i <= r ; i++)
                {
                    ll sum = 0, k1 = k ;
                    for(auto j : d[i])
                        sum += j.se ;
                    if(sum < k1)
                    {
                        d[i].clear() ;
                        continue ;
                    }
                    while(k1)
                        if(d[i][0].se <= k1)
                        {
                            k1 -= d[i][0].se ;
                            d[i].pop_front() ;
                        }
                        else
                        {
                            pair<ll, ll> p = {d[i][0].fi, d[i][0].se - k1} ;
                            d[i].pop_front() ;
                            d[i].push_front(p) ;
                            k1 = 0 ;
                        }
                }
            }
            if(type == 3)
            {
                ll sum = 0, ans = 0 ;
                cin >> a >> b ;
                for(auto i : d[a])
                    sum += i.se ;
                if(sum < b)
                {
                    cout << "0\n" ;
                    continue ;
                }
                for(auto i : d[a])
                    if(i.se < b)
                        b -= i.se ;
                    else
                    {
                        ans = i.fi ;
                        break ;
                    }
                cout << ans << "\n" ;
            }
        }
        return 0 ;
    }
    bool flag1 = 0 ;
    ll type[q + 1], l[q + 1], r[q + 1], c[q + 1], k[q + 1], a[q + 1], b[q + 1] ;
    for(ll i = 1 ; i <= q ; i++)
    {
        cin >> type[i] ;
        if(type[i] == 1)
        {
            cin >> l[i] >> r[i] >> c[i] >> k[i] ;
            if(r[i] - l[i] > 10 || k[i] > 1)
                flag1 = 1 ;
        }
        if(type[i] == 2)
            cin >> l[i] >> r[i] >> k[i] ;
        if(type[i] == 3)
            cin >> a[i] >> b[i] ;
    }
    if(!flag1)
    {
        for(ll i = 1 ; i <= q ; i++)
        {
            if(type[i] == 1)
            {
                for(ll j = l[i] ; j <= r[i] ; j++)
                {
                    ll num = get_sum(1, N, j, 1) ;
                    if(num >= d[j].size())
                        d[j].clear() ;
                    else
                    {
                        for(ll q = 1 ; q <= num ; q++)
                            d[j].pop_front() ;
                    }
                    update(1, N, j, j, -num, 1) ;
                    d[j].push_back({c[i], k[i]}) ;
                }
            }
            if(type[i] == 2)
                update(1, N, l[i], r[i], k[i], 1) ;
            if(type[i] == 3)
            {
                ll num = get_sum(1, N, a[i], 1) ;
                if(num >= d[a[i]].size())
                    d[a[i]].clear() ;
                else
                {
                    for(ll j = 1 ; j <= num ; j++)
                        d[a[i]].pop_front() ;
                }
                update(1, N, a[i], a[i], -num, 1) ;
                if(b[i] <= d[a[i]].size())
                    cout << d[a[i]][b[i] - 1].fi << '\n' ;
                else
                    cout << "0\n" ;
            }
        }
        return 0 ;
    }
    return 0 ;
}

Compilation message

foodcourt.cpp: In function 'int main()':
foodcourt.cpp:142:28: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::deque<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  142 |                     if(num >= d[j].size())
      |                        ~~~~^~~~~~~~~~~~~~
foodcourt.cpp:158:24: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::deque<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  158 |                 if(num >= d[a[i]].size())
      |                    ~~~~^~~~~~~~~~~~~~~~~
foodcourt.cpp:166:25: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::deque<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  166 |                 if(b[i] <= d[a[i]].size())
      |                    ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 98 ms 177228 KB Output is correct
2 Correct 114 ms 177620 KB Output is correct
3 Correct 126 ms 184204 KB Output is correct
4 Correct 169 ms 187724 KB Output is correct
5 Correct 92 ms 176696 KB Output is correct
6 Correct 91 ms 176756 KB Output is correct
7 Correct 244 ms 189260 KB Output is correct
8 Correct 189 ms 184944 KB Output is correct
9 Correct 117 ms 177580 KB Output is correct
10 Correct 196 ms 184364 KB Output is correct
11 Correct 160 ms 181452 KB Output is correct
12 Correct 114 ms 177732 KB Output is correct
13 Correct 118 ms 177712 KB Output is correct
14 Correct 137 ms 178956 KB Output is correct
15 Correct 137 ms 179732 KB Output is correct
16 Correct 125 ms 178712 KB Output is correct
17 Correct 102 ms 177120 KB Output is correct
18 Correct 111 ms 177292 KB Output is correct
19 Correct 88 ms 176688 KB Output is correct
20 Correct 91 ms 176776 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 98 ms 177228 KB Output is correct
2 Correct 114 ms 177620 KB Output is correct
3 Correct 126 ms 184204 KB Output is correct
4 Correct 169 ms 187724 KB Output is correct
5 Correct 92 ms 176696 KB Output is correct
6 Correct 91 ms 176756 KB Output is correct
7 Correct 244 ms 189260 KB Output is correct
8 Correct 189 ms 184944 KB Output is correct
9 Correct 117 ms 177580 KB Output is correct
10 Correct 196 ms 184364 KB Output is correct
11 Correct 160 ms 181452 KB Output is correct
12 Correct 114 ms 177732 KB Output is correct
13 Correct 118 ms 177712 KB Output is correct
14 Correct 137 ms 178956 KB Output is correct
15 Correct 137 ms 179732 KB Output is correct
16 Correct 125 ms 178712 KB Output is correct
17 Correct 102 ms 177120 KB Output is correct
18 Correct 111 ms 177292 KB Output is correct
19 Correct 88 ms 176688 KB Output is correct
20 Correct 91 ms 176776 KB Output is correct
21 Correct 107 ms 177456 KB Output is correct
22 Correct 113 ms 177632 KB Output is correct
23 Correct 140 ms 184092 KB Output is correct
24 Correct 169 ms 187832 KB Output is correct
25 Correct 93 ms 176772 KB Output is correct
26 Correct 90 ms 176692 KB Output is correct
27 Correct 239 ms 188620 KB Output is correct
28 Correct 215 ms 185792 KB Output is correct
29 Correct 134 ms 179388 KB Output is correct
30 Correct 183 ms 183996 KB Output is correct
31 Correct 161 ms 181356 KB Output is correct
32 Correct 114 ms 177492 KB Output is correct
33 Correct 108 ms 177612 KB Output is correct
34 Correct 153 ms 179836 KB Output is correct
35 Correct 135 ms 178340 KB Output is correct
36 Correct 151 ms 178868 KB Output is correct
37 Correct 85 ms 176704 KB Output is correct
38 Correct 88 ms 176780 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 175 ms 182428 KB Output is correct
2 Correct 210 ms 182576 KB Output is correct
3 Correct 212 ms 182404 KB Output is correct
4 Correct 211 ms 182476 KB Output is correct
5 Correct 265 ms 182504 KB Output is correct
6 Correct 257 ms 182476 KB Output is correct
7 Correct 115 ms 180224 KB Output is correct
8 Correct 119 ms 180168 KB Output is correct
9 Correct 180 ms 182488 KB Output is correct
10 Correct 181 ms 182476 KB Output is correct
11 Correct 179 ms 182480 KB Output is correct
12 Correct 189 ms 182544 KB Output is correct
13 Correct 209 ms 181452 KB Output is correct
14 Correct 211 ms 182420 KB Output is correct
15 Correct 244 ms 181932 KB Output is correct
16 Correct 246 ms 182552 KB Output is correct

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 141 ms 189276 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 98 ms 177228 KB Output is correct
2 Correct 114 ms 177620 KB Output is correct
3 Correct 126 ms 184204 KB Output is correct
4 Correct 169 ms 187724 KB Output is correct
5 Correct 92 ms 176696 KB Output is correct
6 Correct 91 ms 176756 KB Output is correct
7 Correct 244 ms 189260 KB Output is correct
8 Correct 189 ms 184944 KB Output is correct
9 Correct 117 ms 177580 KB Output is correct
10 Correct 196 ms 184364 KB Output is correct
11 Correct 160 ms 181452 KB Output is correct
12 Correct 114 ms 177732 KB Output is correct
13 Correct 118 ms 177712 KB Output is correct
14 Correct 137 ms 178956 KB Output is correct
15 Correct 137 ms 179732 KB Output is correct
16 Correct 125 ms 178712 KB Output is correct
17 Correct 102 ms 177120 KB Output is correct
18 Correct 111 ms 177292 KB Output is correct
19 Correct 88 ms 176688 KB Output is correct
20 Correct 91 ms 176776 KB Output is correct
21 Correct 175 ms 182428 KB Output is correct
22 Correct 210 ms 182576 KB Output is correct
23 Correct 212 ms 182404 KB Output is correct
24 Correct 211 ms 182476 KB Output is correct
25 Correct 265 ms 182504 KB Output is correct
26 Correct 257 ms 182476 KB Output is correct
27 Correct 115 ms 180224 KB Output is correct
28 Correct 119 ms 180168 KB Output is correct
29 Correct 180 ms 182488 KB Output is correct
30 Correct 181 ms 182476 KB Output is correct
31 Correct 179 ms 182480 KB Output is correct
32 Correct 189 ms 182544 KB Output is correct
33 Correct 209 ms 181452 KB Output is correct
34 Correct 211 ms 182420 KB Output is correct
35 Correct 244 ms 181932 KB Output is correct
36 Correct 246 ms 182552 KB Output is correct
37 Incorrect 101 ms 179976 KB Output isn't correct
38 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 98 ms 179832 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 98 ms 177228 KB Output is correct
2 Correct 114 ms 177620 KB Output is correct
3 Correct 126 ms 184204 KB Output is correct
4 Correct 169 ms 187724 KB Output is correct
5 Correct 92 ms 176696 KB Output is correct
6 Correct 91 ms 176756 KB Output is correct
7 Correct 244 ms 189260 KB Output is correct
8 Correct 189 ms 184944 KB Output is correct
9 Correct 117 ms 177580 KB Output is correct
10 Correct 196 ms 184364 KB Output is correct
11 Correct 160 ms 181452 KB Output is correct
12 Correct 114 ms 177732 KB Output is correct
13 Correct 118 ms 177712 KB Output is correct
14 Correct 137 ms 178956 KB Output is correct
15 Correct 137 ms 179732 KB Output is correct
16 Correct 125 ms 178712 KB Output is correct
17 Correct 102 ms 177120 KB Output is correct
18 Correct 111 ms 177292 KB Output is correct
19 Correct 88 ms 176688 KB Output is correct
20 Correct 91 ms 176776 KB Output is correct
21 Correct 107 ms 177456 KB Output is correct
22 Correct 113 ms 177632 KB Output is correct
23 Correct 140 ms 184092 KB Output is correct
24 Correct 169 ms 187832 KB Output is correct
25 Correct 93 ms 176772 KB Output is correct
26 Correct 90 ms 176692 KB Output is correct
27 Correct 239 ms 188620 KB Output is correct
28 Correct 215 ms 185792 KB Output is correct
29 Correct 134 ms 179388 KB Output is correct
30 Correct 183 ms 183996 KB Output is correct
31 Correct 161 ms 181356 KB Output is correct
32 Correct 114 ms 177492 KB Output is correct
33 Correct 108 ms 177612 KB Output is correct
34 Correct 153 ms 179836 KB Output is correct
35 Correct 135 ms 178340 KB Output is correct
36 Correct 151 ms 178868 KB Output is correct
37 Correct 85 ms 176704 KB Output is correct
38 Correct 88 ms 176780 KB Output is correct
39 Correct 175 ms 182428 KB Output is correct
40 Correct 210 ms 182576 KB Output is correct
41 Correct 212 ms 182404 KB Output is correct
42 Correct 211 ms 182476 KB Output is correct
43 Correct 265 ms 182504 KB Output is correct
44 Correct 257 ms 182476 KB Output is correct
45 Correct 115 ms 180224 KB Output is correct
46 Correct 119 ms 180168 KB Output is correct
47 Correct 180 ms 182488 KB Output is correct
48 Correct 181 ms 182476 KB Output is correct
49 Correct 179 ms 182480 KB Output is correct
50 Correct 189 ms 182544 KB Output is correct
51 Correct 209 ms 181452 KB Output is correct
52 Correct 211 ms 182420 KB Output is correct
53 Correct 244 ms 181932 KB Output is correct
54 Correct 246 ms 182552 KB Output is correct
55 Incorrect 101 ms 179976 KB Output isn't correct
56 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 98 ms 177228 KB Output is correct
2 Correct 114 ms 177620 KB Output is correct
3 Correct 126 ms 184204 KB Output is correct
4 Correct 169 ms 187724 KB Output is correct
5 Correct 92 ms 176696 KB Output is correct
6 Correct 91 ms 176756 KB Output is correct
7 Correct 244 ms 189260 KB Output is correct
8 Correct 189 ms 184944 KB Output is correct
9 Correct 117 ms 177580 KB Output is correct
10 Correct 196 ms 184364 KB Output is correct
11 Correct 160 ms 181452 KB Output is correct
12 Correct 114 ms 177732 KB Output is correct
13 Correct 118 ms 177712 KB Output is correct
14 Correct 137 ms 178956 KB Output is correct
15 Correct 137 ms 179732 KB Output is correct
16 Correct 125 ms 178712 KB Output is correct
17 Correct 102 ms 177120 KB Output is correct
18 Correct 111 ms 177292 KB Output is correct
19 Correct 88 ms 176688 KB Output is correct
20 Correct 91 ms 176776 KB Output is correct
21 Correct 107 ms 177456 KB Output is correct
22 Correct 113 ms 177632 KB Output is correct
23 Correct 140 ms 184092 KB Output is correct
24 Correct 169 ms 187832 KB Output is correct
25 Correct 93 ms 176772 KB Output is correct
26 Correct 90 ms 176692 KB Output is correct
27 Correct 239 ms 188620 KB Output is correct
28 Correct 215 ms 185792 KB Output is correct
29 Correct 134 ms 179388 KB Output is correct
30 Correct 183 ms 183996 KB Output is correct
31 Correct 161 ms 181356 KB Output is correct
32 Correct 114 ms 177492 KB Output is correct
33 Correct 108 ms 177612 KB Output is correct
34 Correct 153 ms 179836 KB Output is correct
35 Correct 135 ms 178340 KB Output is correct
36 Correct 151 ms 178868 KB Output is correct
37 Correct 85 ms 176704 KB Output is correct
38 Correct 88 ms 176780 KB Output is correct
39 Correct 175 ms 182428 KB Output is correct
40 Correct 210 ms 182576 KB Output is correct
41 Correct 212 ms 182404 KB Output is correct
42 Correct 211 ms 182476 KB Output is correct
43 Correct 265 ms 182504 KB Output is correct
44 Correct 257 ms 182476 KB Output is correct
45 Correct 115 ms 180224 KB Output is correct
46 Correct 119 ms 180168 KB Output is correct
47 Correct 180 ms 182488 KB Output is correct
48 Correct 181 ms 182476 KB Output is correct
49 Correct 179 ms 182480 KB Output is correct
50 Correct 189 ms 182544 KB Output is correct
51 Correct 209 ms 181452 KB Output is correct
52 Correct 211 ms 182420 KB Output is correct
53 Correct 244 ms 181932 KB Output is correct
54 Correct 246 ms 182552 KB Output is correct
55 Incorrect 141 ms 189276 KB Output isn't correct
56 Halted 0 ms 0 KB -