QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#517101 | #6130. Plants vs. Zombies | Tahmid76 | WA | 105ms | 5272kb | C++14 | 1.9kb | 2024-08-13 06:15:20 | 2024-08-13 06:15:20 |
Judging History
answer
//And He found you lost and guided [you] [93:07]
//#pragma GCC optimize ("Ofast")
//#pragma GCC target ("avx2")
//#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef vector<ll> vll;
typedef vector<int> vii;
typedef map<int,int> mpi;
typedef map<ll,ll> mpl;
typedef unordered_map<int,int> umpi;
typedef unordered_map<ll,ll> umpl;
#define modu 998244353
#define mod 1000000007
#define eps 1e-9
#define inf 1000000000000000006
#define ff first
#define ss second
#define pb push_back
#define all(v) v.begin(), v.end()
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define endl '\n'
// #define pi acos(-1.0)
#define dec(n) fixed << setprecision(n)
#define N 300005
#define int long long
int n,m,a[N];;
int chk(int x){
int moves=0;
vector<int> c(n+3,0);
if(x==0) return 1;
for(int i=1;i<=n;i++){
c[i]+=(x+a[i]-1)/a[i];
c[i]=max(1LL,c[i]);
moves+=(c[i]*2)-1;
c[i+1]-=(c[i]-1);
// cout << moves << " ";
}
// cout << moves << " ";
return moves<=m;
}
void solve(){
cin >> n >> m;
for(int i=1;i<=n;i++) cin >> a[i];
// cout << chk(4) << endl;
// for(int i=0;i<=10;i++) cout << i << " -> " << chk(i) << endl;
int lo=0,hi=1e18,ans;
while(lo<=hi){
int mid=(lo+hi)/2;
if(chk(mid)){
ans=mid;
lo=mid+1;
}
else hi=mid-1;
}
cout << ans << endl;
}
signed main(){
fastio;
//srand(chrono::steady_clqk::now().time_since_epqh().count());
// fflush(stdout);
int T=1,cs=0;
cin >> T;
while(T--){
//cout << "Case " << ++cs << ": " ;
solve();
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3612kb
input:
2 4 8 3 2 6 6 3 9 10 10 1
output:
6 4
result:
ok 2 number(s): "6 4"
Test #2:
score: -100
Wrong Answer
time: 105ms
memory: 5272kb
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 18 3 2 12 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 3 3 0 4 10 6 4 1 5 0 1 0 7 30 2 0 0 16 8 0 30 2 25 4 2 0 0 2 0 2 0 5 2 0 0 0 0 5 0 4 4 28 0 0 21 3 0 2 4 0 0 14 4 6 1 0 5 12 3 8 0 4 0 10 12 5 6 1 6 9 0 725 0 17 132 676 588 110 0 163 581298493411633717 1000000000000 7400288227...
result:
wrong answer 5th numbers differ - expected: '20', found: '18'