QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#101387	#6130. Plants vs. Zombies	diyitibu^#	TL	583ms	11176kb	C++14	1.5kb	2023-04-29 12:58:50	2023-04-29 12:58:54

Judging History

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

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

[2023-04-29 12:58:54]
评测

测评结果：TL
用时：583ms
内存：11176kb

查看

[2023-04-29 12:58:50]
提交

answer

#include<bits/stdc++.h>
#define ll long long
#define gc getchar
#define maxn 100005
using namespace std;

inline ll read(){
	ll a=0;int f=0;char p=gc();
	while(!isdigit(p)){f|=p=='-';p=gc();}
	while(isdigit(p)){a=(a<<3)+(a<<1)+(p^48);p=gc();}
	return f?-a:a;
}int n;
ll m;
#undef ll
#define ll __int128

void write(ll x){
	if(x >= 10) write(x / 10) ;
	putchar('0' + x % 10) ;
}

ll a[maxn],d[maxn];

ll pre[maxn] , suf[maxn] ;
ll pre_cnt[maxn] , suf_cnt[maxn] ;

inline int solve(ll x){
	ll sum=n;
	for(int i=1;i<=n;++i){
		d[i]=(x + a[i] - 1) / a[i] * a[i] - a[i] , d[i] /= a[i] ;
		//if(i==n&&d[i]<d[i-1])sum=n-1;
	}
	for(int i=1;i<=n;i++){
		pre_cnt[i] = pre_cnt[i - 1] + max((ll)0 , d[i] - pre[i - 1]) * 2 ;
		pre[i] = max((ll)0 , d[i] - pre[i - 1]) ;
	}
	ll ans = n + pre_cnt[n] ;
	ll last = d[n] ;
	ll res = d[n] * 2 ;  
	for(int i = n - 1 ; i; i --){
		d[i] -= 1 ; 

		ans = min(ans , pre_cnt[i - 1] + res + max((ll)0 , d[i] - last - pre[i - 1]) * 2 + n + n - i) ;  
		res += max((ll)0 , d[i] - last) * 2 ;
		last = max((ll)0 , d[i] - last) ; 
	}
	return ans<=m;
}

int main(){
	int t=read();
	while(t--){
		n=read();m=read();
		ll l=0,r=1e17 ,ans=0;
		for(int i=1;i<=n;++i){
			a[i]=read(),d[i]=0;
			l=min(l,a[i]);
		//	r=min(r,a[i]*m/2+1);
		}
		if(m < n){
			puts("0");
			continue; 
		}
		//r=max(r,1e7);
		while(l<=r){
			ll mid=l+r>>1;
			if(solve(mid))ans=mid,l=mid+1;
			else r=mid-1;
		}
		//printf("%lld\n",ans);
		write(ans) ;
		putchar('\n') ; 
	}
	return 0;
}

源文件, 语言: C++14

詳細信息

Test #1:

score: 100

Accepted

time: 2ms

memory: 5396kb

input:

output:

6
4

result:

ok 2 number(s): "6 4"

Test #2:

score: 0

Accepted

time: 583ms

memory: 11176kb

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
24
3
30
10
0
2
3
0
0
2
6
0
1
6
24
28
1
4
3
0
4
10
6
4
1
5
0
2
0
7
30
2
0
0
16
8
0
30
2
30
4
2
0
0
2
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:

ok 116 numbers

Test #3:

score: -100

Time Limit Exceeded

input:

2110
4 0
3 2 6 6
4 1
3 2 6 6
2 7
3 9
28 82
68 27 32 98 88 19 96 37 53 50 45 37 41 92 51 70 73 84 2 53 7 89 9 59 24 23 62 97
22 145
61 22 87 34 75 89 22 6 10 74 21 35 33 23 85 66 89 46 16 48 2 48
25 146
67 63 93 98 1 70 57 45 40 15 1 5 54 38 96 19 94 18 43 98 28 45 47 92 46
21 26
83 54 21 72 25 47 2 ...

output: