QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#493384	#6130. Plants vs. Zombies	1DemonS1	WA	171ms	4720kb	C++20	1.2kb	2024-07-27 08:42:47	2024-07-27 08:42:47

Judging History

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

[2024-07-27 08:42:47]
评测

测评结果：WA
用时：171ms
内存：4720kb

查看

[2024-07-27 08:42:47]
提交

answer

#include<bits/stdc++.h>
#define int long long
#define endl "\n"
#define PII std::pair<int,int>
#define ll long long
#define inf 0x3f3f3f3f
using namespace std;
const int maxn = 1e5 + 5;
int n, m, h[maxn];
vector<int> A(maxn);
bool check(int k) {
    memset(h, 0, sizeof(ll) * maxn);
    h[1] = A[1];
    int mm = m - 1;
    for (int i = 1; i <= n; ++i) {
        if (h[i] < k) {
            int kase = ceil((k - h[i]) * 1.0 / A[i]);
            h[i] += kase * A[i];
            h[i + 1] += kase * A[i + 1];
            mm -= kase << 1;
        }
        if (mm < 0) return false;
        mm--;
        h[i + 1] += A[i + 1];
    }
    return true;
}
signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
    //cout << fixed << setprecision(2);
    int T; cin >> T;
    while (T--) {
        cin >> n >> m;
        for (int i = 1; i <= n; ++i) cin >> A[i];
        int l = 0, r = 1e18, ans = 0;
        while (l <= r) {
            int mid = l + r >> 1;
            if (check(mid)) {
                l = mid + 1;
                ans = mid;
            }
            else r = mid - 1;
        }
        cout << ans << endl;
    }
    return 0;
}

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 2ms

memory: 4656kb

input:

output:

6
4

result:

ok 2 number(s): "6 4"

Test #2:

score: -100

Wrong Answer

time: 171ms

memory: 4720kb

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'