QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#94933	#6130. Plants vs. Zombies	George_Plover^#	AC ✓	569ms	7844kb	C++23	991b	2023-04-08 13:06:41	2023-04-08 13:06:42

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 13:06:42]
评测

测评结果：AC
用时：569ms
内存：7844kb

查看

[2023-04-08 13:06:41]
提交

answer

#include <map>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define LL long long
#define MAXN 1100000
using namespace std;
int T,n;
LL m;
int a[MAXN];
LL b[MAXN];

bool check(LL x){
    if(!x)return 1;
    for(int i=1;i<=n;i++)b[i]=(x-1)/a[i]+1;
    __int128_t sum=0;
    for(int i=1;i<=n;i++){
        if(b[i]){
            sum+=b[i]*2-1;
            b[i+1]-=b[i]-1;
            if(b[i+1]<0)b[i+1]=0;
        }
        else if(i<n){
            sum+=1;
        }
    }
    return sum<=m;
}

int main(){
    scanf("%d",&T);
    while(T--){
        scanf("%d%lld",&n,&m);
        for(int i=1;i<=n;i++){
            scanf("%d",&a[i]);
        }
        LL L=0,R=1e18;
        while(L!=R){
            LL mid=(L+R+1)/2;
            if(check(mid)){
                L=mid;
            }
            else{
                R=mid-1;
            }
        }
        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: 2ms

memory: 5536kb

input:

output:

6
4

result:

ok 2 number(s): "6 4"

Test #2:

score: 0

Accepted

time: 228ms

memory: 6584kb

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

memory: 7844kb

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