oj.uz

Submission #715305

# Submission time Handle Problem Language Result Execution time Memory
715305 2023-03-26T11:58:52 Z ac2hu Let's Win the Election (JOI22_ho_t3) C++14
10 / 100
 451 ms 8336 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 500 + 10;
using ld = long 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;
    sort(c + 1, c + n + 1, [&](cst a, cst b){
        if(a.b == -1)return false;
        if(b.b == -1)return true;
        return a.b < b.b;
    });
    for(int i = 0;i<=n;i++)for(int j = 0;j<=n;j++)odp[i][j] = 1e18;
    for(int i = 0;i<=n;i++)for(int j = 0;j<=n;j++)ndp[i][j] = 1e18;
    odp[0][0] = 0; 
    for(int i = 1;i<=n;i++){
        for(int places = 0;places<=i;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 != -1){
                    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 = 1e18;
    for(int collab = 0;collab<=k;collab++)pmin(mn, ndp[k][collab]);
    cout << mn << "\n";
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 243 ms 8312 KB Output is correct
6 Correct 277 ms 8316 KB Output is correct
7 Correct 240 ms 8312 KB Output is correct
8 Correct 249 ms 8324 KB Output is correct
9 Correct 266 ms 8336 KB Output is correct
10 Correct 351 ms 8328 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 243 ms 8312 KB Output is correct
6 Correct 277 ms 8316 KB Output is correct
7 Correct 240 ms 8312 KB Output is correct
8 Correct 249 ms 8324 KB Output is correct
9 Correct 266 ms 8336 KB Output is correct
10 Correct 351 ms 8328 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 451 ms 8320 KB Output is correct
13 Correct 261 ms 8316 KB Output is correct
14 Correct 244 ms 8316 KB Output is correct
15 Correct 382 ms 8296 KB Output is correct
16 Correct 260 ms 8320 KB Output is correct
17 Correct 301 ms 8316 KB Output is correct
18 Correct 392 ms 8312 KB Output is correct
19 Correct 279 ms 8276 KB Output is correct
20 Correct 290 ms 8324 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Incorrect 1 ms 324 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Incorrect 1 ms 324 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Incorrect 1 ms 324 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 433 ms 8316 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 243 ms 8312 KB Output is correct
6 Correct 277 ms 8316 KB Output is correct
7 Correct 240 ms 8312 KB Output is correct
8 Correct 249 ms 8324 KB Output is correct
9 Correct 266 ms 8336 KB Output is correct
10 Correct 351 ms 8328 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 451 ms 8320 KB Output is correct
13 Correct 261 ms 8316 KB Output is correct
14 Correct 244 ms 8316 KB Output is correct
15 Correct 382 ms 8296 KB Output is correct
16 Correct 260 ms 8320 KB Output is correct
17 Correct 301 ms 8316 KB Output is correct
18 Correct 392 ms 8312 KB Output is correct
19 Correct 279 ms 8276 KB Output is correct
20 Correct 290 ms 8324 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 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 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 320 KB Output is correct
28 Correct 1 ms 328 KB Output is correct
29 Incorrect 1 ms 324 KB Output isn't correct
30 Halted 0 ms 0 KB -