QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#105267 | #6130. Plants vs. Zombies | Sorting# | WA | 182ms | 4984kb | C++20 | 1.4kb | 2023-05-13 20:19:17 | 2023-05-13 20:19:19 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair < int , int > pii ;
typedef vector < int > vi ;
#define fi first
#define se second
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
const int MAXN = 2e5 + 7 ;
const ll inf = 1e17 + 6 ;
ll n , k ;
ll a[ MAXN ] ;
ll req[ MAXN ] ;
bool f ( ll targ ) {
if ( targ == 0 ) { return true ; }
for ( int i = 1 ; i <= n ; ++ i ) {
req[ i ] = ( targ + a[ i ] - 1 ) / a[ i ] ;
-- req[ i ] ;
}
ll need = n ;
for ( int i = 1 ; i < n ; ++ i ) {
if ( req[ i ] < 0 ) { req[ i ] = 0 ; }
ll take = req[ i ] ;
req[ i ] -= take ;
req[ i + 1 ] -= take ;
if ( req[ i + 1 ] < 0 ) { -- need ; }
need += 2 * take ;
if ( need > k ) { return false ; }
}
if ( req[ n ] < 0 ) { req[ n ] = 0 ; }
need += 2 * req[ n ] ;
return ( need <= k ) ;
}
void solve ( ) {
cin >> n >> k ;
for ( int i = 1 ; i <= n ; ++ i ) {
cin >> a[ i ] ;
}
ll l , r , mid ;
l = 0 , r = inf ;
while ( l < r ) {
mid = ( l + r + 1 ) / 2 ;
if ( f ( mid ) == true ) { l = mid ; }
else { r = mid - 1 ; }
}
cout << l << "\n" ;
}
int main ( ) {
ios_base :: sync_with_stdio ( false ) ;
cin.tie ( NULL ) ;
int t = 1 ; cin >> t ;
while ( t -- ) { solve ( ) ; }
return 0 ;
}
詳細信息
Test #1:
score: 100
Accepted
time: 2ms
memory: 3468kb
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: 182ms
memory: 4984kb
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 4 24 3 30 12 0 2 4 0 0 2 8 0 2 6 24 28 1 4 3 0 4 10 6 4 2 5 0 2 0 7 30 3 0 0 16 8 0 30 3 30 8 2 0 0 2 0 2 0 5 2 0 0 0 0 5 0 5 6 28 0 0 24 4 0 2 4 0 0 14 4 6 1 0 6 14 3 9 0 4 0 10 12 6 8 2 6 12 0 770 0 19 147 710 665 120 0 174 5910828 1000000000000 16561023154
result:
wrong answer 16th numbers differ - expected: '2', found: '4'