QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#225450	#1697. Balance Beam	paul2008	18.181818	1ms	3980kb	C++14	655b	2023-10-24 17:41:17	2023-10-24 17:41:17

Judging History

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

[2023-10-24 17:41:17]
评测

测评结果：18.181818
用时：1ms
内存：3980kb

查看

[2023-10-24 17:41:17]
提交

answer

#include <bits/stdc++.h>
using namespace std;

const int N=5005;
const double eps=1e-6;

long long a[N];

int main()
{
	int n;
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
		scanf("%lld",&a[i]);

	int l=0,r=0;
	for(int i=1;i<=n;i++)
	{
		if(r<i)
		{
			if(i==199)
				printf("YES\n");

			l=i-1, r=i;
			double val=a[i];
			for(int j=i+1;j<=n;j++)
				if((double)(a[l]*(j-i)+a[j])/(j-i+1)>val)
					val=(double)(a[l]*(j-i)+a[j])/(j-i+1), r=j;
		}

		if(r>i)
		{
			double ans=(double)(a[l]*(r-i)+a[r]*(i-l))/(r-l);
			long long res=ans*100000+eps;
			printf("%lld\n",res);
		}
		else
			printf("%lld\n",a[i]*100000);
	}
}

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 9.09091

Accepted

time: 0ms

memory: 3980kb

input:

2
1
3

output:

150000
300000

result:

ok 2 lines

Test #2:

score: 0

Runtime Error

input:

output:

result:

Test #3:

score: 0

Runtime Error

input:

output:

result:

Test #4:

score: 0

Wrong Answer

time: 0ms

memory: 3848kb

input:

output:

result:

wrong answer 199th lines differ - expected: '5130733333', found: 'YES'

Test #5:

score: 9.09091

Accepted

time: 1ms

memory: 3904kb

input:

output:

result:

ok 5000 lines

Test #6:

score: 0

Runtime Error

input:

output:

result:

Test #7:

score: 0

Runtime Error

input:

output:

result:

Test #8:

score: 0

Runtime Error

input:

output:

result:

Test #9:

score: 0

Runtime Error

input:

output:

result:

Test #10:

score: 0

Runtime Error

input:

output:

result:

Test #11:

score: 0

Runtime Error

input: