QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#266892	#6130. Plants vs. Zombies	zlxFTH	AC ✓	232ms	9860kb	C++17	2.4kb	2023-11-26 19:03:53	2023-11-26 19:03:54

Judging History

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

[2023-11-26 19:03:54]
评测

测评结果：AC
用时：232ms
内存：9860kb

查看

[2023-11-26 19:03:53]
提交

answer

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define max_n 510101
void read(int &p)
{
    p = 0;
    int k = 1;
    char c = getchar();
    while (c < '0' || c > '9')
    {
        if (c == '-')
        {
            k = -1;
        }
        c = getchar();
    }
    while (c >= '0' && c <= '9')
    {
        p = p * 10 + c - '0';
        c = getchar();
    }
    p *= k;
    return;
}
void write_(int x)
{
    if (x < 0)
    {
        putchar('-');
        x = -x;
    }
    if (x > 9)
    {
        write_(x / 10);
    }
    putchar(x % 10 + '0');
}
void writesp(int x)
{
    write_(x);
    putchar(' ');
}
void writeln(int x)
{
    write_(x);
    putchar('\n');
}
int T, n, m;
int nums[max_n];
int flag[max_n];
// bool check(int lim)
// {
//     for (int i = 1; i <= n; i++)
//     {
//         flag[i] = lim / nums[i] + (lim % nums[i] != 0);
//     }
//     int sum = 0;
//     for (int i = 1; i <= n; i++)
//     {
//         if (sum > m)
//         {
//             return false;
//         }
//         if (flag[i] <= 0)
//         {
//             ++sum;
//         }
//         else
//         {
//             --flag[i];
//             sum += (flag[i] << 1LL);
//             flag[i + 1] -= flag[i];
//             ++sum;
//         }
//     }
//     return sum <= m;
// }
bool check(int lim)
{
    for (int i = 1; i <= n; i++)
    {
        flag[i] = lim / nums[i] + (lim % nums[i] != 0);
    }
    int sum = 0;
    for (int i = 1; i <= n; i++)
    {
        if (sum > m)
        {
            return false;
        }
        if (flag[i] <= 0 && i != n)
        {
            ++sum;
        }
        else if (flag[i] > 0)
        {
            --flag[i];
            sum += (flag[i] << 1LL);
            flag[i + 1] -= flag[i];
            ++sum;
        }
    }
    return sum <= m;
}
void solution()
{
    read(n);
    read(m);
    for (int i = 1; i <= n; i++)
    {
        read(nums[i]);
    }
    int l = 0, r = 1e18, res = 0;
    while (l <= r)
    {
        int mid = (l + r) >> 1;
        if (check(mid))
        {
            l = mid + 1;
            res = mid;
        }
        else
        {
            r = mid - 1;
        }
    }
    writeln(res);
}
signed main()
{
    read(T);
    while (T--)
    {
        solution();
    }
    return 0;
}

源文件, 语言: C++17

详细

Test #1:

score: 100

Accepted

time: 1ms

memory: 5672kb

input:

output:

6
4

result:

ok 2 number(s): "6 4"

Test #2:

score: 0

Accepted

time: 89ms

memory: 9860kb

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: 232ms

memory: 6432kb

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