oj.uz

답안 #715311

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
715311 2023-03-26T12:05:04 Z ac2hu Let's Win the Election (JOI22_ho_t3) C++14
10 / 100
 143 ms 4428 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 500 + 10;
using ld = double;
void pmin(ld &a, ld c){a = min(a, c);}
struct cst{int a, b;} c[N];
int n, k;
ld odp[N][N], ndp[N][N];
signed main() {
    iostream::sync_with_stdio(false);
    cin.tie(0);cout.tie(0); cout << setprecision(10) << fixed;
    cin >> n >> k;
    for(int i = 0;i<n;i++)cin >> c[i + 1].a >> c[i + 1].b;
    for(int i = 0;i<n;i++)if(c[i + 1].b == -1)c[i + 1].b = 1e9;
    sort(c + 1, c + n + 1, [&](cst a, cst b){
        if(a.b == b.b)return a.a < b.a;
        return a.b < b.b;
    });
    for(int i = 0;i<=n;i++)for(int j = 0;j<=n;j++)odp[i][j] = ndp[i][j] = 1e8;
    odp[0][0] = 0; 
    for(int i = 1;i<=n;i++){
        for(int places = 0;places<=min(i, k);places++){
            for(int collab = 0;collab<=places;collab++){
                ndp[places][collab] = odp[places][collab];
                if(places != 0){
                    pmin(ndp[places][collab], odp[places - 1][collab] + ((ld)c[i].a)/(collab + 1));
                }
                if(collab != 0 && c[i].b != 1e9){
                    pmin(ndp[places][collab], odp[places - 1][collab - 1] + ((ld)c[i].b)/(collab));
                }
            }
        }
        for(int c = 0;c<=i;c++){
            for(int k = 0;k<=i;k++)odp[c][k] = ndp[c][k];
        }
    }
    ld mn = 1e8;
    for(int collab = 0;collab<=k;collab++)pmin(mn, ndp[k][collab]);
    cout << mn << "\n";
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 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 42 ms 4324 KB Output is correct
6 Correct 47 ms 4308 KB Output is correct
7 Correct 61 ms 4428 KB Output is correct
8 Correct 72 ms 4308 KB Output is correct
9 Correct 78 ms 4312 KB Output is correct
10 Correct 73 ms 4312 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 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 42 ms 4324 KB Output is correct
6 Correct 47 ms 4308 KB Output is correct
7 Correct 61 ms 4428 KB Output is correct
8 Correct 72 ms 4308 KB Output is correct
9 Correct 78 ms 4312 KB Output is correct
10 Correct 73 ms 4312 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 59 ms 4308 KB Output is correct
13 Correct 52 ms 4316 KB Output is correct
14 Correct 46 ms 4308 KB Output is correct
15 Correct 99 ms 4308 KB Output is correct
16 Correct 79 ms 4312 KB Output is correct
17 Correct 78 ms 4316 KB Output is correct
18 Correct 143 ms 4308 KB Output is correct
19 Correct 82 ms 4312 KB Output is correct
20 Correct 75 ms 4312 KB Output is correct

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 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 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Incorrect 1 ms 340 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 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 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Incorrect 1 ms 340 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 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 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Incorrect 1 ms 340 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 133 ms 4312 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 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 42 ms 4324 KB Output is correct
6 Correct 47 ms 4308 KB Output is correct
7 Correct 61 ms 4428 KB Output is correct
8 Correct 72 ms 4308 KB Output is correct
9 Correct 78 ms 4312 KB Output is correct
10 Correct 73 ms 4312 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 59 ms 4308 KB Output is correct
13 Correct 52 ms 4316 KB Output is correct
14 Correct 46 ms 4308 KB Output is correct
15 Correct 99 ms 4308 KB Output is correct
16 Correct 79 ms 4312 KB Output is correct
17 Correct 78 ms 4316 KB Output is correct
18 Correct 143 ms 4308 KB Output is correct
19 Correct 82 ms 4312 KB Output is correct
20 Correct 75 ms 4312 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Incorrect 1 ms 340 KB Output isn't correct
30 Halted 0 ms 0 KB -