QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#705322	#6130. Plants vs. Zombies	carboxylBase	WA	29ms	8500kb	C++23	1.4kb	2024-11-02 22:57:32	2024-11-02 22:57:36

Judging History

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

[2024-11-02 22:57:36]
评测

测评结果：WA
用时：29ms
内存：8500kb

查看

[2024-11-02 22:57:32]
提交

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];
bool check(int x){
    for (int i = 1;i<n+1;i++){
        b[i] = x / a[i];
        if (x % a[i] == 0){
        }else{
            b[i]++;
        }
    }
    b[1]--;
    int cnt = 2;
    for (int i = 2;i<=n;i++){
        // cout<<i<<" "<<cnt<<endl;
        b[i]--;
        if (b[i-1]>0){
            cnt += 2 * b[i-1];
            if (cnt > m){
                return 0;
            }
            b[i] -= b[i-1];
        }
    }
    // 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);
    int l = 1,r = 1e3,mid,ans;
    while (l<=r){
        // cout<<l<<endl;
        mid = l+r>>1;
        if (check(mid)){
            l = mid + 1;
            ans = mid;
        }else{
            r = mid - 1;
        }
    }
    check(7);
    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: 5628kb

input:

output:

6
4

result:

ok 2 number(s): "6 4"

Test #2:

score: -100

Wrong Answer

time: 29ms

memory: 8500kb

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:

94484803760592
94484803760592
6
6
18
5
5
12
3
6
2
5
4
8
94484803760592
4
24
4
30
14
1
4
6
2
6
2
8
8
3
8
24
28
2
4
4
3
6
10
6
5
4
5
2
3
6
7
36
4
2
3
16
10
94484803760592
30
4
25
8
4
5
2
4
94484803760592
3
94484803760592
6
3
6
3
1
2
7
94484803760592
6
4
28
94484803760592
1
24
6
1
4
4
94484803760592
2
...

result:

wrong answer 1st numbers differ - expected: '0', found: '94484803760592'