oj.uz

Submission #624252

# Submission time Handle Problem Language Result Execution time Memory
624252 2022-08-07T14:56:58 Z slime Let's Win the Election (JOI22_ho_t3) C++14
66 / 100
 2500 ms 254536 KB 
#include "bits/stdc++.h"
using namespace std;
#define int long long
const int MAXN = 3e5 + 10;
const int MOD = 998244353;
#define ll __int128
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x, int y) {
  int u = uniform_int_distribution<int>(x, y)(rng); return u;
}
ll read() { int x; cin >> x; return (ll)x; }
long long bm(long long b, long long p) {
  if(p==0) return 1 % MOD;
  long long r = bm(b, p >> 1);
  if(p&1) return (((r*r) % MOD) * b) % MOD;
  return (r*r) % MOD;
}
long long inv(long long b) { 
  return bm(b, MOD-2);
}
long long f[MAXN];
long long nCr(int n, int r) { 
  long long ans = f[n]; ans *= inv(f[r]); ans %= MOD;
  ans *= inv(f[n-r]); ans %= MOD; return ans;
}
long long fib[MAXN], lucas[MAXN];
void precomp() { 
  for(int i=0; i<MAXN; i++) f[i] = (i == 0 ? 1 % MOD : (f[i-1] * i) % MOD); 
  lucas[0] = 2;
  lucas[1] = 1;
  for(int i=2; i<MAXN; i++) lucas[i] = (lucas[i-2] + lucas[i-1]) % MOD;
  fib[0] = 0;
  fib[1] = 1;
  for(int i=2; i<MAXN; i++) fib[i] = (fib[i-2] + fib[i-1]) % MOD;
}
int fastlog(int x) {
  return (x == 0 ? -1 : 64 - __builtin_clzll(x) - 1);
}
void google(int i) { cout << "Case #" << i << ": "; }
int csb(int l, int r, int k) { // count number of [l, r] such that i & 2^k > 0
  if(l > r) return 0;
  if(l == 0) {
    int s = r / (1ll << (k+1)); // number of complete cycles
    int t = r % (1ll << (k+1));
    int ans = s * (1ll << k);
    ans += (t >= (1ll << k) ? t - (1ll << k) + 1 : 0);
    return ans;
  }
  else return csb(0, r, k) - csb(0, l - 1, k);
}
int lis(vector<int> a) {
  int n = a.size();
  int bucket[n+1];
  for(int i=1; i<=n; i++) bucket[i] = 1e18;
  int ans = 1;
  for(int x: a) {
    auto it = lower_bound(bucket + 1, bucket +n +1, x);
    int d = distance(bucket, it);
    ans = max(ans, d);
    bucket[d] = min(bucket[d], x);
  }
  return ans;
}
bool cmp(pair<int, int> x, pair<int, int> y) {
  return x.second < y.second;
}
int n, k, a[MAXN], b[MAXN];
double fun(int bcnt) {
  double dp[k - bcnt + 1][bcnt + 1][n + 1]; // type A, type B, prefix
  for(int i=0; i<=k-bcnt; i++) {
    for(int j=0; j<=bcnt; j++) {
      for(int l=0; l<=n; l++) {
        dp[i][j][l] = 1e18;
      }
    }
  }
  for(int i=0; i<=n; i++) dp[0][0][i] = 0;
  for(int i=0; i<=k-bcnt; i++) {
    for(int j=0; j<=bcnt; j++) {
      if(i == 0 && j == 0) continue;
      for(int l=1; l<=n; l++) {
        // register as type A
        if(i > 0) dp[i][j][l] = dp[i-1][j][l-1] + a[l] * 1.0 / (bcnt + 1);
        // register as type B
        if(j > 0 && b[l] != 1226) dp[i][j][l] = min(dp[i][j][l], dp[i][j-1][l-1] + b[l] * 1.0 / j);
        // register as neither
        dp[i][j][l] = min(dp[i][j][l], dp[i][j][l-1]);
      }
    }
  }
  return dp[k-bcnt][bcnt][n];
}
void solve(int tc) {
  cin >> n >> k;
  pair<int, int> p[n+1];
  for(int i=1; i<=n; i++) {
    cin >> p[i].first >> p[i].second;
    if(p[i].second == -1) p[i].second = 1226;
  }
  sort(p+1, p+n+1, cmp);
  for(int i=1; i<=n; i++) {
    a[i] = p[i].first, b[i] = p[i].second;
  }
  int lb = 0, rb = k;
  while(lb < rb) {
    int mid = (lb + rb) >> 1;
    if(fun(mid) > fun(mid+1)) lb = mid+1;
    else rb = mid;
  }
  cout << fixed << setprecision(10) << fun(lb) << "\n";
 
} 
int32_t main() {
  precomp();
  ios::sync_with_stdio(0); cin.tie(0);
  int t = 1; //cin >> t;
  for(int i=1; i<=t; i++) solve(i);
}
// I don't know geometry.
// Teaming is unfair.
 
