QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#190518	#6130. Plants vs. Zombies	Zhou_JK	WA	91ms	4624kb	C++23	1.0kb	2023-09-29 01:41:37	2023-09-29 01:41:37

Judging History

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

[2023-09-29 01:41:37]
评测

测评结果：WA
用时：91ms
内存：4624kb

查看

[2023-09-29 01:41:37]
提交

answer

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int N=100005;
int n;
long long m;
int a[N];
long long b[N];
bool check(long long x)
{
    long long tot=0;
    for(int i=1;i<=n;i++)
        b[i]=0;
    for(int i=1;i<=n;i++)
        if(b[i]<x)
        {
            long long t=(x-b[i]+a[i]-1)/a[i];
            tot+=t*2-1;
            if(tot>m) return false;
            b[i+1]+=a[i+1]*(t-1);
        }
        else
        {
            tot++;
            if(tot>m) return false;
        }
    return true;
}
void solve()
{
    cin>>n>>m;
    for(int i=1;i<=n;i++)
        cin>>a[i];
    long long l=1,r=*max_element(a+1,a+n+1)*m,ans=0;
    while(l<=r)
    {
        long long mid=(l+r)/2;
        if(check(mid)) ans=mid,l=mid+1;
        else r=mid-1; 
    }
    cout<<ans<<"\n";
    return;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr),cout.tie(nullptr);
    int T;
    cin>>T;
    while(T--)
        solve();
    return 0;
}

Source code, Language: C++23

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 1ms

memory: 3468kb

input:

output:

6
4

result:

ok 2 number(s): "6 4"

Test #2:

score: -100

Wrong Answer

time: 91ms

memory: 4624kb

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

result:

wrong answer 5th numbers differ - expected: '20', found: '18'