oj.uz

Submission #431057

# Submission time Handle Problem Language Result Execution time Memory
431057 2021-06-17T09:10:58 Z Hideo Food Court (JOI21_foodcourt) C++17
2 / 100
 1000 ms 291604 KB 
#include <bits/stdc++.h>
using namespace std;

#define all(s) s.begin(), s.end()
#define ll long long
#define fr first
#define sc second
#define pb push_back
#define mk make_pair
#define pi pair < int, int >

const int N = 65007;
const int INF = 1e9 + 7;

ll cnt[N];
int n, m, q;

deque < pair < ll , pi > > dq[N];

main (){
//    ios_base::sync_with_stdio(0);
//    cin.tie(0);
    cin >> n >> m >> q;
    for (int i = 1; i <= q; i++){
        int t;
        cin >> t;
        if (t == 1){
            int l, r, c, k;
            cin >> l >> r >> c >> k;
            for (int j = l; j <= r; j++){
                dq[j].pb({cnt[j], {k, c}});
                cnt[j] += k;
            }
        }
        else if (t == 2){
            int l, r, k;
            cin >> l >> r >> k;
            for (int j = l; j <= r; j++){
                int kc = k;
                while (!dq[j].empty() && kc){
                    int a = dq[j].front().sc.fr, b = dq[j].front().sc.sc, cc = dq[j].front().fr;
                    dq[j].pop_front();
                    if (a > kc){
                        dq[j].push_front({cc + kc, {a - kc, b}});
                        break;
                    }
                    kc -= a;
                }
            }
        }
        else {
            int a;
            ll b;
            cin >> a >> b;
            if (dq[a].empty()){
                cout << 0 << endl;
                continue;
            }
            b += dq[a].front().fr;
            if (dq[a].back().fr + dq[a].back().sc.fr < b){
                cout << 0 << endl;
                continue;
            }
            int l = 0, r = dq[a].size();
            while (l + 1 < r){
                int mid = (l + r) >> 1;
                if (dq[a][mid].fr < b)
                    l = mid;
                else
                    r = mid;
            }
            cout << dq[a][l].sc.sc << endl;
        }
    }
}

Compilation message

