Submission #1205966

#	Time	Username	Problem	Language	Result	Execution time	Memory
1205966		JakobZorz	Nile (IOI24_nile)	C++20	17 / 100	2096 ms	5636 KiB

nile

#include "nile.h"
#include<algorithm>
#include<iostream>
using namespace std;
typedef long long ll;

vector<ll>calculate_costs(vector<int>W,vector<int>A,vector<int>B,vector<int>E){
	vector<pair<int,pair<int,int>>>arr; // (W, (A, B))
	int n=(int)W.size();
	for(int i=0;i<n;i++){
		arr.push_back({W[i],{A[i],B[i]}});
	}
	sort(arr.begin(),arr.end());	
	vector<ll>res;
	vector<ll>pref(n+1);
	for(int i=0;i<n;i++)
		pref[i+1]=pref[i]+arr[i].second.first;
	for(int D:E){
		vector<ll>dp(n+1);	
		dp[0]=0;
		for(int i=1;i<=n;i++){
			// pripelji samega
			dp[i]=dp[i-1]+arr[i-1].second.first;
			
			// pripelji i-1 skupaj z j
			for(int j=0;j<i-1;j++){
				if(abs(arr[i-1].first-arr[j].first)<=D){
					dp[i]=min(dp[i],dp[j]+arr[i-1].second.second+arr[j].second.second+pref[i-1]-pref[j+1]);
				}
			}
		}
		res.push_back(dp[n]);
	/*cout<<"W: ";
	for(int i=0;i<n;i++)
		cout<<arr[i].first<<" ";
	cout<<"\n";
	cout<<"A: ";
	for(int i=0;i<n;i++)
		cout<<arr[i].second.first<<" ";
	cout<<"\n";
	cout<<"B: ";
	for(int i=0;i<n;i++)
		cout<<arr[i].second.second<<" ";
	cout<<"\n";
	cout<<"dp: ";
	for(int i=0;i<=n;i++)
		cout<<dp[i]<<" ";
	cout<<"\n";*/
	}
	return res;
}

• Subtask 0: 0 / 0
• Subtask 1: 6 / 6
• Subtask 2: 0 / 13
• Subtask 3: 0 / 17
• Subtask 4: 11 / 11
• Subtask 5: 0 / 20
• Subtask 6: 0 / 15
• Subtask 7: 0 / 18