QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#492863	#6130. Plants vs. Zombies	priudy	WA	103ms	4464kb	C++14	1.4kb	2024-07-26 16:37:16	2024-07-26 16:37:16

Judging History

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

[2024-07-26 16:37:16]
评测

测评结果：WA
用时：103ms
内存：4464kb

查看

[2024-07-26 16:37:16]
提交

answer

#include<bits/stdc++.h>
using namespace std;
#define int long long

const int maxn = 1e5 + 5;
int a[maxn],n,m;

int sqz(int tt,int p)
{
    if(tt % p == 0) {
        return tt / p;
    } else {
        return tt / p + 1;
    }
}

bool ok(int x)
{
    int num = 0;
    int t = 0;
    for(int i = 1;i <= n;i++) {
        if(a[i] + t >= x) {
            if(i == n && t >= x) {
                break;
            }
            t = 0;
            num++;
        } else {
            num++;
            int sb = sqz(x - a[i] - t,a[i]);
            num += (2 * sb);
            t = a[i + 1] * sb;
        }
        //cout << num << " " << t << endl;
    }
    if(num <= m) {
        return true;
    }
    return false;
}

void solve()
{
    cin >> n >> m;
    for(int i = 1;i <= n;i++) {
        cin >> a[i];
    }

    int res = 0;

    //cout << ok(2) << endl;
    //cout << ok(3) << endl;
    //cout << ok(4) << endl;

    int l = 0,r = 1e18 + 5;
    while(l <= r) {
        int mid = (l + r) / 2;
        if(ok(mid)) {
            //cout << mid << endl;
            res = mid;
            l = mid + 1;
        } else {
            r = mid - 1;
        }
    }

    cout << res << endl;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);

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

    return 0;
}

源文件, 语言: C++14

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3608kb

input:

output:

6
4

result:

ok 2 number(s): "6 4"

Test #2:

score: -100

Wrong Answer

time: 103ms

memory: 4464kb

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
724679215...

result:

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