QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#703931#9540. Double 11ucup-team5318#WA 0ms3792kbC++14939b2024-11-02 18:55:052024-11-02 18:55:06

Judging History

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

  • [2024-11-02 18:55:06]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3792kb
  • [2024-11-02 18:55:05]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define pb emplace_back
#define mp make_pair
#define fi first
#define se second 
typedef vector<int> vi;
typedef pair<int,int> pi;

signed main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	#ifndef ONLINE_JUDGE
	assert(freopen(".in","r",stdin));
	assert(freopen(".out","w",stdout));
	#endif

	int n,m; cin>>n>>m;
	vi a(n);
	rep(i,0,n-1){
		cin>>a[i];
	}
	sort(a.begin(), a.end());
	vector<vector<double>> f(n+1, vector<double>(m+1, 1e18));
	f[0][0]=0;
	rep(i,1,n){
		double sum=0;
		per(j,i-1,0){
			sum+=a[j];
			rep(c,1,m){
				f[i][c]=min(f[i][c], f[j][c-1]+sqrt(sum*(i-j)) );
			}
		}
	}
	rep(i,0,n){
		rep(j,1,m){
			cout<< f[i][j]-f[i][j-1] <<' ';
		}
		cout<<'\n';
	}
	cout<<setprecision(12)<<fixed<< f[n][m] <<'\n';
}


详细

Test #1:

score: 0
Wrong Answer
time: 0ms
memory: 3792kb

input:

4 2
1 2 3 4

output:

1e+18 0 
-1e+18 1e+18 
-1e+18 -0.0352762 
-1e+18 -0.080363 
-1e+18 -0.133408 
6.191147129557

result:

wrong answer 1st numbers differ - expected: '6.1911471', found: '1000000000000000000.0000000', error = '161520955498845920.0000000'