oj.uz

답안 #734973

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
734973 2023-05-03T10:27:24 Z Sam_a17 Let's Win the Election (JOI22_ho_t3) C++17
77 / 100
 2312 ms 506940 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
 
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
 
#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt(x) __builtin_popcount(x)
 
#define pb push_back
#define popf pop_front
#define popb pop_back
 
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
 
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
 
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
 
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();
 
  if (str != "") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
  }
}
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const double inf = 1e9;
const int N = 1e2 + 10;
double dp[5 * N][5 * N][5 * N];
int n, k;

void solve_() {
  cin >> n >> k;

  vector<pair<double, double>> vec;
  for(int i = 1; i <= n; i++) {
    double a, b; cin >> a >> b;
    vec.emplace_back(b, a);
  }

  sort(all(vec));

  if(n <= 100 || k == n) {
    double pi = inf;

    for(int qq = 0; qq <= n; qq++) {

      double ci = qq + 1;

      for(int i = 0; i <= n; i++) {
        for(int j = 0; j <= i; j++) {
          if(k == n) {
            dp[i][j][i - j] = inf;
          } else {
            for(int e = 0; e <= n; e++) {
              dp[i][j][e] = inf;
            }
          }
        }
      }


      dp[0][0][0] = 0;

      for(int i = 0; i < n; i++) {
        for(int j = 0; j <= min(i, qq); j++) {

          if(k == n) {
            int e = i - j;
            if(j + 1 <= qq && vec[i].first != -1) {
              double qn = j + 1;
              dp[i + 1][j + 1][e] = min(dp[i + 1][j + 1][e], dp[i][j][e] + vec[i].first / qn);
            }
            dp[i + 1][j][e + 1] = min(dp[i + 1][j][e + 1], dp[i][j][e] + vec[i].second / ci);
            dp[i + 1][j][e] = min(dp[i + 1][j][e], dp[i][j][e]);
          } else {
            for(int e = 0; e <= n && e + j <= i; e++) {
              if(j + 1 <= qq && vec[i].first != -1) {
                double qn = j + 1;
                dp[i + 1][j + 1][e] = min(dp[i + 1][j + 1][e], dp[i][j][e] + vec[i].first / qn);
              }
              dp[i + 1][j][e + 1] = min(dp[i + 1][j][e + 1], dp[i][j][e] + vec[i].second / ci);
              dp[i + 1][j][e] = min(dp[i + 1][j][e], dp[i][j][e]);
            }
          }
        }
      }
      pi = min(pi, dp[n][qq][max(0, k - qq)]);
    }

    cout << setprecision(7) << pi << '\n';
    return;
  }

  double p = inf;
  for(int i = 0; i <= n; i++) {
    double cnt = 1, ans = 0;
    vector<double> vi;

    int cc = 0;
    for(int j = 0; j < i; j++) {
      if(vec[j].first == -1) {
        vi.push_back(vec[j].second);
        continue;
      }
      cc++;
      ans += vec[j].first / cnt;
      cnt += 1;
    }

    for(int j = i; j < n; j++) {
      vi.push_back(vec[j].second);
    }
    sort(all(vi));

    int it = 0, mm = k - cc;
    while(mm > 0) {
      ans += vi[it] / cnt; 
      it++, mm--;
    }

    p = min(p, ans);
  }

  cout << setprecision(15) << p << '\n';
}
 
int main() {
  setIO();
 
  auto solve = [&](int test_case)-> void {
    while(test_case--) {
      solve_();
    }
  };
 
  int test_cases = 1;
  // cin >> test_cases;
  solve(test_cases);
 
  return 0;
}

Compilation message

