QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#91631	#6130. Plants vs. Zombies	black_ice	WA	267ms	4340kb	C++14	943b	2023-03-29 10:40:35	2023-03-29 10:40:37

Judging History

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

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2023-03-29 10:40:37]
评测

测评结果：WA
用时：267ms
内存：4340kb

查看

[2023-03-29 10:40:35]
提交

answer

#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <array>
#include <iomanip>
using namespace std;
#define int long long
const int N = 1e5 + 10,INF = 1e17;
#define endl '\n'
int n,m,T;
int a[N];

bool check(int x)
{
    int res = 0,last = 0;
    for(int i = 1;i <= n;i++)
    {
        int cnt = max(1ll,(x + a[i] - 1 - last) / a[i]);
        res += 1 + 2 * (cnt - 1);
        last = (cnt - 1) * a[i + 1]; 
    }
    // cout << x << ' ' << res << endl;
    return res <= m;
}

void solve()
{
    cin >> n >> m;
    for(int i = 1;i <= n;i++) cin >> a[i];
    int l = 1,r = INF;
    while(l < r)
    {
        int mid = (l + r + 1) >> 1;
        if(check(mid)) l = mid;
        else r = mid - 1;
    }
    cout << l << endl;
}


signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> T;
    while(T--)
    {
        solve();
    }
}

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 1ms

memory: 3440kb

input:

output:

6
4

result:

ok 2 number(s): "6 4"

Test #2:

score: -100

Wrong Answer

time: 267ms

memory: 4340kb

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:

1
1
4
6
18
3
2
12
1
4
1
4
2
6
1
2
24
3
30
10
1
2
3
1
1
2
6
1
1
6
24
28
1
3
3
1
4
10
6
4
1
5
1
1
1
7
30
2
1
1
16
8
1
30
2
25
4
2
1
1
2
1
2
1
5
2
1
1
1
1
5
1
4
4
28
1
1
21
3
1
2
4
1
1
14
4
6
1
1
5
12
3
8
1
4
1
10
12
5
6
1
6
9
1
725
1
17
132
676
588
110
1
163
16650504450556638
1000000000000
16561021906

result:

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