Submission #624569

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
624569	2022-08-08T13:28:17 Z	QwertyPi	Let's Win the Election (JOI22_ho_t3)	C++14	23 / 100	2500 ms	18740 KB

Main

#include <bits/stdc++.h>
#define int long long
#define inf (1 << 30)
#define ld long double
using namespace std;
 
const int N = 113;
int a[N], b[N], s[N];
int id_x[N], id_y[N];
int vid_x[N], vid_y[N]; 
 
struct Pair{
	int a, b, id;
	Pair() = default;
	Pair(int _a, int _b, int _i) : a(_a), b(_b), id(_i){}; 
};
 
vector<Pair> vp;
long double dp[N][N][N];
int cnt[N][N];

int n, K;
	
long double f(int l){
	for(int i = 0; i < n; i++){
		s[i + 1] = s[i] + a[id_x[i]];
	}
	long double ans = inf;
	for(int l = 0; l <= n; l++){
		for(int i = 0; i <= n; i++){
			for(int j = 0; j <= n; j++){
				for(int k = 0; k <= n; k++){
					dp[i][j][k] = inf;
				}
			}
		}
		dp[0][0][0] = 0; 
		for(int i = 0; i <= n; i++){
			for(int j = 0; j <= n; j++){
				for(int k = 0; k <= n; k++){
					if(i > 0){
						if(vid_y[id_x[i - 1]] < j){
							dp[i][j][k] = min(dp[i][j][k], dp[i - 1][j][k] - (ld) a[id_x[i - 1]] / (l + 1));
						}else{
							dp[i][j][k] = min(dp[i][j][k], dp[i - 1][j][k]);
						}
					}
					if(j > 0){
						if(vid_x[id_y[j - 1]] < i){
							dp[i][j][k] = min(dp[i][j][k], dp[i][j - 1][k]);
						}else{
							if(k > 0 && b[id_y[j - 1]] != inf){
								dp[i][j][k] = min(dp[i][j][k], dp[i][j - 1][k - 1] + (ld) b[id_y[j - 1]] / k);
							}
						}
					}
				}
				if(i + j - cnt[i][j] == K){
					ans = min(ans, dp[i][j][l] + (ld) s[i] / (l + 1));
				}
			}
		}
	}
	return ans;
}

int32_t main(){
	cin >> n >> K;
	for(int i = 0; i < n; i++){
		cin >> a[i] >> b[i];
		b[i] = (b[i] == -1) ? inf : b[i];
		vp.push_back({a[i], b[i], i});
	}
 
	sort(vp.begin(), vp.end(), [](Pair x, Pair y){
		return x.a < y.a || x.a == y.a && x.b < y.b;
	});
	
	for(int i = 0; i < n; i++){
		id_x[i] = vp[i].id;
		vid_x[vp[i].id] = i;
	}
 
	sort(vp.begin(), vp.end(), [](Pair x, Pair y){
		return x.b < y.b || x.b == y.b && x.a < y.a;
	});
	
	for(int i = 0; i < n; i++){
		id_y[i] = vp[i].id;
		vid_y[vp[i].id] = i;
	}
	
	/*
	for(int i = 0; i < n; i++){
		cout << vid_x[i] << ' ' << vid_y[i] << ' ' << id_x[i] << ' ' << id_y[i] << endl;
	}
	*/
	
	for(int i = 0; i < n; i++){
		cnt[vid_x[i] + 1][vid_y[i] + 1] = 1;
	}
	
	/*
	for(int i = 0; i <= n; i++){
		for(int j = 0; j <= n; j++){
			cout << cnt[i][j] << ' ';
		}
		cout << endl;
	}
	cout << endl;
	*/
	
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= n; j++){
			cnt[i][j] = cnt[i - 1][j] + cnt[i][j - 1] + cnt[i][j] - cnt[i - 1][j - 1];
		}
	}
	
	int lb = 0, rb = K;
	while(rb - lb > 1){
		int m = (rb + lb) / 2;
		ld f1 = f(m), f2 = f(m + 1);
		if(f1 > f2){
			rb = m + 1;
		}else{
			lb = m;
		}
	}
	ld ans = min(f(lb), f(rb));
	
	cout << fixed << setprecision(15) << ans << endl;
}

Compilation message

Main.cpp: In lambda function:
Main.cpp:76:34: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   76 |   return x.a < y.a || x.a == y.a && x.b < y.b;
      |                       ~~~~~~~~~~~^~~~~~~~~~~~
Main.cpp: In lambda function:
Main.cpp:85:34: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   85 |   return x.b < y.b || x.b == y.b && x.a < y.a;
      |                       ~~~~~~~~~~~^~~~~~~~~~~~

Subtask #1
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Runtime error	1 ms	468 KB	Execution killed with signal 11
6	Halted	0 ms	0 KB	-

Subtask #2
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Runtime error	1 ms	468 KB	Execution killed with signal 11
6	Halted	0 ms	0 KB	-

