QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#748468	#6130. Plants vs. Zombies	tassei903^#	WA	127ms	5268kb	C++20	1.4kb	2024-11-14 20:28:46	2024-11-14 20:28:46

Judging History

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

[2024-11-14 20:28:46]
评测

测评结果：WA
用时：127ms
内存：5268kb

查看

[2024-11-14 20:28:46]
提交

answer

#include <bits/stdc++.h>

#define rep(i, l, r) for(int i = (int)l; i < (int)r; i++)
#define all(v) v.begin(), v.end()
#define sz(v) (int)v.size()
using namespace std;

using ll = long long;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using ld = long double;

typedef vector<ll> vl;
typedef vector<int> vi;

template<class T>
void out(const vector<T> &v) {
    for (auto x: v)cout << x << " ";
    cout << endl;
}

const ll linf = 1e15 + 10;

void solve() {
    
    int n;ll m;cin >> n >> m;
    vector<int> a(n);for(auto &x:a)cin >> x;

    auto check = [&](vector<ll> c) -> ll{
        ll cost = 0;
        rep(i, 0, n - 1) {
            cost += 1;
            if (c[i] > 0){
                cost += (c[i] - 1) * 2;
                c[i+1] -= c[i] - 1;
            }
        }
        if (c[n-1] > 0) {
            cost += 1 + 2 * (c[n-1] - 1);
        }
        return cost;
    };

    ll ok = 0, ng = 1e18 + 10;
    while (ng - ok > 1) {
        ll mid = ok + (ng - ok) / 2;
        vector<ll> c(n);rep(i, 0, n)c[i] = (mid - 1) / a[i] + 1;
        // cout << mid << " " << check(c) << endl;
        if (check(c) <= m) ok = mid;
        else ng = mid;
    }
    cout << ok << endl;
}

int main() {


    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int T; cin >> T;
    while(T--) {
        solve();
    }
    
}

源文件, 语言: C++20

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 3540kb

input:

output:

6
4

result:

ok 2 number(s): "6 4"

Test #2:

score: -100

Wrong Answer

time: 127ms

memory: 5268kb

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

result:

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