Submission #1264293

#	Time	Username	Problem	Language	Result	Execution time	Memory
1264293		liangjeremy	Boxes with souvenirs (IOI15_boxes)	C++20	0 / 100	0 ms	328 KiB

boxes

#include<bits/stdc++.h>
#define fi first
#define se second
using namespace std;
using db=double;
using ll=int64_t;
using sll=__int128;
using lb=long double;

long long delivery(int n, int k, int l, int a[]){
#define int long long
	int mx=-1e9; int mi=1e18; int ans=0; 
	for(int i=0; i<n; i++){
		if(2*a[i]<l)mx=max(mx,(int)a[i]); else mi=min(mi,(int)a[i]); 
	}
	if(mx!=-1e9)ans+=2*mx; if(mi!=1e18)ans+=2*mi;
	return ans; 
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 15
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 30