QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#247665	#6130. Plants vs. Zombies	OMoonStars^#	WA	106ms	4876kb	C++14	1.6kb	2023-11-11 15:23:41	2023-11-11 15:23:41

Judging History

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

[2023-11-11 15:23:41]
评测

测评结果：WA
用时：106ms
内存：4876kb

查看

[2023-11-11 15:23:41]
提交

answer

#include<algorithm>
#include<array>
#include<bitset>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<iomanip>
#include<iostream>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<unordered_map>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define endl '\n'
using namespace std;
using ll=long long;
using db=double;
using pii=pair<int,int>;
const int inf=0x3f3f3f3f;
const int mod=998244353;
const int N=1e5+10,M=1e3+10;
int n;
ll m;
int a[N];
ll cnt[N];
bool check(ll x)
{
    for(int i=1;i<=n;i++)
        cnt[i]=(x+a[i]-1)/a[i];
    // cnt[n + 1] = 0;
    ll sum=0;
    // for(int i=1;i<n;i++)
    //     if(cnt[i]>0)
    //     {
    //         sum+=cnt[i]*2;
    //         cnt[i+1]-=cnt[i];
    //     }
    // if(cnt[n]<0)sum--;
    // else sum+=cnt[n]*2;
    for(int i = 1; i < n; ++i)
    {
        if(cnt[i] >= cnt[i + 1])
        {
            sum += cnt[i] * 2;
            cnt[i + 1] -= cnt[i];
            i++;
        }
        else
        {
            sum += cnt[i] * 2 - 1;
            cnt[i + 1] -= cnt[i] - 1;
        }
    }
    if(cnt[n] > 0) sum += cnt[n] * 2 - 1;
    return sum<=m;
}
void solve()
{
    cin >> n >> m;
    for(int i=1;i<=n;i++)
        cin >> a[i];
    ll l=0,r=1e18;
    while(l<r)
    {
        ll mid=l+r+1>>1;
        if(check(mid))l=mid;
        else r=mid-1;
    }
    cout << r << endl;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t;
    cin >> t;
    while(t--)
        solve();
    return 0;
}

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3624kb

input:

output:

6
4

result:

ok 2 number(s): "6 4"

Test #2:

score: -100

Wrong Answer

time: 106ms

memory: 4876kb

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
581298493411633717
1000000000000
7400288227...

result:

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