Main.cpp: In function 'void setIO(std::string)':
Main.cpp:64:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:65:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 4 ms 340 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 5 ms 332 KB Output is correct
9 Correct 1771 ms 506732 KB Output is correct
10 Correct 3 ms 340 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 4 ms 340 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 5 ms 332 KB Output is correct
9 Correct 1771 ms 506732 KB Output is correct
10 Correct 3 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 3 ms 340 KB Output is correct
13 Correct 6 ms 340 KB Output is correct
14 Correct 6 ms 340 KB Output is correct
15 Correct 4 ms 332 KB Output is correct
16 Correct 6 ms 340 KB Output is correct
17 Correct 7 ms 340 KB Output is correct
18 Correct 1975 ms 506684 KB Output is correct
19 Correct 1855 ms 506616 KB Output is correct
20 Correct 1792 ms 506664 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 456 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 456 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 1364 KB Output is correct
17 Correct 1 ms 1364 KB Output is correct
18 Correct 1 ms 1364 KB Output is correct
19 Correct 2 ms 1364 KB Output is correct
20 Correct 1 ms 1364 KB Output is correct
21 Correct 1 ms 1364 KB Output is correct
22 Correct 1 ms 1364 KB Output is correct
23 Correct 1 ms 1364 KB Output is correct
24 Correct 1 ms 1364 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 1364 KB Output is correct
28 Correct 1 ms 1364 KB Output is correct
29 Correct 1 ms 1364 KB Output is correct
30 Correct 1 ms 1364 KB Output is correct
31 Correct 1 ms 1364 KB Output is correct
32 Correct 2 ms 1356 KB Output is correct
33 Correct 1 ms 1364 KB Output is correct
34 Correct 1 ms 1364 KB Output is correct
35 Correct 1 ms 1364 KB Output is correct
36 Correct 1 ms 1364 KB Output is correct
37 Correct 1 ms 1356 KB Output is correct
38 Correct 1 ms 1364 KB Output is correct
39 Correct 1 ms 1364 KB Output is correct
40 Correct 1 ms 1364 KB Output is correct

