QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#874368 | #8588. Amusement Park | Ziqt7PhR | 7 | 760ms | 9440kb | C++20 | 1.2kb | 2025-01-28 04:35:20 | 2025-01-28 04:35:21 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int q;
cin >> q;
vector<pair<int, int>> Q;
while (q--) {
int type;
cin >> type;
if (type == 1) {
int s, w;
cin >> s >> w;
Q.emplace_back(s, w);
}
else if (type == 2) {
int id;
cin >> id;
Q[id - 1].first = 0;
}
else {
int64_t b;
cin >> b;
vector<pair<int, int>> res;
for (int i = 0; i < int(Q.size()); ++i) {
if (Q[i].first == 0) { continue; }
if (Q[i].first <= b) {
res.emplace_back(i + 1, Q[i].first);
b -= Q[i].first;
Q[i].first = 0;
}
else if (Q[i].second) {
res.emplace_back(i + 1, b);
Q[i].first -= b;
b = 0;
}
}
cout << res.size() << '\n';
for (auto [id, s] : res) {
cout << id << ' ' << s << '\n';
}
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 12
Accepted
time: 1ms
memory: 3584kb
input:
7 1 2 0 1 6 0 1 6 1 3 5 2 2 1 3 0 3 123456789012
output:
2 1 2 3 3 2 3 3 4 3
result:
ok 6 lines
Test #2:
score: 12
Accepted
time: 0ms
memory: 3584kb
input:
5 1 1 0 1 1 0 1 1 0 3 2 1 1 0
output:
2 1 1 2 1
result:
ok 3 lines
Test #3:
score: 12
Accepted
time: 0ms
memory: 3712kb
input:
4 1 19 1 3 10 3 10 3 10
output:
1 1 10 1 1 9 0
result:
ok 5 lines
Test #4:
score: 0
Wrong Answer
time: 1ms
memory: 3712kb
input:
1000 1 103259 0 1 128742 0 1 58949 0 1 147463 1 1 122606 0 3 182905 1 132106 0 1 40502 1 1 123736 1 1 4543 1 1 163109 1 1 41758 0 1 176061 0 3 178835 3 184068 3 195391 1 86319 0 1 80890 1 1 121580 0 1 52574 0 1 184660 0 1 183865 0 1 160678 0 1 7243 1 1 4283 1 1 160664 0 1 161622 0 1 193227 0 1 41195...
output:
3 1 103259 3 58949 4 20697 6 2 128742 4 50093 7 0 8 0 9 0 10 0 5 4 76673 7 40502 8 66893 9 0 10 0 4 5 122606 8 56843 9 4543 10 11399 16 6 132106 10 16915 14 0 20 0 21 0 25 0 26 0 27 0 28 0 32 0 34 0 35 0 36 0 39 0 40 0 41 0 17 10 134795 14 33793 20 0 21 0 25 0 26 0 27 0 28 0 32 0 34 0 35 0 36 0 39 0...
result:
wrong answer 5th lines differ - expected: '2', found: '6'
Subtask #2:
score: 7
Accepted
Test #11:
score: 7
Accepted
time: 30ms
memory: 9440kb
input:
200000 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0...
output:
199999 1 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9 1 10 1 11 1 12 1 13 1 14 1 15 1 16 1 17 1 18 1 19 1 20 1 21 1 22 1 23 1 24 1 25 1 26 1 27 1 28 1 29 1 30 1 31 1 32 1 33 1 34 1 35 1 36 1 37 1 38 1 39 1 40 1 41 1 42 1 43 1 44 1 45 1 46 1 47 1 48 1 49 1 50 1 51 1 52 1 53 1 54 1 55 1 56 1 57 1 58 1 59 1 60 1 61...
result:
ok 200000 lines
Test #12:
score: 7
Accepted
time: 760ms
memory: 6636kb
input:
199999 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 3 10 1 1 0 1 1 0 1 1 0 3 5 1 1 0 3 4 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 3 2 1 1 0 1 1 0 1 1 0 1 1 0 3 1 1 1 0 1 1 0 1 1 0 1 1 0 3 5 1 1 0 1 1 0 1 1 0 1 1 0 1 1 ...
output:
10 1 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9 1 10 1 5 11 1 12 1 13 1 14 1 15 1 4 16 1 17 1 18 1 19 1 2 20 1 21 1 1 22 1 5 23 1 24 1 25 1 26 1 27 1 5 28 1 29 1 30 1 31 1 32 1 6 33 1 34 1 35 1 36 1 37 1 38 1 4 39 1 40 1 41 1 42 1 7 43 1 44 1 45 1 46 1 47 1 48 1 49 1 4 50 1 51 1 52 1 53 1 7 54 1 55 1 56 1 57 1...
result:
ok 117470 lines
Test #13:
score: 7
Accepted
time: 42ms
memory: 6636kb
input:
199998 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0...
output:
538 1 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9 1 10 1 11 1 12 1 13 1 14 1 15 1 16 1 17 1 18 1 19 1 20 1 21 1 22 1 23 1 24 1 25 1 26 1 27 1 28 1 29 1 30 1 31 1 32 1 33 1 34 1 35 1 36 1 37 1 38 1 39 1 40 1 41 1 42 1 43 1 44 1 45 1 46 1 47 1 48 1 49 1 50 1 51 1 52 1 53 1 54 1 55 1 56 1 57 1 58 1 59 1 60 1 61 1 ...
result:
ok 104375 lines
Subtask #3:
score: 0
Time Limit Exceeded
Dependency #2:
100%
Accepted
Test #14:
score: 20
Accepted
time: 153ms
memory: 6520kb
input:
200000 1 4 0 1 10 0 1 9 0 1 9 0 1 1 0 1 8 0 3 707714796138 1 6 0 1 1 0 1 8 0 1 5 0 1 1 0 1 3 0 1 3 0 1 8 0 1 2 0 1 2 0 1 1 0 1 3 0 1 3 0 1 10 0 1 3 0 1 2 0 1 4 0 1 4 0 1 6 0 1 5 0 1 1 0 1 8 0 1 7 0 1 1 0 1 4 0 1 9 0 1 6 0 1 7 0 1 5 0 1 4 0 1 3 0 1 7 0 1 1 0 1 5 0 1 1 0 1 10 0 1 3 0 1 6 0 3 443456506...
output:
6 1 4 2 10 3 9 4 9 5 1 6 8 38 7 6 8 1 9 8 10 5 11 1 12 3 13 3 14 8 15 2 16 2 17 1 18 3 19 3 20 10 21 3 22 2 23 4 24 4 25 6 26 5 27 1 28 8 29 7 30 1 31 4 32 9 33 6 34 7 35 5 36 4 37 3 38 7 39 1 40 5 41 1 42 10 43 3 44 6 113 45 8 46 1 47 7 48 8 49 1 50 9 51 10 52 9 53 3 54 1 55 9 56 8 57 6 58 6 59 7 6...
result:
ok 200000 lines
Test #15:
score: 20
Accepted
time: 45ms
memory: 6636kb
input:
200000 1 3 0 1 2 0 1 8 0 1 8 0 1 4 0 1 3 0 1 3 0 1 3 0 1 6 0 1 8 0 1 1 0 1 5 0 1 6 0 1 5 0 1 10 0 1 2 0 1 6 0 1 9 0 1 6 0 1 10 0 1 3 0 1 8 0 1 5 0 1 2 0 1 4 0 1 7 0 1 6 0 1 1 0 1 7 0 1 9 0 1 8 0 1 2 0 1 2 0 1 7 0 1 4 0 1 7 0 1 10 0 1 3 0 1 3 0 1 10 0 1 1 0 1 1 0 1 7 0 1 5 0 1 8 0 1 6 0 1 2 0 1 8 0 1...
output:
446 1 3 2 2 3 8 4 8 5 4 6 3 7 3 8 3 9 6 10 8 11 1 12 5 13 6 14 5 15 10 16 2 17 6 18 9 19 6 20 10 21 3 22 8 23 5 24 2 25 4 26 7 27 6 28 1 29 7 30 9 31 8 32 2 33 2 34 7 35 4 36 7 37 10 38 3 39 3 40 10 41 1 42 1 43 7 44 5 45 8 46 6 47 2 48 8 49 3 50 8 51 1 52 4 53 9 54 9 55 1 56 2 57 8 58 7 59 1 60 2 6...
result:
ok 200000 lines
Test #16:
score: 20
Accepted
time: 34ms
memory: 6668kb
input:
200000 1 1 0 1 4 0 1 5 0 1 6 0 1 5 0 1 9 0 1 4 0 1 2 0 1 8 0 1 2 0 1 1 0 1 3 0 1 10 0 1 7 0 1 9 0 1 2 0 1 7 0 1 6 0 1 5 0 1 6 0 1 5 0 1 6 0 1 1 0 1 7 0 1 2 0 1 3 0 1 6 0 1 6 0 1 1 0 1 10 0 1 6 0 1 3 0 1 7 0 1 4 0 1 7 0 1 8 0 1 10 0 1 5 0 1 10 0 1 4 0 1 7 0 1 9 0 1 5 0 1 7 0 1 10 0 1 3 0 1 6 0 1 8 0 ...
output:
7637 1 1 2 4 3 5 4 6 5 5 6 9 7 4 8 2 9 8 10 2 11 1 12 3 13 10 14 7 15 9 16 2 17 7 18 6 19 5 20 6 21 5 22 6 23 1 24 7 25 2 26 3 27 6 28 6 29 1 30 10 31 6 32 3 33 7 34 4 35 7 36 8 37 10 38 5 39 10 40 4 41 7 42 9 43 5 44 7 45 10 46 3 47 6 48 8 49 1 50 1 51 2 52 5 53 7 54 2 55 6 56 3 57 9 58 6 59 1 60 5...
result:
ok 200000 lines
Test #17:
score: 20
Accepted
time: 32ms
memory: 7020kb
input:
200000 1 5 0 1 6 0 1 6 0 1 1 0 1 2 0 1 10 0 1 1 0 1 1 0 1 10 0 1 10 0 1 7 0 1 7 0 1 1 0 1 3 0 1 5 0 1 2 0 1 6 0 1 1 0 1 8 0 1 6 0 1 6 0 1 5 0 1 7 0 1 3 0 1 9 0 1 3 0 1 10 0 1 7 0 1 5 0 1 2 0 1 1 0 1 10 0 1 1 0 1 6 0 1 10 0 1 6 0 1 10 0 1 3 0 1 9 0 1 7 0 1 8 0 1 5 0 1 8 0 1 5 0 1 1 0 1 6 0 1 2 0 1 6 ...
output:
1592 1 5 2 6 3 6 4 1 5 2 6 10 7 1 8 1 9 10 10 10 11 7 12 7 13 1 14 3 15 5 16 2 17 6 18 1 19 8 20 6 21 6 22 5 23 7 24 3 25 9 26 3 27 10 28 7 29 5 30 2 31 1 32 10 33 1 34 6 35 10 36 6 37 10 38 3 39 9 40 7 41 8 42 5 43 8 44 5 45 1 46 6 47 2 48 6 49 6 50 6 51 1 52 4 53 2 54 5 55 4 56 5 57 8 58 8 59 3 60...
result:
ok 200000 lines
Test #18:
score: 0
Time Limit Exceeded
input:
200000 1 10 0 1 10 0 1 10 0 1 10 0 1 10 0 1 10 0 1 10 0 1 10 0 1 10 0 1 10 0 1 10 0 1 10 0 1 10 0 1 10 0 1 10 0 1 10 0 1 10 0 1 10 0 1 10 0 1 10 0 1 10 0 1 10 0 1 10 0 1 10 0 1 10 0 1 10 0 1 10 0 1 10 0 1 10 0 1 10 0 1 10 0 1 10 0 1 10 0 1 10 0 1 10 0 1 10 0 1 10 0 1 10 0 1 10 0 1 10 0 1 10 0 1 10 0...
output:
1 1 10 1 59699 5 1 23746 8 1 11874 9 1 47867 6 1 95957 2 1 35761 7 1 2 10 1 47868 6 1 47869 6 1 59700 5 1 23747 8 1 71763 4 1 35762 7 1 11875 9 1 23748 8 1 3 10 1 4 10 1 47870 6 1 47871 6 1 59701 5 1 71764 4 1 11876 9 1 95958 2 1 108030 1 1 71765 4 1 23749 8 1 47872 6 1 5 10 1 47873 6 1 11877 9 1 95...
result:
Subtask #4:
score: 0
Skipped
Dependency #3:
0%
Subtask #5:
score: 0
Skipped
Dependency #4:
0%
Subtask #6:
score: 0
Skipped
Dependency #1:
0%