QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#398168	#6130. Plants vs. Zombies	ir101	WA	117ms	6488kb	C++17	1.7kb	2024-04-25 01:11:04	2024-04-25 01:11:04

Judging History

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

[2024-04-25 01:11:04]
评测

测评结果：WA
用时：117ms
内存：6488kb

查看

[2024-04-25 01:11:04]
提交

answer

#include <bits/stdc++.h>
#define endl '\n'
#define int long long
using namespace std;
void solve(){
    int n, m;
    cin >> n >> m;
    vector<int> a(n + 1);
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
    }
//    if (m < n) {
//        cout << "0\n";
//        return ;
//    }
    auto check = [=](int x) {
        if (x == 0) return true;
        vector<__int128> cnt(n + 5, 0);
        __int128 all = 0;
        for (int i = 1; i <= n; ++i) {
            cnt[i] = (x + a[i] - 1) / a[i];
            all += cnt[i];
        }
        if (all > m) return false;
        if (all == 0) return true;
        __int128 sum = 0;
        for (int i = 1; i <= n; ++i) {
            if (all <= 0) break;
            if (cnt[i] > 0) all --;
            sum ++, cnt[i] --;//->i
            if (cnt[i] <= 0) continue;
            all -= cnt[i];
            if (cnt[i] * 2 > m) return false;
            sum += cnt[i] * 2;
            if (sum > m) return false;
            int c = cnt[i];
            cnt[i] -= c;
            cnt[i] = max((__int128)0, cnt[i]);
            if (cnt[i + 1] > 0) all -= min(cnt[i + 1], cnt[i]);
            cnt[i + 1] -= c;
            cnt[i + 1] = max((__int128)0, cnt[i + 1]);
            if ((int)sum > m) return false;
        }
        return sum <= m;
    };
    __int128 l = 0, r = 1e17 + 1, ans;
    while (l <= r) {
        int mid = l + r >> 1;
        if (check(mid)) ans = mid, l = mid + 1;
        else r = mid - 1;
    }
    cout << (int)ans << '\n';
}
signed main() {
    ios::sync_with_stdio(false),cin.tie(0);
    int t;
    cin>>t;
    while ( t-- ){
        solve();

    }
    return 0;
}

Source code, Language: C++17

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 1ms

memory: 3612kb

input:

output:

6
4

result:

ok 2 number(s): "6 4"

Test #2:

score: -100

Wrong Answer

time: 117ms

memory: 6488kb

input:

116
4 0
3 2 6 6
4 1
3 2 6 6
10 19
10 2 8 4 2 4 9 3 3 3
4 8
3 9 3 6
2 19
2 10
11 15
3 1 1 4 3 7 10 8 6 7 10
10 14
8 7 1 1 10 9 2 8 10 7
2 13
2 3
10 10
8 1 6 6 9 4 7 1 8 8
7 14
6 7 4 5 3 1 3
11 6
8 1 10 9 7 2 6 6 1 3 9
4 10
6 1 3 8
7 7
10 6 2 10 4 7 2
5 11
9 10 5 9 2
9 1
2 4 8 6 2 8 8 1 6
4 5
7 2 9 8
...

output:

0
0
4
6
18
3
2
12
1
4
0
4
2
6
0
2
24
3
30
10
0
2
3
0
0
2
6
0
1
6
24
28
1
3
3
0
4
10
6
4
1
5
0
1
0
7
30
2
0
0
16
8
0
30
2
25
4
2
0
0
2
0
2
0
5
2
0
0
0
0
5
0
4
4
28
0
0
21
3
0
2
4
0
0
14
4
6
1
0
5
12
3
8
0
4
0
10
12
5
6
1
6
9
0
725
0
17
132
676
588
110
0
163
5910826
1000000000000
16561021906

result:

wrong answer 5th numbers differ - expected: '20', found: '18'