oj.uz

Submission #785117

# Submission time Handle Problem Language Result Execution time Memory
785117 2023-07-17T05:30:46 Z gun_gan Let's Win the Election (JOI22_ho_t3) C++17
56 / 100
 184 ms 9936 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
const int MX = 105;
 
int N, K;
int a[MX], b[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());

      if(K == N) {
            vector<vector<double>> dp(N + 5, vector<double>(N + 5, 1e9));
            double ans = 1e9;
            for(int x = 0; x <= min(K, tot); x++) { // fixed collaborator
       
                  for(int i = 0; i < N + 5; i++)
                        for(int k = 0; k < N + 5; k++)
                              dp[i][k] = 1e9;
             
                  dp[0][0] = 0;
                  for(int i = 0; i < N; i++) {
                        for(int k = 0; k <= N; k++) { // num of collaborator
                              if(dp[i][k] == 1e9) continue;
 
                              // ambil vote
                              dp[i + 1][k] = min(dp[i + 1][k], dp[i][k] + (double) v[i].second / (x + 1));
                              
                              // ambil collaborator
                              if(v[i].first != 1e9) 
                                    dp[i + 1][k + 1] = min(dp[i + 1][k + 1], dp[i][k] + (double) v[i].first / (k + 1));
                        }
                  }
       
                  ans = min(ans, dp[N][x]);
            }
       
            cout << fixed << setprecision(15) << ans << '\n';
      } else {
            vector<vector<vector<double>>> dp(N + 5, vector<vector<double>> (N + 5, vector<double>(N + 5, 1e9)));
            double ans = 1e9;
            for(int x = 0; x <= min(K, tot); x++) { // fixed collaborator
       
                  for(int i = 0; i < N + 5; i++)
                        for(int j = 0; j < N + 5; j++)
                              for(int k = 0; k < N + 5; 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 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Runtime error 1 ms 460 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 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Runtime error 1 ms 460 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 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 468 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 468 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 38 ms 9812 KB Output is correct
42 Correct 36 ms 9812 KB Output is correct
43 Correct 86 ms 9812 KB Output is correct
44 Correct 69 ms 9812 KB Output is correct
45 Correct 104 ms 9812 KB Output is correct
46 Correct 102 ms 9812 KB Output is correct
47 Correct 140 ms 9936 KB Output is correct
48 Correct 132 ms 9812 KB Output is correct
49 Correct 184 ms 9812 KB Output is correct
50 Correct 153 ms 9812 KB Output is correct
51 Correct 4 ms 500 KB Output is correct
52 Correct 3 ms 340 KB Output is correct
53 Correct 149 ms 9812 KB Output is correct
54 Correct 132 ms 9812 KB Output is correct
55 Correct 147 ms 9812 KB Output is correct
56 Correct 150 ms 9812 KB Output is correct
57 Correct 132 ms 9792 KB Output is correct
58 Correct 134 ms 9812 KB Output is correct
59 Correct 133 ms 9812 KB Output is correct
60 Correct 133 ms 9812 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 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Runtime error 1 ms 460 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -