QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#94957	#6130. Plants vs. Zombies	2000805113^#	WA	210ms	4912kb	C++17	1.5kb	2023-04-08 14:36:57	2023-04-08 14:37:01

Judging History

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

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2023-04-08 14:37:01]
评测

测评结果：WA
用时：210ms
内存：4912kb

查看

[2023-04-08 14:36:57]
提交

answer

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

using ll = long long;
const int maxn = 1e5;
ll n, m;
ll a[maxn + 10];
ll d[maxn + 10];

bool check(ll res)
{
    ll mm = m;
    for (int i = 1; i <= n; i++)
        d[i] = 0;
    for (int i = 1; i <= n; i++)
    {
        if(m <= 0)
            break;
        d[i] += a[i];
        mm--;
        if (d[i] < res)
        {
            ll x = res - d[i];
            ll cnt = x / a[i];
            if (x % a[i] != 0)
                cnt++;
            cnt = min(cnt, mm / 2);
            if (i < n)
            {
                d[i] += cnt * a[i];
                d[i + 1] += cnt * a[i + 1];
            }
            else
            {
                d[i] += cnt * a[i];
                d[i - 1] += cnt * a[i - 1];
            }
            mm -= cnt * 2;
        }
    }
    for (int i = 1; i <= n; i++)
    {
        if (d[i] < res)
            return false;
    }
    return true;
}

void solve()
{
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
    }
    ll l = 0, r = 1e15;
    ll res = 0;
    while (l <= r)
    {
        ll mid = (l + r) / 2;
        if (check(mid))
        {
            res = mid;
            l = mid + 1;
        }
        else
        {
            r = mid - 1;
        }
    }
    cout << res << "\n";
}
int 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: 0ms

memory: 3424kb

input:

output:

6
4

result:

ok 2 number(s): "6 4"

Test #2:

score: -100

Wrong Answer

time: 210ms

memory: 4912kb

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
2
4
6
20
4
3
14
1
4
1
5
2
6
1
4
32
4
30
10
1
3
3
2
6
4
6
3
2
7
24
28
1
4
3
3
4
10
6
4
4
5
1
2
2
7
30
3
2
1
16
8
0
30
2
30
8
3
5
1
4
0
2
1
6
2
3
3
1
2
5
2
5
6
28
4
1
21
3
1
2
4
3
1
14
4
8
1
1
5
14
3
8
0
5
1
10
12
5
8
2
6
12
2
725
11
33
132
684
597
110
1
163
5910826
1000000000000
16561021906

result:

wrong answer 2nd numbers differ - expected: '0', found: '2'