oj.uz

Submission #1044608

# Submission time Handle Problem Language Result Execution time Memory
1044608 2024-08-05T11:32:16 Z pan Let's Win the Election (JOI22_ho_t3) C++17
100 / 100
 680 ms 4444 KB 
#include <bits/stdc++.h>
//#include "bits_stdc++.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%lld", &x);
#define input2(x, y) scanf("%lld%lld", &x, &y);
#define input3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define input4(x, y, z, a) scanf("%lld%lld%lld%lld", &x, &y, &z, &a);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define all(x) x.begin(), x.end()
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define FOR(i, x, n) for (ll i =x; i<=n; ++i)
#define RFOR(i, x, n) for (ll i =x; i>=n; --i) 
using namespace std;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
//using namespace __gnu_pbds;
//#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
//#define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<pi, ll> pii;
typedef pair<pi, pi> piii;
 
ld const INF = 1e13;
 
ll n, k;
vector<vector<ld> > dp; // dp[use city until][count vote w/o collab]
pi city[505];
int main()
{
	ld ans = INF;
	input2(n, k);
	ll kk = n;
	for (ll i=1; i<=n; ++i)  {input2(city[i].s, city[i].f); if (city[i].f==-1) {city[i].f = INF;kk--;} }
	sort(city+1, city+n+1);
	for (ll i=0; i<=min(kk, k); ++i)
	{
		dp.assign(n+1, vector<ld> (n+1, INF));
		dp[0][0] = 0;
		for (ll j=1; j<=n; ++j)
		{
			for (ll x=0; x<=j; ++x)
			{
				if (j-x <= i) // still keep the streak
				{
					if (x) dp[j][x] = min(dp[j][x], dp[j-1][x-1] + ld(ld(city[j].s)/(ld(i+1)))); // choose w/o collab
					dp[j][x] = min(dp[j][x], dp[j-1][x] + ld(ld(city[j].f)/ld(j-x))); // choose w collab
				}
				else 
				{
					dp[j][x] = dp[j-1][x]; // dont choose
					if (x) dp[j][x] = min(dp[j][x], dp[j-1][x-1] + ld(ld(city[j].s)/ld(i+1))); // choose w/o collab
				}
			}
		}
		ans = min(ans, dp[n][k-i]);
 
	}
	cout << setprecision(15) << fixed << ans << endl;
	
	return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:13:27: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | #define input2(x, y) scanf("%lld%lld", &x, &y);
      |                      ~~~~~^~~~~~~~~~~~~~~~~~~~
Main.cpp:45:2: note: in expansion of macro 'input2'
   45 |  input2(n, k);
      |  ^~~~~~
Main.cpp:13:27: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | #define input2(x, y) scanf("%lld%lld", &x, &y);
      |                      ~~~~~^~~~~~~~~~~~~~~~~~~~
Main.cpp:47:28: note: in expansion of macro 'input2'
   47 |  for (ll i=1; i<=n; ++i)  {input2(city[i].s, city[i].f); if (city[i].f==-1) {city[i].f = INF;kk--;} }
      |                            ^~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory 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 2 ms 4184 KB Output is correct
6 Correct 2 ms 4188 KB Output is correct
7 Correct 3 ms 4188 KB Output is correct
8 Correct 2 ms 4188 KB Output is correct
9 Correct 3 ms 4184 KB Output is correct
10 Correct 3 ms 4224 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory 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 2 ms 4184 KB Output is correct
6 Correct 2 ms 4188 KB Output is correct
7 Correct 3 ms 4188 KB Output is correct
8 Correct 2 ms 4188 KB Output is correct
9 Correct 3 ms 4184 KB Output is correct
10 Correct 3 ms 4224 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 172 ms 4372 KB Output is correct
13 Correct 163 ms 4376 KB Output is correct
14 Correct 99 ms 4380 KB Output is correct
15 Correct 396 ms 4184 KB Output is correct
16 Correct 331 ms 4184 KB Output is correct
17 Correct 101 ms 4188 KB Output is correct
18 Correct 627 ms 4184 KB Output is correct
19 Correct 341 ms 4184 KB Output is correct
20 Correct 90 ms 4188 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory 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 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory 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 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 440 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 604 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 424 KB Output is correct
34 Correct 0 ms 448 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 0 ms 600 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 1 ms 344 KB Output is correct
40 Correct 0 ms 348 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory 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 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 440 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 604 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 424 KB Output is correct
34 Correct 0 ms 448 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 0 ms 600 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 1 ms 344 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 1 ms 604 KB Output is correct
43 Correct 1 ms 604 KB Output is correct
44 Correct 1 ms 440 KB Output is correct
45 Correct 4 ms 604 KB Output is correct
46 Correct 3 ms 600 KB Output is correct
47 Correct 3 ms 604 KB Output is correct
48 Correct 3 ms 604 KB Output is correct
49 Correct 4 ms 604 KB Output is correct
50 Correct 4 ms 604 KB Output is correct
51 Correct 6 ms 604 KB Output is correct
52 Correct 5 ms 600 KB Output is correct
53 Correct 4 ms 600 KB Output is correct
54 Correct 4 ms 612 KB Output is correct
55 Correct 3 ms 604 KB Output is correct
56 Correct 3 ms 600 KB Output is correct
57 Correct 3 ms 604 KB Output is correct
58 Correct 3 ms 604 KB Output is correct
59 Correct 6 ms 696 KB Output is correct
60 Correct 3 ms 604 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 620 ms 4184 KB Output is correct
2 Correct 654 ms 4388 KB Output is correct
3 Correct 663 ms 4372 KB Output is correct
4 Correct 653 ms 4376 KB Output is correct
5 Correct 680 ms 4372 KB Output is correct
6 Correct 632 ms 4376 KB Output is correct
7 Correct 645 ms 4188 KB Output is correct

Subtask #7
23.0 / 23.0

# Verdict Execution time Memory 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 2 ms 4184 KB Output is correct
6 Correct 2 ms 4188 KB Output is correct
7 Correct 3 ms 4188 KB Output is correct
8 Correct 2 ms 4188 KB Output is correct
9 Correct 3 ms 4184 KB Output is correct
10 Correct 3 ms 4224 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 172 ms 4372 KB Output is correct
13 Correct 163 ms 4376 KB Output is correct
14 Correct 99 ms 4380 KB Output is correct
15 Correct 396 ms 4184 KB Output is correct
16 Correct 331 ms 4184 KB Output is correct
17 Correct 101 ms 4188 KB Output is correct
18 Correct 627 ms 4184 KB Output is correct
19 Correct 341 ms 4184 KB Output is correct
20 Correct 90 ms 4188 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 440 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 344 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 604 KB Output is correct
50 Correct 0 ms 344 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 424 KB Output is correct
54 Correct 0 ms 448 KB Output is correct
55 Correct 1 ms 344 KB Output is correct
56 Correct 0 ms 600 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 1 ms 344 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 1 ms 604 KB Output is correct
62 Correct 1 ms 604 KB Output is correct
63 Correct 1 ms 604 KB Output is correct
64 Correct 1 ms 440 KB Output is correct
65 Correct 4 ms 604 KB Output is correct
66 Correct 3 ms 600 KB Output is correct
67 Correct 3 ms 604 KB Output is correct
68 Correct 3 ms 604 KB Output is correct
69 Correct 4 ms 604 KB Output is correct
70 Correct 4 ms 604 KB Output is correct
71 Correct 6 ms 604 KB Output is correct
72 Correct 5 ms 600 KB Output is correct
73 Correct 4 ms 600 KB Output is correct
74 Correct 4 ms 612 KB Output is correct
75 Correct 3 ms 604 KB Output is correct
76 Correct 3 ms 600 KB Output is correct
77 Correct 3 ms 604 KB Output is correct
78 Correct 3 ms 604 KB Output is correct
79 Correct 6 ms 696 KB Output is correct
80 Correct 3 ms 604 KB Output is correct
81 Correct 620 ms 4184 KB Output is correct
82 Correct 654 ms 4388 KB Output is correct
83 Correct 663 ms 4372 KB Output is correct
84 Correct 653 ms 4376 KB Output is correct
85 Correct 680 ms 4372 KB Output is correct
86 Correct 632 ms 4376 KB Output is correct
87 Correct 645 ms 4188 KB Output is correct
88 Correct 48 ms 4188 KB Output is correct
89 Correct 49 ms 4248 KB Output is correct
90 Correct 129 ms 4184 KB Output is correct
91 Correct 126 ms 4376 KB Output is correct
92 Correct 274 ms 4188 KB Output is correct
93 Correct 269 ms 4440 KB Output is correct
94 Correct 424 ms 4184 KB Output is correct
95 Correct 445 ms 4188 KB Output is correct
96 Correct 538 ms 4188 KB Output is correct
97 Correct 533 ms 4380 KB Output is correct
98 Correct 399 ms 4188 KB Output is correct
99 Correct 418 ms 4188 KB Output is correct
100 Correct 415 ms 4184 KB Output is correct
101 Correct 434 ms 4376 KB Output is correct
102 Correct 405 ms 4380 KB Output is correct
103 Correct 422 ms 4184 KB Output is correct
104 Correct 409 ms 4384 KB Output is correct
105 Correct 396 ms 4444 KB Output is correct