/*
8
7
3 15
19 40
11 62
7 72
16 27
33 53
14 50
17 24
*/

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7380 KB Output is correct
2 Correct 8 ms 7380 KB Output is correct
3 Correct 7 ms 7380 KB Output is correct
4 Correct 8 ms 7380 KB Output is correct
5 Correct 17 ms 9972 KB Output is correct
6 Correct 55 ms 23124 KB Output is correct
7 Correct 205 ms 69640 KB Output is correct
8 Correct 444 ms 146720 KB Output is correct
9 Correct 834 ms 254452 KB Output is correct
10 Correct 391 ms 128836 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7380 KB Output is correct
2 Correct 8 ms 7380 KB Output is correct
3 Correct 7 ms 7380 KB Output is correct
4 Correct 8 ms 7380 KB Output is correct
5 Correct 17 ms 9972 KB Output is correct
6 Correct 55 ms 23124 KB Output is correct
7 Correct 205 ms 69640 KB Output is correct
8 Correct 444 ms 146720 KB Output is correct
9 Correct 834 ms 254452 KB Output is correct
10 Correct 391 ms 128836 KB Output is correct
11 Correct 8 ms 7252 KB Output is correct
12 Correct 97 ms 30028 KB Output is correct
13 Correct 201 ms 30028 KB Output is correct
14 Correct 207 ms 30044 KB Output is correct
15 Correct 437 ms 128860 KB Output is correct
16 Correct 1269 ms 128856 KB Output is correct
17 Correct 942 ms 128864 KB Output is correct
18 Correct 854 ms 254456 KB Output is correct
19 Correct 2480 ms 254492 KB Output is correct
20 Correct 1603 ms 254536 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7296 KB Output is correct
2 Correct 7 ms 7280 KB Output is correct
3 Correct 7 ms 7380 KB Output is correct
4 Correct 8 ms 7276 KB Output is correct
5 Correct 7 ms 7340 KB Output is correct
6 Correct 7 ms 7372 KB Output is correct
7 Correct 7 ms 7296 KB Output is correct
8 Correct 7 ms 7376 KB Output is correct
9 Correct 8 ms 7272 KB Output is correct
10 Correct 7 ms 7380 KB Output is correct
11 Correct 7 ms 7376 KB Output is correct
12 Correct 8 ms 7328 KB Output is correct
13 Correct 7 ms 7376 KB Output is correct
14 Correct 8 ms 7360 KB Output is correct
15 Correct 7 ms 7380 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7296 KB Output is correct
2 Correct 7 ms 7280 KB Output is correct
3 Correct 7 ms 7380 KB Output is correct
4 Correct 8 ms 7276 KB Output is correct
5 Correct 7 ms 7340 KB Output is correct
6 Correct 7 ms 7372 KB Output is correct
7 Correct 7 ms 7296 KB Output is correct
8 Correct 7 ms 7376 KB Output is correct
9 Correct 8 ms 7272 KB Output is correct
10 Correct 7 ms 7380 KB Output is correct
11 Correct 7 ms 7376 KB Output is correct
12 Correct 8 ms 7328 KB Output is correct
13 Correct 7 ms 7376 KB Output is correct
14 Correct 8 ms 7360 KB Output is correct
15 Correct 7 ms 7380 KB Output is correct
16 Correct 7 ms 7356 KB Output is correct
17 Correct 7 ms 7380 KB Output is correct
18 Correct 7 ms 7376 KB Output is correct
19 Correct 8 ms 7376 KB Output is correct
20 Correct 7 ms 7372 KB Output is correct
21 Correct 8 ms 7372 KB Output is correct
22 Correct 7 ms 7316 KB Output is correct
23 Correct 7 ms 7380 KB Output is correct
24 Correct 7 ms 7380 KB Output is correct
25 Correct 7 ms 7380 KB Output is correct
26 Correct 7 ms 7380 KB Output is correct
27 Correct 7 ms 7284 KB Output is correct
28 Correct 7 ms 7340 KB Output is correct
29 Correct 8 ms 7376 KB Output is correct
30 Correct 7 ms 7372 KB Output is correct
31 Correct 7 ms 7380 KB Output is correct
32 Correct 7 ms 7380 KB Output is correct
33 Correct 7 ms 7380 KB Output is correct
34 Correct 7 ms 7380 KB Output is correct
35 Correct 7 ms 7336 KB Output is correct
36 Correct 7 ms 7372 KB Output is correct
37 Correct 7 ms 7372 KB Output is correct
38 Correct 8 ms 7364 KB Output is correct
39 Correct 8 ms 7380 KB Output is correct
40 Correct 8 ms 7320 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7296 KB Output is correct
2 Correct 7 ms 7280 KB Output is correct
3 Correct 7 ms 7380 KB Output is correct
4 Correct 8 ms 7276 KB Output is correct
5 Correct 7 ms 7340 KB Output is correct
6 Correct 7 ms 7372 KB Output is correct
7 Correct 7 ms 7296 KB Output is correct
8 Correct 7 ms 7376 KB Output is correct
9 Correct 8 ms 7272 KB Output is correct
10 Correct 7 ms 7380 KB Output is correct
11 Correct 7 ms 7376 KB Output is correct
12 Correct 8 ms 7328 KB Output is correct
13 Correct 7 ms 7376 KB Output is correct
14 Correct 8 ms 7360 KB Output is correct
15 Correct 7 ms 7380 KB Output is correct
16 Correct 7 ms 7356 KB Output is correct
17 Correct 7 ms 7380 KB Output is correct
18 Correct 7 ms 7376 KB Output is correct
19 Correct 8 ms 7376 KB Output is correct
20 Correct 7 ms 7372 KB Output is correct
21 Correct 8 ms 7372 KB Output is correct
22 Correct 7 ms 7316 KB Output is correct
23 Correct 7 ms 7380 KB Output is correct
24 Correct 7 ms 7380 KB Output is correct
25 Correct 7 ms 7380 KB Output is correct
26 Correct 7 ms 7380 KB Output is correct
27 Correct 7 ms 7284 KB Output is correct
28 Correct 7 ms 7340 KB Output is correct
29 Correct 8 ms 7376 KB Output is correct
30 Correct 7 ms 7372 KB Output is correct
31 Correct 7 ms 7380 KB Output is correct
32 Correct 7 ms 7380 KB Output is correct
33 Correct 7 ms 7380 KB Output is correct
34 Correct 7 ms 7380 KB Output is correct
35 Correct 7 ms 7336 KB Output is correct
36 Correct 7 ms 7372 KB Output is correct
37 Correct 7 ms 7372 KB Output is correct
38 Correct 8 ms 7364 KB Output is correct
39 Correct 8 ms 7380 KB Output is correct
40 Correct 8 ms 7320 KB Output is correct
41 Correct 7 ms 7376 KB Output is correct
42 Correct 7 ms 7380 KB Output is correct
43 Correct 9 ms 7508 KB Output is correct
44 Correct 8 ms 7568 KB Output is correct
45 Correct 10 ms 7892 KB Output is correct
46 Correct 11 ms 7888 KB Output is correct
47 Correct 13 ms 8148 KB Output is correct
48 Correct 14 ms 8152 KB Output is correct
49 Correct 15 ms 8704 KB Output is correct
50 Correct 17 ms 8712 KB Output is correct
51 Correct 23 ms 9428 KB Output is correct
52 Correct 19 ms 9428 KB Output is correct
53 Correct 11 ms 8268 KB Output is correct
54 Correct 13 ms 8140 KB Output is correct
55 Correct 13 ms 8148 KB Output is correct
56 Correct 12 ms 8136 KB Output is correct
57 Correct 13 ms 8148 KB Output is correct
58 Correct 12 ms 8148 KB Output is correct
59 Correct 12 ms 8148 KB Output is correct
60 Correct 15 ms 8148 KB Output is correct

