oj.uz

Submission #936897

# Submission time Handle Problem Language Result Execution time Memory
936897 2024-03-03T01:58:35 Z william950615 Let's Win the Election (JOI22_ho_t3) C++14
72 / 100
 2500 ms 1620 KB 
#pragma GCC optimize("O3,unroll-loop")
#include<bits/stdc++.h>
using namespace std;

#define F first
#define S second
#define mkp make_pair
#define PH push
#define PB push_back
#define REP(i,N) for( int i = 0; i < (N); ++i )
#define FOR(i,a,b) for( int i = (a); i <= (b); ++i )
#define ALL(x) begin(x), end(x)
#define MEM(x) memset(x, 0, sizeof(x))

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<typename T>
using V=vector<T>;
#define double float

void solve() {
	int N, K; cin >> N >> K;
	V<pll> vc(N+1);
	const ll INF = 1e18;
	FOR(i,1,N) cin >> vc[i].F >> vc[i].S;
	for( auto &i : vc ) if( i.S == -1 ) i.S = INF;

	sort( vc.begin()+1, vc.end(), [&]( auto&a, auto&b) {
			return a.S < b.S;
		});
	
	//V<V<V<double>>> dp( 2, V<V<double>>( K+1, V<double>(K+1, 0) ));
	V<V<double>> dp(K+1,V<double>(K+1,0));
	//double dp[ N+1 ][ K+1 ][ K+1 ];

	auto init = [&]() {
		for( auto &i : dp ) for( auto &j : i )/* for( auto &k : j ) */
			j = INF;
		dp[ 1 ][ 0 ] = 0;
	};

	auto do_dp = [&](int p) {
		double ans=INF;
		init();
		for( int i = 1; i <= N; ++i ) {
			for( int j = p; j>=1; --j ) {
				for( int k = K; k >=1; --k ) {
					dp[ j ][ k ] = min({
						( j == 1 ? INF : dp[j-1][k-1]+(1.0f*vc[i].S/(j-1)) ), 
						dp[j][k-1] + (1.0f*vc[i].F/p),
						dp[j][k]
					});
				}
			}
		}
		//fprintf(stderr, "ans:(%.16lf), p(%d)\n", ans, p );
		ans = min( dp[p][K], ans );
		return ans;
	};

	int l = 1, r = K;
	double ans = INF;
	while( r-l > 4 ) {
		int l1 = (l+l+r)/3, l2 = (l+r+r)/3;
		double ans1 = do_dp(l1);
		double ans2 = do_dp(l2);
		ans = min( {ans,ans1,ans2} );
		if( ans1 > ans2 ) 
			l=l1;
		else
			r=l2;
	}
	for( int i = l; i<=r; ++i ) 
		ans = min( ans, do_dp(i));

	cout << fixed << setprecision(10);
	cout << ans << '\n';
}

int main() {
	int T = 1;
#ifdef LOCAL
	freopen( "input.txt", "r", stdin);
	freopen( "output.txt", "w", stdout );
	cin >> T;
#else
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#endif
	while(T--) solve();

}

Compilation message

Main.cpp:1:38: warning: bad option '-funroll-loop' to pragma 'optimize' [-Wpragmas]
    1 | #pragma GCC optimize("O3,unroll-loop")
      |                                      ^
Main.cpp:22:12: warning: bad option '-funroll-loop' to attribute 'optimize' [-Wattributes]
   22 | void solve() {
      |            ^
Main.cpp: In function 'void solve()':
Main.cpp:29:51: warning: bad option '-funroll-loop' to attribute 'optimize' [-Wattributes]
   29 |  sort( vc.begin()+1, vc.end(), [&]( auto&a, auto&b) {
      |                                                   ^
Main.cpp:37:18: warning: bad option '-funroll-loop' to attribute 'optimize' [-Wattributes]
   37 |  auto init = [&]() {
      |                  ^
Main.cpp:43:24: warning: bad option '-funroll-loop' to attribute 'optimize' [-Wattributes]
   43 |  auto do_dp = [&](int p) {
      |                        ^
Main.cpp: At global scope:
Main.cpp:81:10: warning: bad option '-funroll-loop' to attribute 'optimize' [-Wattributes]
   81 | int main() {
      |          ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 Correct 3 ms 348 KB Output is correct
6 Correct 16 ms 464 KB Output is correct
7 Correct 68 ms 700 KB Output is correct
8 Correct 148 ms 1108 KB Output is correct
9 Correct 238 ms 1372 KB Output is correct
10 Correct 116 ms 860 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 Correct 3 ms 348 KB Output is correct
6 Correct 16 ms 464 KB Output is correct
7 Correct 68 ms 700 KB Output is correct
8 Correct 148 ms 1108 KB Output is correct
9 Correct 238 ms 1372 KB Output is correct
10 Correct 116 ms 860 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 242 ms 536 KB Output is correct
13 Correct 161 ms 532 KB Output is correct
14 Correct 97 ms 348 KB Output is correct
15 Correct 1297 ms 940 KB Output is correct
16 Correct 819 ms 1108 KB Output is correct
17 Correct 357 ms 936 KB Output is correct
18 Execution timed out 2558 ms 1372 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 544 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 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 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 544 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 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 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 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 344 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 344 KB Output is correct
30 Correct 0 ms 348 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 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 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 0 ms 600 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 544 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 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 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 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 344 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 344 KB Output is correct
30 Correct 0 ms 348 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 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 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 0 ms 600 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 448 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 2 ms 348 KB Output is correct
45 Correct 4 ms 348 KB Output is correct
46 Correct 3 ms 348 KB Output is correct
47 Correct 4 ms 348 KB Output is correct
48 Correct 7 ms 344 KB Output is correct
49 Correct 10 ms 348 KB Output is correct
50 Correct 7 ms 348 KB Output is correct
51 Correct 12 ms 492 KB Output is correct
52 Correct 19 ms 348 KB Output is correct
53 Correct 2 ms 348 KB Output is correct
54 Correct 4 ms 348 KB Output is correct
55 Correct 7 ms 468 KB Output is correct
56 Correct 3 ms 348 KB Output is correct
57 Correct 6 ms 416 KB Output is correct
58 Correct 7 ms 348 KB Output is correct
59 Correct 7 ms 348 KB Output is correct
60 Correct 6 ms 464 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1547 ms 1620 KB Output is correct
2 Correct 1644 ms 1448 KB Output is correct
3 Correct 1896 ms 1616 KB Output is correct
4 Correct 2065 ms 1444 KB Output is correct
5 Correct 2168 ms 1448 KB Output is correct
6 Correct 1219 ms 1444 KB Output is correct
7 Correct 2248 ms 1444 KB Output is correct

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 Correct 3 ms 348 KB Output is correct
6 Correct 16 ms 464 KB Output is correct
7 Correct 68 ms 700 KB Output is correct
8 Correct 148 ms 1108 KB Output is correct
9 Correct 238 ms 1372 KB Output is correct
10 Correct 116 ms 860 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 242 ms 536 KB Output is correct
13 Correct 161 ms 532 KB Output is correct
14 Correct 97 ms 348 KB Output is correct
15 Correct 1297 ms 940 KB Output is correct
16 Correct 819 ms 1108 KB Output is correct
17 Correct 357 ms 936 KB Output is correct
18 Execution timed out 2558 ms 1372 KB Time limit exceeded
19 Halted 0 ms 0 KB -