QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#198019	#6130. Plants vs. Zombies	HarryJ	AC ✓	485ms	3168kb	C++23	1.4kb	2023-10-02 23:40:32	2023-10-02 23:40:32

Judging History

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

[2023-10-02 23:40:32]
评测

测评结果：AC
用时：485ms
内存：3168kb

查看

[2023-10-02 23:40:32]
提交

answer

#include<stdio.h>
const int N = 1e5 + 5;

long long n, m, a[N];

bool A(long long x)
{
    long long b[N] = {0};
    long long i, k, z;
    for(i = 0, k = m; i < n - 1; i++)
    {
        if(b[i] >= x)
        {
            if(k > 0)
                k--;
            else
                return 0;
            continue;
        }
        z = x - b[i];
        if(z % a[i])
            z = z / a[i] + 1;
        else
            z = z / a[i];

        if(k < z * 2 - 1)
            return false;
        k -= z * 2 - 1;
        b[i+1] += (z-1) * a[i+1];
    }
    if(b[i] < x)
    {
        z = x - b[i];
        if(z % a[i])
            z = z / a[i] + 1;
        else
            z = z / a[i];
        if(k < z * 2 - 1)
            return false;
    }
    return true;
}

int main()
{
    long long t, i, x, r, l;
    scanf("%lld", &t);
    while(t--)
    {
        scanf("%lld%lld", &n, &m);
        r = 1e17;
        for(i = 0; i < n; i++)
        {
            scanf("%lld", &a[i]);
            if(r > a[i] * m)
                r =  a[i] * m;
        }
        l = 0;
        while(r - l > 1)
        {
            x = (r + l) / 2;
            if(A(x))
                l = x;
            else
                r = x;
        }
        if(A(r))
            printf("%lld\n", r);
        else
            printf("%lld\n", l);
    }
    return 0;
}

Source code, Language: C++23

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 2392kb

input:

output:

6
4

result:

ok 2 number(s): "6 4"

Test #2:

score: 0

Accepted

time: 114ms

memory: 3168kb

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
20
3
2
14
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
4
3
0
4
10
6
4
1
5
0
2
0
7
30
2
0
0
16
8
0
30
2
30
4
2
0
0
2
0
2
0
5
2
0
0
0
0
5
0
4
6
28
0
0
21
3
0
2
4
0
0
14
4
6
1
0
5
14
3
8
0
4
0
10
12
5
8
1
6
12
0
725
0
17
132
676
588
110
0
163
5910826
1000000000000
16561021906

result:

ok 116 numbers

Test #3:

score: 0

Accepted

time: 485ms

memory: 3164kb

input:

2110
4 0
3 2 6 6
4 1
3 2 6 6
2 7
3 9
28 82
68 27 32 98 88 19 96 37 53 50 45 37 41 92 51 70 73 84 2 53 7 89 9 59 24 23 62 97
22 145
61 22 87 34 75 89 22 6 10 74 21 35 33 23 85 66 89 46 16 48 2 48
25 146
67 63 93 98 1 70 57 45 40 15 1 5 54 38 96 19 94 18 43 98 28 45 47 92 46
21 26
83 54 21 72 25 47 2 ...

output:

result:

ok 2110 numbers