Subtask #5
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 456 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 1364 KB Output is correct
17 Correct 1 ms 1364 KB Output is correct
18 Correct 1 ms 1364 KB Output is correct
19 Correct 2 ms 1364 KB Output is correct
20 Correct 1 ms 1364 KB Output is correct
21 Correct 1 ms 1364 KB Output is correct
22 Correct 1 ms 1364 KB Output is correct
23 Correct 1 ms 1364 KB Output is correct
24 Correct 1 ms 1364 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 1364 KB Output is correct
28 Correct 1 ms 1364 KB Output is correct
29 Correct 1 ms 1364 KB Output is correct
30 Correct 1 ms 1364 KB Output is correct
31 Correct 1 ms 1364 KB Output is correct
32 Correct 2 ms 1356 KB Output is correct
33 Correct 1 ms 1364 KB Output is correct
34 Correct 1 ms 1364 KB Output is correct
35 Correct 1 ms 1364 KB Output is correct
36 Correct 1 ms 1364 KB Output is correct
37 Correct 1 ms 1356 KB Output is correct
38 Correct 1 ms 1364 KB Output is correct
39 Correct 1 ms 1364 KB Output is correct
40 Correct 1 ms 1364 KB Output is correct
41 Correct 171 ms 22948 KB Output is correct
42 Correct 192 ms 22956 KB Output is correct
43 Correct 153 ms 22948 KB Output is correct
44 Correct 154 ms 22868 KB Output is correct
45 Correct 206 ms 22944 KB Output is correct
46 Correct 158 ms 22944 KB Output is correct
47 Correct 224 ms 22948 KB Output is correct
48 Correct 158 ms 22868 KB Output is correct
49 Correct 142 ms 23044 KB Output is correct
50 Correct 160 ms 22952 KB Output is correct
51 Correct 17 ms 21416 KB Output is correct
52 Correct 21 ms 21396 KB Output is correct
53 Correct 163 ms 22944 KB Output is correct
54 Correct 161 ms 22988 KB Output is correct
55 Correct 144 ms 22940 KB Output is correct
56 Correct 137 ms 22872 KB Output is correct
57 Correct 157 ms 22940 KB Output is correct
58 Correct 163 ms 22948 KB Output is correct
59 Correct 183 ms 22868 KB Output is correct
60 Correct 144 ms 22956 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1948 ms 506588 KB Output is correct
2 Correct 1986 ms 506940 KB Output is correct
3 Correct 1930 ms 506712 KB Output is correct
4 Correct 2312 ms 506820 KB Output is correct
5 Correct 1944 ms 506724 KB Output is correct
6 Correct 2114 ms 506628 KB Output is correct
7 Correct 2048 ms 506680 KB Output is correct

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 4 ms 340 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 5 ms 332 KB Output is correct
9 Correct 1771 ms 506732 KB Output is correct
10 Correct 3 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 3 ms 340 KB Output is correct
13 Correct 6 ms 340 KB Output is correct
14 Correct 6 ms 340 KB Output is correct
15 Correct 4 ms 332 KB Output is correct
16 Correct 6 ms 340 KB Output is correct
17 Correct 7 ms 340 KB Output is correct
18 Correct 1975 ms 506684 KB Output is correct
19 Correct 1855 ms 506616 KB Output is correct
20 Correct 1792 ms 506664 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 456 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 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 1 ms 1364 KB Output is correct
37 Correct 1 ms 1364 KB Output is correct
38 Correct 1 ms 1364 KB Output is correct
39 Correct 2 ms 1364 KB Output is correct
40 Correct 1 ms 1364 KB Output is correct
41 Correct 1 ms 1364 KB Output is correct
42 Correct 1 ms 1364 KB Output is correct
43 Correct 1 ms 1364 KB Output is correct
44 Correct 1 ms 1364 KB Output is correct
45 Correct 1 ms 1236 KB Output is correct
46 Correct 1 ms 1236 KB Output is correct
47 Correct 1 ms 1364 KB Output is correct
48 Correct 1 ms 1364 KB Output is correct
49 Correct 1 ms 1364 KB Output is correct
50 Correct 1 ms 1364 KB Output is correct
51 Correct 1 ms 1364 KB Output is correct
52 Correct 2 ms 1356 KB Output is correct
53 Correct 1 ms 1364 KB Output is correct
54 Correct 1 ms 1364 KB Output is correct
55 Correct 1 ms 1364 KB Output is correct
56 Correct 1 ms 1364 KB Output is correct
57 Correct 1 ms 1356 KB Output is correct
58 Correct 1 ms 1364 KB Output is correct
59 Correct 1 ms 1364 KB Output is correct
60 Correct 1 ms 1364 KB Output is correct
61 Correct 171 ms 22948 KB Output is correct
62 Correct 192 ms 22956 KB Output is correct
63 Correct 153 ms 22948 KB Output is correct
64 Correct 154 ms 22868 KB Output is correct
65 Correct 206 ms 22944 KB Output is correct
66 Correct 158 ms 22944 KB Output is correct
67 Correct 224 ms 22948 KB Output is correct
68 Correct 158 ms 22868 KB Output is correct
69 Correct 142 ms 23044 KB Output is correct
70 Correct 160 ms 22952 KB Output is correct
71 Correct 17 ms 21416 KB Output is correct
72 Correct 21 ms 21396 KB Output is correct
73 Correct 163 ms 22944 KB Output is correct
74 Correct 161 ms 22988 KB Output is correct
75 Correct 144 ms 22940 KB Output is correct
76 Correct 137 ms 22872 KB Output is correct
77 Correct 157 ms 22940 KB Output is correct
78 Correct 163 ms 22948 KB Output is correct
79 Correct 183 ms 22868 KB Output is correct
80 Correct 144 ms 22956 KB Output is correct
81 Correct 1948 ms 506588 KB Output is correct
82 Correct 1986 ms 506940 KB Output is correct
83 Correct 1930 ms 506712 KB Output is correct
84 Correct 2312 ms 506820 KB Output is correct
85 Correct 1944 ms 506724 KB Output is correct
86 Correct 2114 ms 506628 KB Output is correct
87 Correct 2048 ms 506680 KB Output is correct
88 Incorrect 7 ms 340 KB Output isn't correct
89 Halted 0 ms 0 KB -