Subtask #6
0 / 11.0

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

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7380 KB Output is correct
2 Correct 8 ms 7380 KB Output is correct
3 Correct 7 ms 7380 KB Output is correct
4 Correct 8 ms 7380 KB Output is correct
5 Correct 17 ms 9972 KB Output is correct
6 Correct 55 ms 23124 KB Output is correct
7 Correct 205 ms 69640 KB Output is correct
8 Correct 444 ms 146720 KB Output is correct
9 Correct 834 ms 254452 KB Output is correct
10 Correct 391 ms 128836 KB Output is correct
11 Correct 8 ms 7252 KB Output is correct
12 Correct 97 ms 30028 KB Output is correct
13 Correct 201 ms 30028 KB Output is correct
14 Correct 207 ms 30044 KB Output is correct
15 Correct 437 ms 128860 KB Output is correct
16 Correct 1269 ms 128856 KB Output is correct
17 Correct 942 ms 128864 KB Output is correct
18 Correct 854 ms 254456 KB Output is correct
19 Correct 2480 ms 254492 KB Output is correct
20 Correct 1603 ms 254536 KB Output is correct
21 Correct 7 ms 7296 KB Output is correct
22 Correct 7 ms 7280 KB Output is correct
23 Correct 7 ms 7380 KB Output is correct
24 Correct 8 ms 7276 KB Output is correct
25 Correct 7 ms 7340 KB Output is correct
26 Correct 7 ms 7372 KB Output is correct
27 Correct 7 ms 7296 KB Output is correct
28 Correct 7 ms 7376 KB Output is correct
29 Correct 8 ms 7272 KB Output is correct
30 Correct 7 ms 7380 KB Output is correct
31 Correct 7 ms 7376 KB Output is correct
32 Correct 8 ms 7328 KB Output is correct
33 Correct 7 ms 7376 KB Output is correct
34 Correct 8 ms 7360 KB Output is correct
35 Correct 7 ms 7380 KB Output is correct
36 Correct 7 ms 7356 KB Output is correct
37 Correct 7 ms 7380 KB Output is correct
38 Correct 7 ms 7376 KB Output is correct
39 Correct 8 ms 7376 KB Output is correct
40 Correct 7 ms 7372 KB Output is correct
41 Correct 8 ms 7372 KB Output is correct
42 Correct 7 ms 7316 KB Output is correct
43 Correct 7 ms 7380 KB Output is correct
44 Correct 7 ms 7380 KB Output is correct
45 Correct 7 ms 7380 KB Output is correct
46 Correct 7 ms 7380 KB Output is correct
47 Correct 7 ms 7284 KB Output is correct
48 Correct 7 ms 7340 KB Output is correct
49 Correct 8 ms 7376 KB Output is correct
50 Correct 7 ms 7372 KB Output is correct
51 Correct 7 ms 7380 KB Output is correct
52 Correct 7 ms 7380 KB Output is correct
53 Correct 7 ms 7380 KB Output is correct
54 Correct 7 ms 7380 KB Output is correct
55 Correct 7 ms 7336 KB Output is correct
56 Correct 7 ms 7372 KB Output is correct
57 Correct 7 ms 7372 KB Output is correct
58 Correct 8 ms 7364 KB Output is correct
59 Correct 8 ms 7380 KB Output is correct
60 Correct 8 ms 7320 KB Output is correct
61 Correct 7 ms 7376 KB Output is correct
62 Correct 7 ms 7380 KB Output is correct
63 Correct 9 ms 7508 KB Output is correct
64 Correct 8 ms 7568 KB Output is correct
65 Correct 10 ms 7892 KB Output is correct
66 Correct 11 ms 7888 KB Output is correct
67 Correct 13 ms 8148 KB Output is correct
68 Correct 14 ms 8152 KB Output is correct
69 Correct 15 ms 8704 KB Output is correct
70 Correct 17 ms 8712 KB Output is correct
71 Correct 23 ms 9428 KB Output is correct
72 Correct 19 ms 9428 KB Output is correct
73 Correct 11 ms 8268 KB Output is correct
74 Correct 13 ms 8140 KB Output is correct
75 Correct 13 ms 8148 KB Output is correct
76 Correct 12 ms 8136 KB Output is correct
77 Correct 13 ms 8148 KB Output is correct
78 Correct 12 ms 8148 KB Output is correct
79 Correct 12 ms 8148 KB Output is correct
80 Correct 15 ms 8148 KB Output is correct
81 Execution timed out 2577 ms 254460 KB Time limit exceeded
82 Halted 0 ms 0 KB -