QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#189424	#6130. Plants vs. Zombies	tselmegkh	WA	130ms	6268kb	C++20	1.5kb	2023-09-27 14:43:25	2023-09-27 14:43:26

Judging History

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

[2023-09-27 14:43:26]
评测

测评结果：WA
用时：130ms
内存：6268kb

查看

[2023-09-27 14:43:25]
提交

answer

#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iomanip>
using namespace std;

const int N = 2e5 + 5, inf = 1e9;
#define pb push_back
#define mp make_pair
#define ll long long
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define sz(x) (int)x.size()
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;

int n; ll m;
ll a[N], b[N];

bool check(ll x){
    for(int i = 1; i <= n; i++){
        b[i] = (x + a[i] - 1) / a[i];
    }
    vector<ll> dp(n + 1), iluu(n + 1);
    dp[1] = 2 * b[1] - 1;
    iluu[1] = b[1] - 1;
    for(int i = 2; i <= n; i++){
        b[i] = max(0ll, b[i] - iluu[i - 1]);
        if(b[i] == 0){
            dp[i] = dp[i - 1] + 1;
        } else {
            dp[i] = dp[i - 1] + 2 * b[i] - 1;
            iluu[i] = b[i] - 1;
        }
    }
    return dp[n] <= 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) / 2;
        if(check(mid)){
            l = mid;
        } else {
            r = mid - 1;
        }
    }
    cout << l << '\n';
}

int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int t = 1;
    cin >> t;
    while(t--){
        solve();
    }
    return 0;
}

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 5480kb

input:

output:

6
4

result:

ok 2 number(s): "6 4"

Test #2:

score: -100

Wrong Answer

time: 130ms

memory: 6268kb

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'