oj.uz

Submission #794837

# Submission time Handle Problem Language Result Execution time Memory
794837 2023-07-27T00:57:02 Z gun_gan Let's Win the Election (JOI22_ho_t3) C++17
61 / 100
 2500 ms 499316 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
const int MX = 505;
 
int N, K;
int a[MX], b[MX];
double dp[MX][MX][MX];
 
vector<pair<int, int>> v;

double f(int x) {
      for(int i = 0; i <= N; i++)
            for(int j = 0; j <= min(i, K); j++)
                  for(int k = 0; k <= min(i, x); k++)
                        dp[i][j][k] = 1e9;
       
      dp[0][0][0] = 0;
      for(int i = 0; i < N; i++) {
            for(int j = 0; j <= min(i, K); j++) { // votes
                  for(int k = 0; k <= min(i, x); 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));
                  }
            }
      }

      return dp[N][K][x];
}
 
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;
      int l = 0, r = min(K, tot);

      while(r - l > 1) {
            int mid = (l + r) >> 1;
            if(f(mid) > f(mid + 1)) 
                  l = mid;
            else 
                  r = mid;
      } 

      cout << fixed << setprecision(15) << min(f(l), f(l + 1)) << '\n';
 
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:56:14: warning: unused variable 'ans' [-Wunused-variable]
   56 |       double ans = 1e9;
      |              ^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 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 35 ms 99756 KB Output is correct
6 Correct 75 ms 221720 KB Output is correct
7 Correct 131 ms 375504 KB Output is correct
8 Correct 147 ms 467832 KB Output is correct
9 Correct 155 ms 498364 KB Output is correct
10 Correct 139 ms 454220 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 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 35 ms 99756 KB Output is correct
6 Correct 75 ms 221720 KB Output is correct
7 Correct 131 ms 375504 KB Output is correct
8 Correct 147 ms 467832 KB Output is correct
9 Correct 155 ms 498364 KB Output is correct
10 Correct 139 ms 454220 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 840 ms 257916 KB Output is correct
13 Correct 635 ms 257852 KB Output is correct
14 Correct 425 ms 257648 KB Output is correct
15 Execution timed out 2584 ms 455220 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #3
11.0 / 11.0

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

Subtask #4
12.0 / 12.0

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

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 0 ms 468 KB Output is correct
6 Correct 0 ms 468 KB Output is correct
7 Correct 0 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 0 ms 468 KB Output is correct
10 Correct 0 ms 468 KB Output is correct
11 Correct 0 ms 468 KB Output is correct
12 Correct 0 ms 468 KB Output is correct
13 Correct 0 ms 468 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 468 KB Output is correct
16 Correct 1 ms 724 KB Output is correct
17 Correct 1 ms 980 KB Output is correct
18 Correct 1 ms 1108 KB Output is correct
19 Correct 1 ms 1236 KB Output is correct
20 Correct 1 ms 1236 KB Output is correct
21 Correct 1 ms 1236 KB Output is correct
22 Correct 1 ms 1236 KB Output is correct
23 Correct 1 ms 1236 KB Output is correct
24 Correct 1 ms 1236 KB Output is correct
25 Correct 1 ms 1236 KB Output is correct
26 Correct 1 ms 1236 KB Output is correct
27 Correct 1 ms 1236 KB Output is correct
28 Correct 1 ms 1236 KB Output is correct
29 Correct 1 ms 1236 KB Output is correct
30 Correct 1 ms 1236 KB Output is correct
31 Correct 1 ms 1236 KB Output is correct
32 Correct 1 ms 1236 KB Output is correct
33 Correct 1 ms 1236 KB Output is correct
34 Correct 1 ms 1236 KB Output is correct
35 Correct 1 ms 1236 KB Output is correct
36 Correct 1 ms 1236 KB Output is correct
37 Correct 1 ms 1236 KB Output is correct
38 Correct 1 ms 1236 KB Output is correct
39 Correct 1 ms 1236 KB Output is correct
40 Correct 1 ms 1236 KB Output is correct
41 Correct 3 ms 6868 KB Output is correct
42 Correct 4 ms 6972 KB Output is correct
43 Correct 6 ms 11476 KB Output is correct
44 Correct 7 ms 11476 KB Output is correct
45 Correct 12 ms 16252 KB Output is correct
46 Correct 9 ms 16168 KB Output is correct
47 Correct 13 ms 18644 KB Output is correct
48 Correct 15 ms 18732 KB Output is correct
49 Correct 18 ms 20328 KB Output is correct
50 Correct 15 ms 20308 KB Output is correct
51 Correct 20 ms 21084 KB Output is correct
52 Correct 21 ms 21080 KB Output is correct
53 Correct 11 ms 18704 KB Output is correct
54 Correct 13 ms 18732 KB Output is correct
55 Correct 19 ms 18772 KB Output is correct
56 Correct 12 ms 18644 KB Output is correct
57 Correct 15 ms 18616 KB Output is correct
58 Correct 18 ms 18624 KB Output is correct
59 Correct 17 ms 18644 KB Output is correct
60 Correct 15 ms 18736 KB Output is correct

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2579 ms 499316 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 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 35 ms 99756 KB Output is correct
6 Correct 75 ms 221720 KB Output is correct
7 Correct 131 ms 375504 KB Output is correct
8 Correct 147 ms 467832 KB Output is correct
9 Correct 155 ms 498364 KB Output is correct
10 Correct 139 ms 454220 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 840 ms 257916 KB Output is correct
13 Correct 635 ms 257852 KB Output is correct
14 Correct 425 ms 257648 KB Output is correct
15 Execution timed out 2584 ms 455220 KB Time limit exceeded
16 Halted 0 ms 0 KB -