QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#705388	#6130. Plants vs. Zombies	carboxylBase	AC ✓	282ms	10124kb	C++23	1.9kb	2024-11-02 23:15:48	2024-11-02 23:15:50

Judging History

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

[2024-11-02 23:15:50]
评测

测评结果：AC
用时：282ms
内存：10124kb

查看

[2024-11-02 23:15:48]
提交

answer

#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
int n,m;
int a[2000000];
int b[2000000];
int c[2000000];
bool check(int x){
   // int sum = 0;
    for (int i = 1;i<n+1;i++){
        b[i] = x / a[i];
        if (x % a[i] == 0){
        }else{
            b[i]++;
        }
       //  cout<<i<<" "<<b[i]<<endl;
    }
    int res = -1;
    for (int i = n;i>0;i--){
        c[i] = res;
        if (b[i]){
            res = i;
        }
    }
    int cnt = 0;
    for (int i = 1;i<=n;i++){
        cnt++;
        // cout<<i<<" "<<cnt<<endl;
        b[i]--;
        if (b[i-1]>0){
            cnt += 2 * b[i-1] - 1;
            // cout<<cnt<<endl;
            // cout<<i<<endl;
            b[i] -= b[i-1]-1;
            if (b[i]<=0&&c[i]==-1){
                if (cnt<=m){
                    return 1;
                }
                return 0;
            }
            cnt++;
            if (cnt > m){
                return 0;
            }
            b[i] --;
        }
        // cout<<i<<" "<<cnt<<endl;
       // cout<<i<<" "<<b[i]<<endl;
    }
    // cout<<b[n]<<endl;
    if (b[n] > 0){
        cnt += b[n] * 2;
    }
    if (cnt > m){
        return 0;
    }
    return 1;
}
void solve()
{
    cin >> n >> m;
    for (int i = 1;i<n+1;i++){
        cin >> a[i];
    }
    // check(4);
    // check(20);
    int l = 0,r = 1e18,mid,ans = 0;
    while (l<=r){
        // cout<<l<<endl;
        mid = l+r>>1;
        if (check(mid)){
            l = mid + 1;
            ans = mid;
        }else{
            r = mid - 1;
        }
    }
   //  check(6);
    cout<<ans<<endl;
    return;
}
signed main()
{
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
    ios::sync_with_stdio(0), cin.tie(nullptr), cout.tie(0);
    int t = 1;
    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: 7716kb

input:

output:

6
4

result:

ok 2 number(s): "6 4"

Test #2:

score: 0

Accepted

time: 101ms

memory: 10096kb

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

memory: 10124kb

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