oj.uz

Submission #785055

# Submission time Handle Problem Language Result Execution time Memory
785055 2023-07-17T03:09:06 Z gun_gan Let's Win the Election (JOI22_ho_t3) C++17
56 / 100
 179 ms 9428 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
const int MX = 105;
 
int N, K;
int a[MX], b[MX];
double dp[MX][MX][MX];
 
vector<pair<int, int>> v;
 
int main() {
      cin.tie(0); ios_base::sync_with_stdio(0);
 
      
 
      cin >> N >> K;
 
      int tot = 0;
      for(int i = 1; i <= N; i++) {
            cin >> a[i] >> b[i];
            if(b[i] != -1) tot++;
            else b[i] = 1e9;
            v.push_back({b[i], a[i]});
      }
 
      sort(v.begin(), v.end());

      double ans = 1e9;
      for(int x = 0; x <= min(K, tot); x++) { // fixed collaborator

            for(int i = 0; i < MX; i++)
                  for(int j = 0; j < MX; j++)
                        for(int k = 0; k < MX; k++)
                              dp[i][j][k] = 1e9;
       
            dp[0][0][0] = 0;
            for(int i = 0; i < N; i++) {
                  for(int j = 0; j <= N; j++) { // votes
                        for(int k = 0; k <= N; k++) { // num of collaborator
                              if(dp[i][j][k] == 1e9) continue;
       
                              // skip
                              dp[i + 1][j][k] = min(dp[i + 1][j][k], dp[i][j][k]);

                              // ambil vote
                              dp[i + 1][j + 1][k] = min(dp[i + 1][j + 1][k], dp[i][j][k] + (double) v[i].second / (x + 1));
                              
                              // ambil collaborator
                              if(v[i].first != 1e9) 
                                    dp[i + 1][j + 1][k + 1] = min(dp[i + 1][j + 1][k + 1], dp[i][j][k] + (double) v[i].first / (k + 1));
                        }
                  }
            }

            ans = min(ans, dp[N][K][x]);
      }
 
      cout << fixed << setprecision(15) << ans << '\n';
 
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9364 KB Output is correct
2 Correct 4 ms 9264 KB Output is correct
3 Correct 4 ms 9300 KB Output is correct
4 Correct 4 ms 9300 KB Output is correct
5 Runtime error 1 ms 468 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9364 KB Output is correct
2 Correct 4 ms 9264 KB Output is correct
3 Correct 4 ms 9300 KB Output is correct
4 Correct 4 ms 9300 KB Output is correct
5 Runtime error 1 ms 468 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9300 KB Output is correct
2 Correct 5 ms 9300 KB Output is correct
3 Correct 8 ms 9300 KB Output is correct
4 Correct 7 ms 9328 KB Output is correct
5 Correct 7 ms 9300 KB Output is correct
6 Correct 7 ms 9300 KB Output is correct
7 Correct 7 ms 9376 KB Output is correct
8 Correct 6 ms 9300 KB Output is correct
9 Correct 6 ms 9380 KB Output is correct
10 Correct 6 ms 9300 KB Output is correct
11 Correct 7 ms 9300 KB Output is correct
12 Correct 6 ms 9376 KB Output is correct
13 Correct 7 ms 9380 KB Output is correct
14 Correct 7 ms 9380 KB Output is correct
15 Correct 7 ms 9300 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9300 KB Output is correct
2 Correct 5 ms 9300 KB Output is correct
3 Correct 8 ms 9300 KB Output is correct
4 Correct 7 ms 9328 KB Output is correct
5 Correct 7 ms 9300 KB Output is correct
6 Correct 7 ms 9300 KB Output is correct
7 Correct 7 ms 9376 KB Output is correct
8 Correct 6 ms 9300 KB Output is correct
9 Correct 6 ms 9380 KB Output is correct
10 Correct 6 ms 9300 KB Output is correct
11 Correct 7 ms 9300 KB Output is correct
12 Correct 6 ms 9376 KB Output is correct
13 Correct 7 ms 9380 KB Output is correct
14 Correct 7 ms 9380 KB Output is correct
15 Correct 7 ms 9300 KB Output is correct
16 Correct 6 ms 9376 KB Output is correct
17 Correct 8 ms 9312 KB Output is correct
18 Correct 9 ms 9300 KB Output is correct
19 Correct 11 ms 9300 KB Output is correct
20 Correct 12 ms 9300 KB Output is correct
21 Correct 11 ms 9300 KB Output is correct
22 Correct 10 ms 9300 KB Output is correct
23 Correct 14 ms 9264 KB Output is correct
24 Correct 9 ms 9376 KB Output is correct
25 Correct 14 ms 9380 KB Output is correct
26 Correct 13 ms 9380 KB Output is correct
27 Correct 10 ms 9300 KB Output is correct
28 Correct 11 ms 9372 KB Output is correct
29 Correct 10 ms 9300 KB Output is correct
30 Correct 11 ms 9380 KB Output is correct
31 Correct 11 ms 9380 KB Output is correct
32 Correct 14 ms 9264 KB Output is correct
33 Correct 16 ms 9428 KB Output is correct
34 Correct 10 ms 9300 KB Output is correct
35 Correct 15 ms 9300 KB Output is correct
36 Correct 10 ms 9380 KB Output is correct
37 Correct 10 ms 9272 KB Output is correct
38 Correct 11 ms 9384 KB Output is correct
39 Correct 14 ms 9376 KB Output is correct
40 Correct 10 ms 9380 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9300 KB Output is correct
2 Correct 5 ms 9300 KB Output is correct
3 Correct 8 ms 9300 KB Output is correct
4 Correct 7 ms 9328 KB Output is correct
5 Correct 7 ms 9300 KB Output is correct
6 Correct 7 ms 9300 KB Output is correct
7 Correct 7 ms 9376 KB Output is correct
8 Correct 6 ms 9300 KB Output is correct
9 Correct 6 ms 9380 KB Output is correct
10 Correct 6 ms 9300 KB Output is correct
11 Correct 7 ms 9300 KB Output is correct
12 Correct 6 ms 9376 KB Output is correct
13 Correct 7 ms 9380 KB Output is correct
14 Correct 7 ms 9380 KB Output is correct
15 Correct 7 ms 9300 KB Output is correct
16 Correct 6 ms 9376 KB Output is correct
17 Correct 8 ms 9312 KB Output is correct
18 Correct 9 ms 9300 KB Output is correct
19 Correct 11 ms 9300 KB Output is correct
20 Correct 12 ms 9300 KB Output is correct
21 Correct 11 ms 9300 KB Output is correct
22 Correct 10 ms 9300 KB Output is correct
23 Correct 14 ms 9264 KB Output is correct
24 Correct 9 ms 9376 KB Output is correct
25 Correct 14 ms 9380 KB Output is correct
26 Correct 13 ms 9380 KB Output is correct
27 Correct 10 ms 9300 KB Output is correct
28 Correct 11 ms 9372 KB Output is correct
29 Correct 10 ms 9300 KB Output is correct
30 Correct 11 ms 9380 KB Output is correct
31 Correct 11 ms 9380 KB Output is correct
32 Correct 14 ms 9264 KB Output is correct
33 Correct 16 ms 9428 KB Output is correct
34 Correct 10 ms 9300 KB Output is correct
35 Correct 15 ms 9300 KB Output is correct
36 Correct 10 ms 9380 KB Output is correct
37 Correct 10 ms 9272 KB Output is correct
38 Correct 11 ms 9384 KB Output is correct
39 Correct 14 ms 9376 KB Output is correct
40 Correct 10 ms 9380 KB Output is correct
41 Correct 41 ms 9300 KB Output is correct
42 Correct 29 ms 9300 KB Output is correct
43 Correct 60 ms 9288 KB Output is correct
44 Correct 62 ms 9368 KB Output is correct
45 Correct 88 ms 9368 KB Output is correct
46 Correct 87 ms 9372 KB Output is correct
47 Correct 121 ms 9372 KB Output is correct
48 Correct 111 ms 9300 KB Output is correct
49 Correct 149 ms 9368 KB Output is correct
50 Correct 129 ms 9380 KB Output is correct
51 Correct 179 ms 9300 KB Output is correct
52 Correct 136 ms 9372 KB Output is correct
53 Correct 129 ms 9420 KB Output is correct
54 Correct 120 ms 9364 KB Output is correct
55 Correct 114 ms 9368 KB Output is correct
56 Correct 118 ms 9364 KB Output is correct
57 Correct 128 ms 9364 KB Output is correct
58 Correct 115 ms 9368 KB Output is correct
59 Correct 114 ms 9300 KB Output is correct
60 Correct 115 ms 9368 KB Output is correct

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 468 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9364 KB Output is correct
2 Correct 4 ms 9264 KB Output is correct
3 Correct 4 ms 9300 KB Output is correct
4 Correct 4 ms 9300 KB Output is correct
5 Runtime error 1 ms 468 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -