oj.uz

Submission #537929

# Submission time Handle Problem Language Result Execution time Memory
537929 2022-03-15T22:01:46 Z theysoldtheworld Sure Bet (CEOI17_sure) C++14
100 / 100
 102 ms 5032 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
double Get(vector<double> a , vector<double> b) {
  int n = (int)a.size();
  double h = 0 , t = 0;
  double ans = 0;
  int id = 0;
  for (int i = 0 ; i < n ; i++) {
    h += a[i];
    double new_t = t - 1;
    int add = 0;
    double cur = min(h , new_t);
    while (id < n && min(h - (add + 1) , new_t + b[id]) > cur) {
      add += 1;
      new_t += b[id];
      cur = min(h - add , new_t);
      id += 1;
    }
    h -= add;
    t = new_t;
    ans = max(ans , min(h , t));
  }
  return ans;
}
 
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<double> a(n) , b(n);
  for (int i = 0 ; i < n ; i++) {
    cin >> a[i] >> b[i];
    a[i] -= 1; 
    b[i] -= 1;
  }
  sort(a.rbegin() , a.rend());
  sort(b.rbegin() , b.rend());
  double ans = max(Get(a , b) , Get(b , a));
  cout << fixed << setprecision(4) << ans << '\n';
  return 0; 
}

Subtask #1
20.0 / 20.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 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct

Subtask #2
40.0 / 40.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 1 ms 212 KB Output is correct
4 Correct 1 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 1 ms 212 KB Output is correct
8 Correct 1 ms 216 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct

Subtask #3
40.0 / 40.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 1 ms 212 KB Output is correct
4 Correct 1 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 1 ms 212 KB Output is correct
8 Correct 1 ms 216 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 82 ms 5032 KB Output is correct
18 Correct 81 ms 4952 KB Output is correct
19 Correct 79 ms 4956 KB Output is correct
20 Correct 79 ms 4956 KB Output is correct
21 Correct 102 ms 4956 KB Output is correct
22 Correct 76 ms 4968 KB Output is correct
23 Correct 74 ms 4968 KB Output is correct
24 Correct 78 ms 4956 KB Output is correct
25 Correct 78 ms 4964 KB Output is correct
26 Correct 96 ms 4952 KB Output is correct