oj.uz

답안 #734936

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
734936 2023-05-03T09:42:14 Z Sam_a17 Let's Win the Election (JOI22_ho_t3) C++17
33 / 100
 776 ms 372 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;
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 <= 20) {
    long double pi = inf;

    for(int mask = 0; mask < (1 << n); mask++) {
      vector<long double> m1, m2;

      int ok = 1;
      for(int i = 0; i < n; i++) {
        if(mask & (1 << i)) {
          if(vec[i].first == -1) ok = 0;
          m1.push_back(vec[i].first);
        } else {
          m2.push_back(vec[i].second);
        }
      }

      if(!ok) continue;

      sort(all(m1));
      long double c1 = 1, ans = 0, it = 0;
      for(int i = 0; i < sz(m1); i++) {
        ans += m1[i] / c1;
        c1++, it++;

        if(it == k) {
          break;
        }
      }

      if(it < k) {
        sort(all(m2));
        for(int i = 0; i < sz(m2); i++) {    
          ans += m2[i] / c1;
          it++;

          if(it == k) {
            break;
          }
        }
      }

      pi = min(pi, ans);
    }

    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
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 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 8 ms 340 KB Output is correct
6 Correct 8 ms 340 KB Output is correct
7 Correct 9 ms 340 KB Output is correct
8 Correct 9 ms 340 KB Output is correct
9 Correct 9 ms 340 KB Output is correct
10 Correct 9 ms 372 KB Output is correct

Subtask #2
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 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 8 ms 340 KB Output is correct
6 Correct 8 ms 340 KB Output is correct
7 Correct 9 ms 340 KB Output is correct
8 Correct 9 ms 340 KB Output is correct
9 Correct 9 ms 340 KB Output is correct
10 Correct 9 ms 372 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 5 ms 340 KB Output is correct
13 Correct 11 ms 364 KB Output is correct
14 Correct 12 ms 340 KB Output is correct
15 Correct 6 ms 368 KB Output is correct
16 Correct 11 ms 372 KB Output is correct
17 Correct 12 ms 372 KB Output is correct
18 Correct 7 ms 344 KB Output is correct
19 Correct 12 ms 340 KB Output is correct
20 Correct 13 ms 364 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 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 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 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 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 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 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 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 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 553 ms 308 KB Output is correct
17 Correct 577 ms 212 KB Output is correct
18 Correct 467 ms 312 KB Output is correct
19 Correct 681 ms 312 KB Output is correct
20 Correct 434 ms 212 KB Output is correct
21 Correct 427 ms 312 KB Output is correct
22 Correct 776 ms 304 KB Output is correct
23 Correct 506 ms 308 KB Output is correct
24 Correct 419 ms 332 KB Output is correct
25 Correct 686 ms 308 KB Output is correct
26 Correct 512 ms 308 KB Output is correct
27 Correct 709 ms 212 KB Output is correct
28 Correct 712 ms 308 KB Output is correct
29 Correct 696 ms 308 KB Output is correct
30 Correct 730 ms 304 KB Output is correct
31 Correct 728 ms 304 KB Output is correct
32 Correct 669 ms 308 KB Output is correct
33 Correct 696 ms 308 KB Output is correct
34 Correct 681 ms 308 KB Output is correct
35 Correct 648 ms 316 KB Output is correct
36 Correct 640 ms 308 KB Output is correct
37 Correct 608 ms 308 KB Output is correct
38 Correct 618 ms 344 KB Output is correct
39 Correct 605 ms 316 KB Output is correct
40 Correct 586 ms 304 KB Output is correct

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 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 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 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 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 553 ms 308 KB Output is correct
17 Correct 577 ms 212 KB Output is correct
18 Correct 467 ms 312 KB Output is correct
19 Correct 681 ms 312 KB Output is correct
20 Correct 434 ms 212 KB Output is correct
21 Correct 427 ms 312 KB Output is correct
22 Correct 776 ms 304 KB Output is correct
23 Correct 506 ms 308 KB Output is correct
24 Correct 419 ms 332 KB Output is correct
25 Correct 686 ms 308 KB Output is correct
26 Correct 512 ms 308 KB Output is correct
27 Correct 709 ms 212 KB Output is correct
28 Correct 712 ms 308 KB Output is correct
29 Correct 696 ms 308 KB Output is correct
30 Correct 730 ms 304 KB Output is correct
31 Correct 728 ms 304 KB Output is correct
32 Correct 669 ms 308 KB Output is correct
33 Correct 696 ms 308 KB Output is correct
34 Correct 681 ms 308 KB Output is correct
35 Correct 648 ms 316 KB Output is correct
36 Correct 640 ms 308 KB Output is correct
37 Correct 608 ms 308 KB Output is correct
38 Correct 618 ms 344 KB Output is correct
39 Correct 605 ms 316 KB Output is correct
40 Correct 586 ms 304 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Incorrect 1 ms 340 KB Output isn't correct
44 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 13 ms 368 KB Output isn't correct
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 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 8 ms 340 KB Output is correct
6 Correct 8 ms 340 KB Output is correct
7 Correct 9 ms 340 KB Output is correct
8 Correct 9 ms 340 KB Output is correct
9 Correct 9 ms 340 KB Output is correct
10 Correct 9 ms 372 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 5 ms 340 KB Output is correct
13 Correct 11 ms 364 KB Output is correct
14 Correct 12 ms 340 KB Output is correct
15 Correct 6 ms 368 KB Output is correct
16 Correct 11 ms 372 KB Output is correct
17 Correct 12 ms 372 KB Output is correct
18 Correct 7 ms 344 KB Output is correct
19 Correct 12 ms 340 KB Output is correct
20 Correct 13 ms 364 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 553 ms 308 KB Output is correct
37 Correct 577 ms 212 KB Output is correct
38 Correct 467 ms 312 KB Output is correct
39 Correct 681 ms 312 KB Output is correct
40 Correct 434 ms 212 KB Output is correct
41 Correct 427 ms 312 KB Output is correct
42 Correct 776 ms 304 KB Output is correct
43 Correct 506 ms 308 KB Output is correct
44 Correct 419 ms 332 KB Output is correct
45 Correct 686 ms 308 KB Output is correct
46 Correct 512 ms 308 KB Output is correct
47 Correct 709 ms 212 KB Output is correct
48 Correct 712 ms 308 KB Output is correct
49 Correct 696 ms 308 KB Output is correct
50 Correct 730 ms 304 KB Output is correct
51 Correct 728 ms 304 KB Output is correct
52 Correct 669 ms 308 KB Output is correct
53 Correct 696 ms 308 KB Output is correct
54 Correct 681 ms 308 KB Output is correct
55 Correct 648 ms 316 KB Output is correct
56 Correct 640 ms 308 KB Output is correct
57 Correct 608 ms 308 KB Output is correct
58 Correct 618 ms 344 KB Output is correct
59 Correct 605 ms 316 KB Output is correct
60 Correct 586 ms 304 KB Output is correct
61 Correct 1 ms 340 KB Output is correct
62 Correct 1 ms 212 KB Output is correct
63 Incorrect 1 ms 340 KB Output isn't correct
64 Halted 0 ms 0 KB -