Submission #535056

#	Time	Username	Problem	Language	Result	Execution time	Memory
535056		nathanlee726	Let's Win the Election (JOI22_ho_t3)	C++14	100 / 100	247 ms	8304 KiB

Main

//#include<i_am_noob_orz>
#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define int ll
#define ull unsigned long long
#define pii pair<int,int>
#define X first
#define Y second
#define mod ((ll)1e9+7)
#define pb push_back
#define mp make_pair
#define abs(x) ((x)>0?(x):(-(x)))
#define F(n) Fi(i,n)
#define Fi(i,n) Fl(i,0,n)
#define Fl(i,l,n) for(int i=l;i<n;i++)
#define memres(a) memset(a,0,sizeof(a))
#define all(a) a.begin(),a.end()
#define sz(a) ((int)a.size())
#define ceiling(a,b) (((a)+(b)-1)/(b))
#define endl '\n'
#define bit_count(x) __builtin_popcountll((x))
#define ykh mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define jimmy_is_kind false
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> rbtree;

//#define LOCAL
#ifdef LOCAL
#define bug(...) cerr<<"#"<<__LINE__<<' '<<#__VA_ARGS__<<"- ", _do(__VA_ARGS__)
template<typename T> void _do(T && x) {cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T && x, S&&...y) {cerr<<x<<", "; _do(y...);}
#define IOS()
#else
#define IOS() ios_base::sync_with_stdio(0), cin.tie(0)
#define endl '\n'
#define bug(...)
#endif

int add(int a,int b){return(a+b>=mod?a+b-mod:a+b);}
int sub(int a,int b){return(a<b?a+mod-b:a-b);}
int po(int a,int b){
	if(b==0)return 1;
	if(b==1)return(a%mod);
	int tem=po(a,b/2);
	if(b&1)return(((tem*tem)%mod)*a)%mod;
	else return(tem*tem)%mod;
}
int GCD(int a,int b){
	int x=0;
	int ra,rb;
	while(a&&b){
		if(((a&1)==0)&&((b&1)==0)){
			a>>=1,b>>=1,x++;
		}
		else if((a^b)&1){
			if(a&1)b>>=1;
			else a>>=1;
		}
		else{
			ra=abs(a-b),rb=min(a,b);
			a=ra,b=rb;
		}
	}
	return max(a,b)<<x;
}
int gcd(int a,int b){if(b==0)return a;return gcd(b,a%b);}

int n,k;
pii pt[505],pt2[505];
vector<pii>pt1;
double dp[505][505],tdp[505][505],rd[505][505],rm[505][505];

bool cmp(pii a,pii b){
    if(a.Y==-1&&b.Y==-1){
        return a.X<b.X;
    }
    if(a.Y==-1){
        return false;
    }
    if(b.Y==-1)return true;
    return a.Y<b.Y;
}

signed main(){
	IOS();
	cin>>n>>k;
	F(n)cin>>pt[i].X>>pt[i].Y;
	sort(pt,pt+n,cmp);
	F(n)bug(pt[i].Y);
	F(n+1)Fi(j,n+1)dp[i][j]=tdp[i][j]=rd[i][j]=-1;
	bug(dp[0][0]);
	dp[0][0]=0;
	Fi(l,k){
        for(int i=0;i<n;i++){
            for(int j=0;j<=l;j++){
                if(dp[i][j]==-1)continue;
                if(pt[i].Y!=-1){
                    if(dp[i+1][j+1]!=-1)dp[i+1][j+1]=min(dp[i+1][j+1],dp[i][j]+(((double)(pt[i].Y))/((double)(j+1))));
                    else dp[i+1][j+1]=dp[i][j]+(((double)(pt[i].Y))/((double)(j+1)));
                }
                if(dp[i+1][j]!=-1)dp[i+1][j]=min(dp[i+1][j],dp[i][j]+(((double)(pt[i].X))/((double)(l+1))));
                else dp[i+1][j]=dp[i][j]+(((double)(pt[i].X))/((double)(l+1)));
            }
        }
        for(int i=0;i<=n;i++)rm[l][i]=dp[i][l];
	}
	rd[n][0]=0;
	for(int i=n-1;i>=0;i--){
        for(int j=0;j<n;j++){
            if(rd[i+1][j]==-1)continue;
            rd[i][j]=(rd[i][j]==-1?rd[i+1][j]:min(rd[i+1][j],rd[i][j]));
            rd[i][j+1]=(rd[i][j+1]==-1?rd[i+1][j]+pt[i].X:min(rd[i][j+1],rd[i+1][j]+pt[i].X));
        }
	}
	double ans=1e18;
	F(k){
        for(int j=i;j<k;j++){
            if(rm[i][j]!=-1)ans=min(ans,rm[i][j]+((double)(rd[j][k-j]))/((double)(i+1)));
            bug(i,j,rm[i][j]);
            bug(ans);
        }
        if(rm[i][k]!=-1)ans=min(ans,rm[i][k]);
	}
	cout<<fixed<<setprecision(10);
	cout<<ans<<endl;
	return 0;
}
/*

*/

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 11 / 11
• Subtask 4: 12 / 12
• Subtask 5: 33 / 33
• Subtask 6: 11 / 11
• Subtask 7: 23 / 23