foodcourt.cpp:20:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   20 | main (){
      | ^~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 44492 KB Output is correct
2 Correct 55 ms 44828 KB Output is correct
3 Correct 69 ms 51396 KB Output is correct
4 Correct 72 ms 55044 KB Output is correct
5 Correct 42 ms 43980 KB Output is correct
6 Correct 37 ms 43980 KB Output is correct
7 Correct 63 ms 56512 KB Output is correct
8 Correct 70 ms 52120 KB Output is correct
9 Correct 60 ms 44888 KB Output is correct
10 Correct 69 ms 51652 KB Output is correct
11 Correct 71 ms 48756 KB Output is correct
12 Correct 59 ms 44896 KB Output is correct
13 Correct 51 ms 45004 KB Output is correct
14 Correct 63 ms 46072 KB Output is correct
15 Correct 55 ms 46980 KB Output is correct
16 Correct 65 ms 46168 KB Output is correct
17 Correct 43 ms 44360 KB Output is correct
18 Correct 57 ms 44564 KB Output is correct
19 Correct 43 ms 44036 KB Output is correct
20 Correct 39 ms 44048 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 44492 KB Output is correct
2 Correct 55 ms 44828 KB Output is correct
3 Correct 69 ms 51396 KB Output is correct
4 Correct 72 ms 55044 KB Output is correct
5 Correct 42 ms 43980 KB Output is correct
6 Correct 37 ms 43980 KB Output is correct
7 Correct 63 ms 56512 KB Output is correct
8 Correct 70 ms 52120 KB Output is correct
9 Correct 60 ms 44888 KB Output is correct
10 Correct 69 ms 51652 KB Output is correct
11 Correct 71 ms 48756 KB Output is correct
12 Correct 59 ms 44896 KB Output is correct
13 Correct 51 ms 45004 KB Output is correct
14 Correct 63 ms 46072 KB Output is correct
15 Correct 55 ms 46980 KB Output is correct
16 Correct 65 ms 46168 KB Output is correct
17 Correct 43 ms 44360 KB Output is correct
18 Correct 57 ms 44564 KB Output is correct
19 Correct 43 ms 44036 KB Output is correct
20 Correct 39 ms 44048 KB Output is correct
21 Incorrect 52 ms 44788 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

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

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Runtime error 66 ms 89016 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 48 ms 44492 KB Output is correct
2 Correct 55 ms 44828 KB Output is correct
3 Correct 69 ms 51396 KB Output is correct
4 Correct 72 ms 55044 KB Output is correct
5 Correct 42 ms 43980 KB Output is correct
6 Correct 37 ms 43980 KB Output is correct
7 Correct 63 ms 56512 KB Output is correct
8 Correct 70 ms 52120 KB Output is correct
9 Correct 60 ms 44888 KB Output is correct
10 Correct 69 ms 51652 KB Output is correct
11 Correct 71 ms 48756 KB Output is correct
12 Correct 59 ms 44896 KB Output is correct
13 Correct 51 ms 45004 KB Output is correct
14 Correct 63 ms 46072 KB Output is correct
15 Correct 55 ms 46980 KB Output is correct
16 Correct 65 ms 46168 KB Output is correct
17 Correct 43 ms 44360 KB Output is correct
18 Correct 57 ms 44564 KB Output is correct
19 Correct 43 ms 44036 KB Output is correct
20 Correct 39 ms 44048 KB Output is correct
21 Execution timed out 1090 ms 44576 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

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

Subtask #7
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 44492 KB Output is correct
2 Correct 55 ms 44828 KB Output is correct
3 Correct 69 ms 51396 KB Output is correct
4 Correct 72 ms 55044 KB Output is correct
5 Correct 42 ms 43980 KB Output is correct
6 Correct 37 ms 43980 KB Output is correct
7 Correct 63 ms 56512 KB Output is correct
8 Correct 70 ms 52120 KB Output is correct
9 Correct 60 ms 44888 KB Output is correct
10 Correct 69 ms 51652 KB Output is correct
11 Correct 71 ms 48756 KB Output is correct
12 Correct 59 ms 44896 KB Output is correct
13 Correct 51 ms 45004 KB Output is correct
14 Correct 63 ms 46072 KB Output is correct
15 Correct 55 ms 46980 KB Output is correct
16 Correct 65 ms 46168 KB Output is correct
17 Correct 43 ms 44360 KB Output is correct
18 Correct 57 ms 44564 KB Output is correct
19 Correct 43 ms 44036 KB Output is correct
20 Correct 39 ms 44048 KB Output is correct
21 Incorrect 52 ms 44788 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 44492 KB Output is correct
2 Correct 55 ms 44828 KB Output is correct
3 Correct 69 ms 51396 KB Output is correct
4 Correct 72 ms 55044 KB Output is correct
5 Correct 42 ms 43980 KB Output is correct
6 Correct 37 ms 43980 KB Output is correct
7 Correct 63 ms 56512 KB Output is correct
8 Correct 70 ms 52120 KB Output is correct
9 Correct 60 ms 44888 KB Output is correct
10 Correct 69 ms 51652 KB Output is correct
11 Correct 71 ms 48756 KB Output is correct
12 Correct 59 ms 44896 KB Output is correct
13 Correct 51 ms 45004 KB Output is correct
14 Correct 63 ms 46072 KB Output is correct
15 Correct 55 ms 46980 KB Output is correct
16 Correct 65 ms 46168 KB Output is correct
17 Correct 43 ms 44360 KB Output is correct
18 Correct 57 ms 44564 KB Output is correct
19 Correct 43 ms 44036 KB Output is correct
20 Correct 39 ms 44048 KB Output is correct
21 Incorrect 52 ms 44788 KB Output isn't correct
22 Halted 0 ms 0 KB -