oj.uz

Submission #534889

# Submission time Handle Problem Language Result Execution time Memory
534889 2022-03-09T05:48:49 Z nathanlee726 Let's Win the Election (JOI22_ho_t3) C++14
10 / 100
 309 ms 4300 KB 
//#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];

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+1)Fi(j,n+1)dp[i][j]=tdp[i][j]=-1;
	bug(dp[0][0]);
	dp[0][0]=0;
	F(n){
        for(int j=0;j<n+1;j++){
            for(int l=0;l<n+1;l++){
                if(dp[j][l]==-1)continue;
                tdp[j][l]=(tdp[j][l]==-1?dp[j][l]:min(dp[j][l],tdp[j][l]));
                if(pt[i].Y!=-1)tdp[j+1][l]=(tdp[j+1][l]==-1?dp[j][l]+(((double)pt[i].Y)/((double)(j+1))):min(tdp[j+1][l],dp[j][l]+(((double)pt[i].Y)/((double)(j+1)))));
                tdp[j][l+1]=(tdp[j][l+1]==-1?dp[j][l]+(((double)pt[i].X)/((double)(j+1))):min(tdp[j][l+1],dp[j][l]+(((double)pt[i].X)/((double)(j+1)))));
            }
        }
        Fi(j,n+1)Fi(l,n+1)dp[j][l]=tdp[j][l],tdp[j][l]=-1;
	}
	double ans=1e18;
	F(k)bug(i,k-i,dp[i][k-i]);
	F(k)if(dp[i][k-i]!=-1)ans=min(ans,dp[i][k-i]);
	cout<<fixed<<setprecision(10);
	cout<<ans<<endl;
	return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 320 KB Output is correct
5 Correct 212 ms 4172 KB Output is correct
6 Correct 181 ms 4172 KB Output is correct
7 Correct 186 ms 4272 KB Output is correct
8 Correct 189 ms 4300 KB Output is correct
9 Correct 183 ms 4276 KB Output is correct
10 Correct 193 ms 4272 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 320 KB Output is correct
5 Correct 212 ms 4172 KB Output is correct
6 Correct 181 ms 4172 KB Output is correct
7 Correct 186 ms 4272 KB Output is correct
8 Correct 189 ms 4300 KB Output is correct
9 Correct 183 ms 4276 KB Output is correct
10 Correct 193 ms 4272 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 287 ms 4288 KB Output is correct
13 Correct 238 ms 4272 KB Output is correct
14 Correct 264 ms 4276 KB Output is correct
15 Correct 287 ms 4280 KB Output is correct
16 Correct 309 ms 4172 KB Output is correct
17 Correct 205 ms 4248 KB Output is correct
18 Correct 281 ms 4276 KB Output is correct
19 Correct 263 ms 4272 KB Output is correct
20 Correct 226 ms 4280 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Incorrect 1 ms 332 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Incorrect 1 ms 332 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Incorrect 1 ms 332 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 300 ms 4272 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 320 KB Output is correct
5 Correct 212 ms 4172 KB Output is correct
6 Correct 181 ms 4172 KB Output is correct
7 Correct 186 ms 4272 KB Output is correct
8 Correct 189 ms 4300 KB Output is correct
9 Correct 183 ms 4276 KB Output is correct
10 Correct 193 ms 4272 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 287 ms 4288 KB Output is correct
13 Correct 238 ms 4272 KB Output is correct
14 Correct 264 ms 4276 KB Output is correct
15 Correct 287 ms 4280 KB Output is correct
16 Correct 309 ms 4172 KB Output is correct
17 Correct 205 ms 4248 KB Output is correct
18 Correct 281 ms 4276 KB Output is correct
19 Correct 263 ms 4272 KB Output is correct
20 Correct 226 ms 4280 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Incorrect 1 ms 332 KB Output isn't correct
30 Halted 0 ms 0 KB -