QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#198232	#6130. Plants vs. Zombies	HarryJ	WA	113ms	4896kb	C++23	1.5kb	2023-10-03 10:30:47	2023-10-03 10:30:47

Judging History

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

[2023-10-03 10:30:47]
评测

测评结果：WA
用时：113ms
内存：4896kb

查看

[2023-10-03 10:30:47]
提交

answer

#include<bits/stdc++.h>
using namespace std;

typedef long long LL;
typedef pair<int,int> P;
const LL mod=998244353;
const int INF=0x3f3f3f3f;
const int N=1e5+10;
LL a[N],d[N];
LL n,m;

int check(LL x)
{
    // for(int i=0;i<=n+10;i++) b[i]=0;
    
    // LL cnt=0;
    
    // for(int i=1;i<=n;i++)
    // {
    //     if(i==n&&b[i]>=x) break;
        
    //     cnt++;
    //     b[i]+=a[i];
        
    //     if(b[i]<x)
    //     {
    //         LL tmp=(x-b[i])/a[i]+((x-b[i])%a[i]>0);
    //         cnt+=2*tmp;
    //         b[i]+=tmp*a[i];
    //         b[i+1]+=tmp*a[i+1];
    //     }
    // }
    
    // if(cnt<=m) return 1;
    // return 0;
    
    memset(d,0,(n+1)*sizeof(LL));
    LL cnt=0;
    for(int i=1;i<=n;i++)
    {
        if(i==n && d[i]>=x) break;
        cnt++, d[i]+=a[i];
        if(d[i]>=x) continue;

        LL tmp=(x-d[i])/a[i]+((x-d[i])%a[i]>0);
        cnt+=2*tmp;
        d[i]+=tmp*a[i];
        d[i+1]+=tmp*a[i+1];
    }
    
    
    if(cnt<=m) return 1;
    return 0;
}

void solve()
{
    cin>>n>>m;
    
    for(int i=1;i<=n;i++) cin>>a[i];
    
    LL l=0,r=1e17;
    
    while(l<r)
    {
        LL mid=(l+r+1)/2;
        
        if(check(mid)) l=mid;
        else r=mid-1;
    }
    
    cout<<l<<endl;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    
    int tt; cin>>tt;
    
    while(tt--) 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: 0ms

memory: 3444kb

input:

output:

6
4

result:

ok 2 number(s): "6 4"

Test #2:

score: -100

Wrong Answer

time: 113ms

memory: 4896kb

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
16650504450556638
1000000000000
16561021906

result:

wrong answer 114th numbers differ - expected: '5910826', found: '16650504450556638'