oj.uz

답안 #734968

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
734968 2023-05-03T10:22:36 Z Sam_a17 Let's Win the Election (JOI22_ho_t3) C++17
56 / 100
 2500 ms 429904 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 long double inf = 1e15;
const int N = 1e2 + 10;
long double dp[5 * N][5 * N][N];
int n, k;

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

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

  sort(all(vec));

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

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

      long double ci = qq + 1;

      for(int i = 0; i <= n; i++) {
        for(int j = 0; j <= n; 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 <= qq; j++) {

          if(k == n) {
            int e = i - j;
            if(j + 1 <= qq && vec[i].first != -1) {
              long 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) {
                long 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]);
              // dbg(dp[i + 1][j][e + 1])
            }
          }
        }
      }

      // dbg(dp[n][qq][k])
      // for(int i = 0; i <= n; i++) {
      //   dbg(make_pair(qq, i))
      //   dbg(dp[n][qq][i])
      // }
      pi = min(pi, dp[n][qq][max(0, k - qq)]);
    }

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

  long double p = inf;
  for(int i = 0; i <= n; i++) {
    long double cnt = 1, ans = 0;
    vector<long 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
0 / 5.0

# 결과 실행 시간 메모리 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 1 ms 340 KB Output is correct
5 Correct 7 ms 340 KB Output is correct
6 Correct 8 ms 340 KB Output is correct
7 Correct 8 ms 340 KB Output is correct
8 Correct 11 ms 340 KB Output is correct
9 Execution timed out 2585 ms 429836 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 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 1 ms 340 KB Output is correct
5 Correct 7 ms 340 KB Output is correct
6 Correct 8 ms 340 KB Output is correct
7 Correct 8 ms 340 KB Output is correct
8 Correct 11 ms 340 KB Output is correct
9 Execution timed out 2585 ms 429836 KB Time limit exceeded
10 Halted 0 ms 0 KB -

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 468 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 0 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 468 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 0 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 3 ms 1108 KB Output is correct
17 Correct 3 ms 1108 KB Output is correct
18 Correct 2 ms 1108 KB Output is correct
19 Correct 3 ms 1108 KB Output is correct
20 Correct 2 ms 1108 KB Output is correct
21 Correct 2 ms 1108 KB Output is correct
22 Correct 3 ms 1108 KB Output is correct
23 Correct 2 ms 1108 KB Output is correct
24 Correct 3 ms 1108 KB Output is correct
25 Correct 1 ms 1108 KB Output is correct
26 Correct 1 ms 1108 KB Output is correct
27 Correct 2 ms 1108 KB Output is correct
28 Correct 3 ms 1108 KB Output is correct
29 Correct 3 ms 1108 KB Output is correct
30 Correct 2 ms 1108 KB Output is correct
31 Correct 3 ms 1108 KB Output is correct
32 Correct 2 ms 1108 KB Output is correct
33 Correct 3 ms 1108 KB Output is correct
34 Correct 2 ms 1108 KB Output is correct
35 Correct 2 ms 1108 KB Output is correct
36 Correct 2 ms 1108 KB Output is correct
37 Correct 3 ms 1192 KB Output is correct
38 Correct 2 ms 1108 KB Output is correct
39 Correct 2 ms 1108 KB Output is correct
40 Correct 2 ms 1108 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 468 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 0 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 3 ms 1108 KB Output is correct
17 Correct 3 ms 1108 KB Output is correct
18 Correct 2 ms 1108 KB Output is correct
19 Correct 3 ms 1108 KB Output is correct
20 Correct 2 ms 1108 KB Output is correct
21 Correct 2 ms 1108 KB Output is correct
22 Correct 3 ms 1108 KB Output is correct
23 Correct 2 ms 1108 KB Output is correct
24 Correct 3 ms 1108 KB Output is correct
25 Correct 1 ms 1108 KB Output is correct
26 Correct 1 ms 1108 KB Output is correct
27 Correct 2 ms 1108 KB Output is correct
28 Correct 3 ms 1108 KB Output is correct
29 Correct 3 ms 1108 KB Output is correct
30 Correct 2 ms 1108 KB Output is correct
31 Correct 3 ms 1108 KB Output is correct
32 Correct 2 ms 1108 KB Output is correct
33 Correct 3 ms 1108 KB Output is correct
34 Correct 2 ms 1108 KB Output is correct
35 Correct 2 ms 1108 KB Output is correct
36 Correct 2 ms 1108 KB Output is correct
37 Correct 3 ms 1192 KB Output is correct
38 Correct 2 ms 1108 KB Output is correct
39 Correct 2 ms 1108 KB Output is correct
40 Correct 2 ms 1108 KB Output is correct
41 Correct 922 ms 18432 KB Output is correct
42 Correct 884 ms 18432 KB Output is correct
43 Correct 893 ms 18432 KB Output is correct
44 Correct 877 ms 18436 KB Output is correct
45 Correct 885 ms 18432 KB Output is correct
46 Correct 864 ms 18428 KB Output is correct
47 Correct 883 ms 18432 KB Output is correct
48 Correct 877 ms 18436 KB Output is correct
49 Correct 857 ms 18432 KB Output is correct
50 Correct 876 ms 18436 KB Output is correct
51 Correct 24 ms 18056 KB Output is correct
52 Correct 24 ms 18048 KB Output is correct
53 Correct 885 ms 18428 KB Output is correct
54 Correct 879 ms 18436 KB Output is correct
55 Correct 873 ms 18436 KB Output is correct
56 Correct 874 ms 18432 KB Output is correct
57 Correct 882 ms 18508 KB Output is correct
58 Correct 857 ms 18436 KB Output is correct
59 Correct 865 ms 18436 KB Output is correct
60 Correct 870 ms 18432 KB Output is correct

Subtask #6
0 / 11.0

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

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 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 1 ms 340 KB Output is correct
5 Correct 7 ms 340 KB Output is correct
6 Correct 8 ms 340 KB Output is correct
7 Correct 8 ms 340 KB Output is correct
8 Correct 11 ms 340 KB Output is correct
9 Execution timed out 2585 ms 429836 KB Time limit exceeded
10 Halted 0 ms 0 KB -