#include <iostream>
#include <bits/stdc++.h>
#include <cmath>
#include <algorithm>
#include <vector>
#include <deque>
#include <set>
#include <stack>
#include <string>
#include <map>
#include <queue>
#define int long double
#define sqrt sqrtl
using namespace std;
const long long oo = 1e18;
long double sum, ans = 0, mx = 0, mn = 1000000000, num, pos;
/*
ViHHiPuh
(( `'-""``""-'` ))
)-__-_.._-__-(
/ --- (o _ o) --- \
\ .-* ( .0. ) *-. /
_'-. ,_ '=' _, .-'_
/ `;#'#'# - #'#'#;` \
\_)) -----'#'----- ((_/
# --------- #
'# ------- ------ #'
/..-'# ------- #'-.\
_\...-\'# -- #'/-.../_
((____)- '#' -(____))
cout << fixed << setprecision(6) << x;
freopen ( "sum.in", "r", stdin )
*/
long long n, m;
int a[ 501 ], b[ 501 ];
int dp[ 101 ][ 101 ][ 101 ];
main () {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> n >> m;
for ( long long i = 1; i <= n; i ++ ) {
cin >> a[ i ] >> b[ i ];
if ( b[ i ] == -1 )
b[ i ] = oo;
}
ans = oo;
for ( long long t = 0; t <= n; t ++ ) {
for ( long long i = 0; i <= n; i ++ )
for ( long long j = 0; j <= n; j ++ )
dp[ t ][ i ][ j ] = oo;
dp[ t ][ 0 ][ 0 ] = 0;
}
for ( long long k = 0; k <= m; k ++ ) {
for ( long long i = 1; i <= n; i ++ ) {
for ( long long j = 1; j <= min( i, m ); j ++ ) {
dp[ i ][ j ][ 0 ] = min( dp[ i - 1 ][ j ][ 0 ], dp[ i - 1 ][ j - 1 ][ 0 ] + a[ i ] / ( k + 1 ) );
for ( long long t = 1; t <= min( j, k ); t ++ ) {
dp[ i ][ j ][ t ] = min( dp[ i - 1 ][ j ][ t ], min( dp[ i - 1 ][ j - 1 ][ t ] + a[ i ] / ( k + 1 ), dp[ i - 1 ][ j - 1 ][ t - 1 ] + b[ i ] / t ) );
// cout << i << " " << j << " " << t << " - " << dp[ i ][ j ][ t ] << "\n";
}
}
}
cout << k << " - " << dp[ n ][ m ][ k ] << "\n";
ans = min( ans, dp[ n ][ m ][ k ] );
}
cout << fixed << setprecision( 4 ) << ans;
}
Compilation message
Main.cpp:49:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
49 | main () {
| ^~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
468 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
468 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
468 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
190 ms |
33140 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |