QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#221946	#6130. Plants vs. Zombies	ucup-team1001^#	WA	128ms	4780kb	C++20	1.1kb	2023-10-21 15:09:16	2023-10-21 15:09:16

Judging History

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

[2023-10-21 15:09:16]
评测

测评结果：WA
用时：128ms
内存：4780kb

查看

[2023-10-21 15:09:16]
提交

answer

#include <bits/stdc++.h>

using namespace std;

int T;
 using ll =long long ;
#define int ll
 void solve(){
     int n,m;
     cin>>n>>m;
     vector<int> v1(n+3),v2(n+3);
     for(int i =1;i<=n;i++){
         cin>>v1[i];
     }
     int l =1;
     int r= 1e18+3;
     auto  checked=[&](int mid)->bool {

         for(int i=1;i<=n;i++){
//             v2[i]= mid/v1[i];
             v2[i]= (v1[i]+mid -1)/v1[i];
         }
         int sums=0;
         for(int i=1;i<=n;i++){
             if(v2[i]<=0 && i != n) {
                 sums++;
                 continue;
             }
             sums++;
             v2[i]--;
             sums+=2*v2[i];
             v2[i+1]-=v2[i];
 
         }


         return sums<=m;
     };


     while (l<r){
         int mid = (l+r+1)/2;
         if(checked(mid)){
             l= mid;
         }else {
             r= mid -1;
         }
     }
     checked(5);
     cout<<l<<endl;
 }

#undef int


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

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3636kb

input:

output:

6
4

result:

ok 2 number(s): "6 4"

Test #2:

score: -100

Wrong Answer

time: 128ms

memory: 4780kb

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
90
3
2
18
1
6
1
4
2
6
1
2
24
3
30
10
1
2
3
1
1
2
8
1
1
6
27
28
1
12
3
1
4
10
6
4
1
5
1
2
1
7
40
2
1
1
16
8
1
30
2
40
4
2
1
1
2
1
5
1
5
2
1
1
1
1
5
1
4
12
63
1
1
32
4
1
2
4
1
1
16
4
6
1
1
5
21
3
8
1
4
1
10
14
5
8
1
6
27
1
725
1
17
132
676
588
110
1
163
577392649836192905
1000000000000
7400325...

result:

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