QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#227499	#6130. Plants vs. Zombies	hano	WA	93ms	4968kb	C++14	1.4kb	2023-10-27 16:45:15	2023-10-27 16:45:15

Judging History

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

[2023-10-27 16:45:15]
评测

测评结果：WA
用时：93ms
内存：4968kb

查看

[2023-10-27 16:45:15]
提交

answer

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pi pair<int,ll>
#define fi first
#define se second
#define pb push_back
#pragma GCC optimize("O3")
#pragma GCC target("avx2")


int main(){
    int t;cin>>t;
    while(t--){
        ll n,m;cin>>n>>m;
        vector<ll>v;
        for(int i=0;i<n;i++){
            ll a;cin>>a;
            v.push_back(a);
        }
        ll l=0,h=1e17,mid;
        ll prev=0;
        ll bst=0;
        while(l<=h){
            mid=(l+h)>>1;
            ll mm=m;
            for(int i=0;i<n;i++){
                ll now=v[i];
                ll k=mid/now+((mid%now)!=0)-1;
                mm--;
                if(i!=n-1 && mm<=0){
                    mm=-1;
                    break;
                }
                if(k<=prev){
                    if(i==n-1 && prev!=0){
                        mm++;
                    }
                    prev=0;
                    continue;
                }else{
                    k-=prev;
                    prev=0;
                    if(i!=n-1){
                        prev=k;
                        mm-=(2*k);
                    }else{
                        mm-=(2*k);
                    }
                }
            }
            if(mm>=0){
                bst=max(bst,mid);
                l=mid+1;
            }else{
                h=mid-1;
            }
        }
        cout<<bst<<endl;
    }
}

源文件, 语言: C++14

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 3568kb

input:

output:

6
4

result:

ok 2 number(s): "6 4"

Test #2:

score: -100

Wrong Answer

time: 93ms

memory: 4968kb

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
32
3
30
10
0
2
3
0
0
4
12
0
1
6
24
28
1
4
4
0
4
27
6
4
1
10
0
2
0
7
30
2
0
0
27
8
0
30
2
30
5
2
0
0
4
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
5910826
1000000000000
16561021906

result:

wrong answer 17th numbers differ - expected: '24', found: '32'