QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#556157	#6130. Plants vs. Zombies	shstyle	AC ✓	275ms	5912kb	C++20	1.3kb	2024-09-10 15:26:59	2024-09-10 15:27:00

Judging History

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

[2024-09-10 15:27:00]
评测

测评结果：AC
用时：275ms
内存：5912kb

查看

[2024-09-10 15:26:59]
提交

answer

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 10;

ll n, m;
ll a[N], b[N];

ll lbr[N];

//[i,j-1]
bool check(ll x){
    lbr[n+1]=0;
    for(int i=1;i<=n;i++) lbr[i]=(x+a[i]-1)/a[i];
    ll num=m;
    int i=0,j=1;
    int now=0;
    for(int i=1;i<=n;i++){
        if(lbr[i]==0) continue;
        if(now<i){
            num-=(i-now);
            now=i;
            lbr[i]--;
            lbr[i]=max(lbr[i],0ll);
            if(num<0){
                return false;
            }
        }
        ll cnt=2*lbr[i];
        num-=cnt;
        if(num<0){
            return false;
        }
        lbr[i+1]-=lbr[i];
        lbr[i]-=lbr[i];
        lbr[i+1]=max(0ll,lbr[i+1]);
        // for(int j=1;j<=n;j++) cout<<lbr[j]<<" ";
        // cout<<endl;
        // cout<<now<<" "<<num<<endl;;
        // cout<<endl;
    }



    return true;
}





void __()
{
    scanf("%lld%lld", &n, &m);
    for (int i = 1; i <= n; i++)
        scanf("%lld", &a[i]);
    ll l=0,r=1e18;
    // check(14);
    while(l<r){
        ll mid=l+r+1>>1;
        if(check(mid)) l=mid;
        else r=mid-1;
    }
    printf("%lld\n",l);
}

int main()
{
    int _;
    cin >> _;
    while (_--)
    {
        __();
    }
}

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 1ms

memory: 5912kb

input:

output:

6
4

result:

ok 2 number(s): "6 4"

Test #2:

score: 0

Accepted

time: 100ms

memory: 5360kb

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

memory: 5428kb

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