QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#264914#7744. Elevatorucup-team1264#AC ✓303ms16296kbC++202.3kb2023-11-25 16:00:222023-11-25 16:00:23

Judging History

你现在查看的是最新测评结果

  • [2023-11-25 16:00:23]
  • 评测
  • 测评结果:AC
  • 用时:303ms
  • 内存:16296kb
  • [2023-11-25 16:00:22]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;

#define int i64
void solve() {
    int n, k;
    cin >> n >> k;
    multiset<tuple<int, int, int>> st;
    multiset<pair<int, int>> stw[3];
    int ans = 0;
    for (int i = 0; i < n; i++) {
        int c, w, f;
        cin >> c >> w >> f;
        st.insert({f, w, c});
        stw[w].insert({f, c});
    }
    int rem_size = 0;
    while (st.size()) {
        if (rem_size) {
            if (rem_size > 1) {
                auto it = --st.end();
                auto [f, w, c] = *it;
                st.erase(it);
                stw[w].extract({f, c});
                int use_count = min(rem_size / w, c);
                c -= use_count;
                rem_size -= use_count * w;
                if (c) {
                    st.insert({f, w, c});
                    stw[w].insert({f, c});
                }
            } else {
                if (stw[1].size()) {
                    int w = 1;
                    auto it = --stw[w].end();
                    auto [f, c] = *it;
                    st.extract({f, w, c});
                    stw[w].erase(it);
                    int use_count = 1;
                    c -= use_count;
                    rem_size -= use_count;
                    assert(rem_size == 0);
                    if (c) {
                        st.insert({f, w, c});
                        stw[w].insert({f, c});
                    }
                } else {
                    rem_size--;
                }
            }
        } else {
            auto it = --st.end();
            auto [f, w, c] = *it;
            st.erase(it);
            stw[w].extract({f, c});
            {
                int divide = (c * w) / k;
                if (divide) {
                    c -= (divide * k) / w;
                    ans += divide * f;
                }
            }
            if (c) {
                rem_size += k;
                ans += f;
                st.insert({f, w, c});
                stw[w].insert({f, c});
            }
        }
    }
    cout << ans << "\n";
}
#undef int

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }
}

这程序好像有点Bug,我给组数据试试?

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3580kb

input:

2
4 6
1 1 8
7 2 5
1 1 7
3 2 6
8 1200000
100000 1 100000
100000 1 12345
100000 2 100000
100000 2 12345
100000 1 100000
100000 1 12345
100000 2 100000
100000 2 12345

output:

24
100000

result:

ok 2 lines

Test #2:

score: 0
Accepted
time: 107ms
memory: 16068kb

input:

5501
8 104
5 2 3
6 2 4
5 2 3
6 2 9
8 2 4
2 1 3
7 2 4
8 2 8
1 290
3 1 1
12 12
6 1 2
1 2 2
1 1 2
1 2 4
6 1 1
1 2 5
6 1 4
4 1 4
6 2 4
6 2 5
4 2 5
4 1 4
5 334
1 1 4
1 2 3
4 2 1
5 1 1
2 1 2
13 218
5 2 3
5 1 4
1 2 1
1 2 5
3 2 2
1 1 3
4 2 2
1 2 5
2 2 1
2 1 5
3 2 1
5 2 1
1 1 4
10 260
7 2 1
5 1 1
5 2 4
6 1 6...

output:

9
1
23
4
5
7
1
3
9
6
1
10
4
9
17
6
4
1
8
5
5
7
1
3
23
6
3
3
2
2
2
3
8
1
5
6
9
11
147
7
10
2
7
7
8
6
5
5
1
7
3
5
10
7
7
10
8
1
4
2
3
9
1
5
2
9
1
6
7
7
6
10
18
8
10
4
10
9
2
8
3
5
9
3
6
5
3
2
6
1
3
2
2
1
6
9
6
3
4
8
9
9
2
6
1
2
6
7
5
2
5
21
8
1
2
3
4
9
3
4
6
5
9
6
1
7
3
7
3
2
2
8
7
3
5
9
7
10
7
3
2
4
...

result:

ok 5501 lines

Test #3:

score: 0
Accepted
time: 298ms
memory: 16016kb

input:

3
100000 8
8 2 6
7 2 8
5 1 10
7 2 7
4 1 7
6 2 9
7 1 2
3 1 1
5 1 10
5 1 1
3 2 10
5 2 5
7 1 6
5 2 7
7 2 1
5 1 6
2 2 10
8 1 7
7 1 1
10 2 6
9 1 1
8 1 4
10 1 4
6 1 1
4 1 4
1 2 9
3 2 6
6 1 3
4 1 7
9 2 5
8 2 4
7 2 1
2 2 10
6 2 9
3 1 3
2 2 3
2 2 4
7 2 4
8 1 1
5 2 3
5 2 7
7 2 9
1 1 4
5 1 2
2 1 9
3 2 1
9 2 2
...

output:

568601
4708350936
93900404329230

result:

ok 3 lines

Test #4:

score: 0
Accepted
time: 303ms
memory: 16016kb

input:

3
100000 174
90429 1 64237
30851 1 44358
63571 2 89174
20391 2 28747
13561 2 88689
81508 2 28383
85733 1 5777
37524 2 34730
10588 2 88519
61493 2 83682
55885 1 65270
17669 2 63015
85387 1 64757
91420 2 74020
9067 2 91750
20809 1 52771
36478 2 17941
62064 1 36433
72912 2 6100
53923 2 73971
65825 2 39...

output:

2156004461915
884586357480
59034901233

result:

ok 3 lines

Test #5:

score: 0
Accepted
time: 221ms
memory: 16296kb

input:

3
100000 4418822
19907 1 13081
59730 2 93611
35050 1 5867
87777 1 21890
18374 1 82418
79526 2 76106
33510 2 45826
75573 1 42240
35449 1 98727
80720 2 65290
32021 2 51348
52399 2 97828
75498 2 51728
89905 1 22825
2855 1 26204
11427 1 99583
55530 2 37895
22256 2 92230
19533 1 9142
16138 1 54018
53102 ...

output:

84699074
270668
100000

result:

ok 3 lines

Extra Test:

score: 0
Extra Test Passed