Subtask #3
11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	2 ms	512 KB	Output is correct
6	Correct	2 ms	436 KB	Output is correct
7	Correct	2 ms	440 KB	Output is correct
8	Correct	1 ms	440 KB	Output is correct
9	Correct	1 ms	436 KB	Output is correct
10	Correct	1 ms	440 KB	Output is correct
11	Correct	1 ms	440 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct

Subtask #4
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	2 ms	512 KB	Output is correct
6	Correct	2 ms	436 KB	Output is correct
7	Correct	2 ms	440 KB	Output is correct
8	Correct	1 ms	440 KB	Output is correct
9	Correct	1 ms	436 KB	Output is correct
10	Correct	1 ms	440 KB	Output is correct
11	Correct	1 ms	440 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	21 ms	1076 KB	Output is correct
17	Correct	34 ms	1080 KB	Output is correct
18	Correct	33 ms	1108 KB	Output is correct
19	Correct	36 ms	1108 KB	Output is correct
20	Correct	32 ms	1108 KB	Output is correct
21	Correct	33 ms	1076 KB	Output is correct
22	Correct	35 ms	1108 KB	Output is correct
23	Correct	34 ms	1108 KB	Output is correct
24	Correct	31 ms	1152 KB	Output is correct
25	Correct	48 ms	1248 KB	Output is correct
26	Correct	44 ms	1152 KB	Output is correct
27	Correct	38 ms	1108 KB	Output is correct
28	Correct	35 ms	1108 KB	Output is correct
29	Correct	34 ms	1108 KB	Output is correct
30	Correct	34 ms	1108 KB	Output is correct
31	Correct	35 ms	1160 KB	Output is correct
32	Correct	35 ms	1232 KB	Output is correct
33	Correct	33 ms	1108 KB	Output is correct
34	Correct	34 ms	1108 KB	Output is correct
35	Correct	34 ms	1108 KB	Output is correct
36	Correct	35 ms	1156 KB	Output is correct
37	Correct	35 ms	1152 KB	Output is correct
38	Correct	34 ms	1152 KB	Output is correct
39	Correct	34 ms	1152 KB	Output is correct
40	Correct	47 ms	1156 KB	Output is correct

Subtask #5
0 / 33.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	2 ms	512 KB	Output is correct
6	Correct	2 ms	436 KB	Output is correct
7	Correct	2 ms	440 KB	Output is correct
8	Correct	1 ms	440 KB	Output is correct
9	Correct	1 ms	436 KB	Output is correct
10	Correct	1 ms	440 KB	Output is correct
11	Correct	1 ms	440 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	21 ms	1076 KB	Output is correct
17	Correct	34 ms	1080 KB	Output is correct
18	Correct	33 ms	1108 KB	Output is correct
19	Correct	36 ms	1108 KB	Output is correct
20	Correct	32 ms	1108 KB	Output is correct
21	Correct	33 ms	1076 KB	Output is correct
22	Correct	35 ms	1108 KB	Output is correct
23	Correct	34 ms	1108 KB	Output is correct
24	Correct	31 ms	1152 KB	Output is correct
25	Correct	48 ms	1248 KB	Output is correct
26	Correct	44 ms	1152 KB	Output is correct
27	Correct	38 ms	1108 KB	Output is correct
28	Correct	35 ms	1108 KB	Output is correct
29	Correct	34 ms	1108 KB	Output is correct
30	Correct	34 ms	1108 KB	Output is correct
31	Correct	35 ms	1160 KB	Output is correct
32	Correct	35 ms	1232 KB	Output is correct
33	Correct	33 ms	1108 KB	Output is correct
34	Correct	34 ms	1108 KB	Output is correct
35	Correct	34 ms	1108 KB	Output is correct
36	Correct	35 ms	1156 KB	Output is correct
37	Correct	35 ms	1152 KB	Output is correct
38	Correct	34 ms	1152 KB	Output is correct
39	Correct	34 ms	1152 KB	Output is correct
40	Correct	47 ms	1156 KB	Output is correct
41	Execution timed out	2567 ms	18740 KB	Time limit exceeded
42	Halted	0 ms	0 KB	-

Subtask #6
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	1 ms	484 KB	Execution killed with signal 11
2	Halted	0 ms	0 KB	-

Subtask #7
0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Runtime error	1 ms	468 KB	Execution killed with signal 11
6	Halted	0 ms	0 KB	-

Submission #624569

Compilation message

Subtask #1 0 / 5.0

Subtask #2 0 / 5.0

Subtask #3 11.0 / 11.0

Subtask #4 12.0 / 12.0

Subtask #5 0 / 33.0

Subtask #6 0 / 11.0

Subtask #7 0 / 23.0

Subtask #1
0 / 5.0

Subtask #2
0 / 5.0

Subtask #3
11.0 / 11.0

Subtask #4
12.0 / 12.0

Subtask #5
0 / 33.0

Subtask #6
0 / 11.0

Subtask #7
0 / 23.0