답안 #939853

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
939853	2024-03-06T20:26:55 Z	TAhmed33	Let's Win the Election (JOI22_ho_t3)	C++	0 / 100	2500 ms	600 KB

Main

#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
int n, k, a[501], b[501];
ld recurse (int mask, int c, int l) {
	if (l == k) return 0;
	ld ret = 1e18;
	for (int i = 0; i < n; i++) {
		if (mask & (1 << i)) continue;
		ret = min(ret, 1.0 * a[i] / c + recurse(mask ^ (1 << i), c, l + 1));
	}
	int pos = -1, mx = 1e9;
	for (int i = 0; i < n; i++) {
		if (mask & (1 << i)) continue;
		if (b[i] != -1 && b[i] < mx) {
			mx = b[i]; pos = i;
		}
	}
	if (pos != -1) {
		ret = min(ret, 1.0 * b[pos] / c + recurse(mask ^ (1 << pos), c + 1, l + 1));
	}
	return ret;
}
int main () {
	cin >> n >> k;
	for (int i = 0; i < n; i++) cin >> a[i] >> b[i];
	cout << fixed << setprecision(9) << recurse(0, 1, 0) << '\n';
}

Subtask #1

0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Execution timed out	2546 ms	348 KB	Time limit exceeded
6	Halted	0 ms	0 KB	-

Subtask #2

0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Execution timed out	2546 ms	348 KB	Time limit exceeded
6	Halted	0 ms	0 KB	-

Subtask #3

0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	2 ms	600 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Incorrect	0 ms	344 KB	Output isn't correct
10	Halted	0 ms	0 KB	-

Subtask #4

0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	2 ms	600 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Incorrect	0 ms	344 KB	Output isn't correct
10	Halted	0 ms	0 KB	-

Subtask #5

0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	2 ms	600 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Incorrect	0 ms	344 KB	Output isn't correct
10	Halted	0 ms	0 KB	-

Subtask #6

0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	2516 ms	348 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #7

0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Execution timed out	2546 ms	348 KB	Time limit exceeded
6	Halted	0 ms	0 KB	-