oj.uz

답안 #624257

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
624257 2022-08-07T15:01:21 Z slime Let's Win the Election (JOI22_ho_t3) C++14
61 / 100
 2500 ms 247408 KB 
#include "bits/stdc++.h"
using namespace std;
#define int long long
const int MAXN = 3e5 + 10;
const int MOD = 998244353;
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;
}
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] = 1e9;
      }
    }
  }
  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;
  double res[k+1];
  for(int i=0; i<=k; i++) res[i] = -1;
  while(lb < rb) {
    int mid = (lb + rb) >> 1;
    double f0 = (res[mid] < 0 ? fun(mid) : res[mid]);
    double f1 = (res[mid+1] < 0 ? fun(mid+1) : res[mid+1]);
    if(f0 > f1) lb = mid+1;
    else rb = mid;
  }
  cout << fixed << setprecision(10) << (res[lb] < 0 ? fun(lb) : res[lb]) << "\n";
 
} 
int32_t main() {
  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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 224 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 9 ms 2900 KB Output is correct
6 Correct 48 ms 16084 KB Output is correct
7 Correct 190 ms 62592 KB Output is correct
8 Correct 436 ms 139724 KB Output is correct
9 Correct 750 ms 247408 KB Output is correct
10 Correct 377 ms 121812 KB Output is correct

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 224 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 9 ms 2900 KB Output is correct
6 Correct 48 ms 16084 KB Output is correct
7 Correct 190 ms 62592 KB Output is correct
8 Correct 436 ms 139724 KB Output is correct
9 Correct 750 ms 247408 KB Output is correct
10 Correct 377 ms 121812 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 76 ms 22956 KB Output is correct
13 Correct 189 ms 22996 KB Output is correct
14 Correct 188 ms 22996 KB Output is correct
15 Correct 436 ms 121808 KB Output is correct
16 Correct 1197 ms 121816 KB Output is correct
17 Correct 952 ms 121820 KB Output is correct
18 Correct 871 ms 247408 KB Output is correct
19 Execution timed out 2534 ms 247408 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 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 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 340 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 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 212 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 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 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 340 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 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 340 KB Output is correct
40 Correct 0 ms 340 KB Output is correct

Subtask #5
33.0 / 33.0

# 결과 실행 시간 메모리 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 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 340 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 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 340 KB Output is correct
40 Correct 0 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 468 KB Output is correct
44 Correct 2 ms 468 KB Output is correct
45 Correct 3 ms 852 KB Output is correct
46 Correct 4 ms 864 KB Output is correct
47 Correct 7 ms 1220 KB Output is correct
48 Correct 6 ms 1108 KB Output is correct
49 Correct 8 ms 1620 KB Output is correct
50 Correct 10 ms 1620 KB Output is correct
51 Correct 17 ms 2392 KB Output is correct
52 Correct 13 ms 2388 KB Output is correct
53 Correct 5 ms 1108 KB Output is correct
54 Correct 7 ms 1108 KB Output is correct
55 Correct 6 ms 1108 KB Output is correct
56 Correct 6 ms 1220 KB Output is correct
57 Correct 6 ms 1216 KB Output is correct
58 Correct 5 ms 1224 KB Output is correct
59 Correct 6 ms 1108 KB Output is correct
60 Correct 6 ms 1108 KB Output is correct

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2589 ms 247356 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 224 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 9 ms 2900 KB Output is correct
6 Correct 48 ms 16084 KB Output is correct
7 Correct 190 ms 62592 KB Output is correct
8 Correct 436 ms 139724 KB Output is correct
9 Correct 750 ms 247408 KB Output is correct
10 Correct 377 ms 121812 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 76 ms 22956 KB Output is correct
13 Correct 189 ms 22996 KB Output is correct
14 Correct 188 ms 22996 KB Output is correct
15 Correct 436 ms 121808 KB Output is correct
16 Correct 1197 ms 121816 KB Output is correct
17 Correct 952 ms 121820 KB Output is correct
18 Correct 871 ms 247408 KB Output is correct
19 Execution timed out 2534 ms 247408 KB Time limit exceeded
20 Halted 0 ms 0 KB -