QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#266889	#6130. Plants vs. Zombies	zlxFTH	WA	79ms	4740kb	C++17	1.2kb	2023-11-26 19:01:15	2023-11-26 19:01:15

Judging History

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

[2023-11-26 19:01:15]
评测

测评结果：WA
用时：79ms
内存：4740kb

查看

[2023-11-26 19:01:15]
提交

answer

#include<bits/stdc++.h>
#define rep(i, a, b) for (auto cc##i = (b), i = (a); i <= cc##i; ++i)
#define per(i, a, b) for (auto cc##i = (b), i = (a); i >= cc##i; --i)
#define debug(...) fprintf(stderr, __VA_ARGS__)
using namespace std;

typedef long long LL;
const int N=100005;

int T,n,a[N];
LL m;
LL d[N];

long long read(){
    long long k=0;
    char c=getchar();
    while(c<'0'||c>'9')c=getchar();
    while(c>='0'&&c<='9'){
        k=k*10+c-'0';
        c=getchar();
    }
    return k;
}

bool check(long long x){
    LL num = n - 1;
    rep(i, 1, n) {
        d[i] = (x - 1) / a[i] + 1;
        d[i]--;
    }
    per(i, n, 1) {
        if (d[i] <= 0) continue;
        num += d[i] * 2;
        if (num > m) return 0;
        if (i > 1)
            d[i - 1] -= d[i];
    }
    return num <= m;
}

int main(){
    T=read();
    while(T--){
        n=read();m=read();
        for(int i(1);i<=n;++i)a[i]=read();
        long long l(1),r(1e18),ans(0);
        while(l<=r){
            long long mid=(l+r)>>1;
            if(check(mid))ans=mid,l=mid+1;
            else r=mid-1;
        }
        printf("%lld\n",ans);
    }
    return 0;
}

Source code, Language: C++17

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 1ms

memory: 3748kb

input:

output:

6
4

result:

ok 2 number(s): "6 4"

Test #2:

score: -100

Wrong Answer

time: 79ms

memory: 4740kb

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

result:

wrong answer 16th numbers differ - expected: '2', found: '4'