oj.uz

Submission #735010

# Submission time Handle Problem Language Result Execution time Memory
735010 2023-05-03T11:15:16 Z Sam_a17 Let's Win the Election (JOI22_ho_t3) C++17
100 / 100
 205 ms 2380 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 = 5e2 + 10;
double dp[N][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;
    if(b == -1) {
      b = inf;
    }
    vec.emplace_back(b, a);
  }

  sort(all(vec));
  // dbg(vec)
  double pi = inf;

  for(int qq = 0; qq <= n; qq++) {
    if(qq > k) break;

    double ci = qq + 1;

    for(int i = 0; i <= n; i++) {
      for(int j = 0; j <= n; j++) {
        dp[i][j] = inf;
      }
    }

    dp[0][0] = 0;
    for(int i = 0; i < n; i++) {
      for(int j = 0; j <= min(i, k - qq); j++) {
        int bb = i - j, ok = 1;

        if(bb < qq) {
          ok = 0;
          double db = bb + 1;
          dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] + vec[i].first / db);
        }

        if(j < (k - qq)) {
          dp[i + 1][j + 1] = min(dp[i + 1][j + 1], dp[i][j] + vec[i].second / ci);
        } 
        
        if(ok) {
          dp[i + 1][j] = min(dp[i + 1][j], dp[i][j]);
        }
      }
    }

    pi = min(pi, dp[n][k - qq]);
  }

  cout << setprecision(12) << pi << '\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

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 340 KB Output is correct
5 Correct 10 ms 2376 KB Output is correct
6 Correct 26 ms 2380 KB Output is correct
7 Correct 60 ms 2324 KB Output is correct
8 Correct 111 ms 2316 KB Output is correct
9 Correct 175 ms 2320 KB Output is correct
10 Correct 119 ms 2316 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 340 KB Output is correct
5 Correct 10 ms 2376 KB Output is correct
6 Correct 26 ms 2380 KB Output is correct
7 Correct 60 ms 2324 KB Output is correct
8 Correct 111 ms 2316 KB Output is correct
9 Correct 175 ms 2320 KB Output is correct
10 Correct 119 ms 2316 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 32 ms 2320 KB Output is correct
13 Correct 30 ms 2316 KB Output is correct
14 Correct 27 ms 2336 KB Output is correct
15 Correct 115 ms 2320 KB Output is correct
16 Correct 104 ms 2260 KB Output is correct
17 Correct 104 ms 2324 KB Output is correct
18 Correct 156 ms 2316 KB Output is correct
19 Correct 173 ms 2320 KB Output is correct
20 Correct 158 ms 2324 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 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 1 ms 340 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 1 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 0 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 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 1 ms 340 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 1 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 0 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 724 KB Output is correct
42 Correct 1 ms 724 KB Output is correct
43 Correct 1 ms 724 KB Output is correct
44 Correct 1 ms 724 KB Output is correct
45 Correct 1 ms 724 KB Output is correct
46 Correct 1 ms 724 KB Output is correct
47 Correct 2 ms 724 KB Output is correct
48 Correct 1 ms 724 KB Output is correct
49 Correct 2 ms 724 KB Output is correct
50 Correct 2 ms 724 KB Output is correct
51 Correct 4 ms 724 KB Output is correct
52 Correct 2 ms 724 KB Output is correct
53 Correct 2 ms 724 KB Output is correct
54 Correct 1 ms 724 KB Output is correct
55 Correct 1 ms 724 KB Output is correct
56 Correct 1 ms 724 KB Output is correct
57 Correct 2 ms 724 KB Output is correct
58 Correct 1 ms 724 KB Output is correct
59 Correct 2 ms 724 KB Output is correct
60 Correct 2 ms 724 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 170 ms 2260 KB Output is correct
2 Correct 155 ms 2260 KB Output is correct
3 Correct 205 ms 2320 KB Output is correct
4 Correct 201 ms 2332 KB Output is correct
5 Correct 162 ms 2320 KB Output is correct
6 Correct 166 ms 2260 KB Output is correct
7 Correct 165 ms 2316 KB Output is correct

Subtask #7
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 340 KB Output is correct
5 Correct 10 ms 2376 KB Output is correct
6 Correct 26 ms 2380 KB Output is correct
7 Correct 60 ms 2324 KB Output is correct
8 Correct 111 ms 2316 KB Output is correct
9 Correct 175 ms 2320 KB Output is correct
10 Correct 119 ms 2316 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 32 ms 2320 KB Output is correct
13 Correct 30 ms 2316 KB Output is correct
14 Correct 27 ms 2336 KB Output is correct
15 Correct 115 ms 2320 KB Output is correct
16 Correct 104 ms 2260 KB Output is correct
17 Correct 104 ms 2324 KB Output is correct
18 Correct 156 ms 2316 KB Output is correct
19 Correct 173 ms 2320 KB Output is correct
20 Correct 158 ms 2324 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 0 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 0 ms 340 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 0 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 0 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 0 ms 340 KB Output is correct
50 Correct 0 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 0 ms 340 KB Output is correct
53 Correct 0 ms 340 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 0 ms 340 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 1 ms 724 KB Output is correct
62 Correct 1 ms 724 KB Output is correct
63 Correct 1 ms 724 KB Output is correct
64 Correct 1 ms 724 KB Output is correct
65 Correct 1 ms 724 KB Output is correct
66 Correct 1 ms 724 KB Output is correct
67 Correct 2 ms 724 KB Output is correct
68 Correct 1 ms 724 KB Output is correct
69 Correct 2 ms 724 KB Output is correct
70 Correct 2 ms 724 KB Output is correct
71 Correct 4 ms 724 KB Output is correct
72 Correct 2 ms 724 KB Output is correct
73 Correct 2 ms 724 KB Output is correct
74 Correct 1 ms 724 KB Output is correct
75 Correct 1 ms 724 KB Output is correct
76 Correct 1 ms 724 KB Output is correct
77 Correct 2 ms 724 KB Output is correct
78 Correct 1 ms 724 KB Output is correct
79 Correct 2 ms 724 KB Output is correct
80 Correct 2 ms 724 KB Output is correct
81 Correct 170 ms 2260 KB Output is correct
82 Correct 155 ms 2260 KB Output is correct
83 Correct 205 ms 2320 KB Output is correct
84 Correct 201 ms 2332 KB Output is correct
85 Correct 162 ms 2320 KB Output is correct
86 Correct 166 ms 2260 KB Output is correct
87 Correct 165 ms 2316 KB Output is correct
88 Correct 9 ms 2340 KB Output is correct
89 Correct 10 ms 2344 KB Output is correct
90 Correct 22 ms 2260 KB Output is correct
91 Correct 23 ms 2260 KB Output is correct
92 Correct 59 ms 2260 KB Output is correct
93 Correct 58 ms 2324 KB Output is correct
94 Correct 105 ms 2260 KB Output is correct
95 Correct 105 ms 2260 KB Output is correct
96 Correct 134 ms 2320 KB Output is correct
97 Correct 130 ms 2324 KB Output is correct
98 Correct 95 ms 2260 KB Output is correct
99 Correct 96 ms 2328 KB Output is correct
100 Correct 104 ms 2260 KB Output is correct
101 Correct 105 ms 2260 KB Output is correct
102 Correct 93 ms 2320 KB Output is correct
103 Correct 129 ms 2328 KB Output is correct
104 Correct 104 ms 2320 KB Output is correct
105 Correct 89 ms 2260 KB Output is correct