oj.uz

답안 #801670

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
801670 2023-08-02T07:11:08 Z arush_agu Sure Bet (CEOI17_sure) C++17
100 / 100
 79 ms 3624 KB 
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

#ifdef DEBUG
#include <time.h>
#endif

#define all(a) (a).begin(), (a).end()
#define rev(a) (a).rbegin(), (a).rend()
#define F first
#define S second
int recur_depth = 0;
#ifdef DEBUG
#define dbg(x)                                                                 \
  {                                                                            \
    ++recur_depth;                                                             \
    auto x_ = x;                                                               \
    --recur_depth;                                                             \
    cerr << string(recur_depth, '\t') << "\e[91m" << __func__ << ":"           \
         << __LINE__ << "\t" << #x << " = " << x_ << "\e[39m" << endl;         \
  }
#else
#define dbg(x)
#endif

using namespace std;
using namespace __gnu_pbds;

typedef pair<int, int> ii;

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> llll;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pair<int, int>> vii;
typedef vector<vii> vvii;

typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pair<ll, ll>> vll;
typedef vector<vll> vvll;

typedef vector<bool> vb;

template <class type1>
using ordered_set = tree<type1, null_type, less<type1>, rb_tree_tag,
                         tree_order_statistics_node_update>;

template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) {
  return os << '(' << p.first << ", " << p.second << ')';
}
template <typename T_container, typename T = typename enable_if<
                                    !is_same<T_container, string>::value,
                                    typename T_container::value_type>::type>
ostream &operator<<(ostream &os, const T_container &v) {
  os << '{';
  string sep;
  for (const T &x : v)
    os << sep << x, sep = ", ";
  return os << '}';
}

const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1e9;
const ld EPS = 1e-9;

void solve() {
  int n, idx1, idx2;
  vector<double> a, b;
  double s1, s2, ans;

  cin >> n;
  a.resize(n + 1, 0);
  b.resize(n + 1, 0);
  for (int i = 0; i < n; i++) {
    cin >> a[i] >> b[i];
  }

  sort(a.begin(), a.end(), greater<double>());
  sort(b.begin(), b.end(), greater<double>());

  while (idx1 <= n && idx2 <= n) {
    if (s1 < s2) {
      s1 += a[idx1];
      idx1++;
    } else {
      s2 += b[idx2];
      idx2++;
    }
    s1--;
    s2--;
    ans = max(ans, min(s1, s2));
  }

  cout << fixed << setprecision(4) << ans << "\n";
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);

  clock_t start = clock();

  int test_cases = 1;
  // cin >> test_cases;

  while (test_cases--)
    solve();

#ifdef DEBUG
  cerr << fixed << setprecision(10)
       << "\nTime Taken: " << (double)(clock() - start) / CLOCKS_PER_SEC
       << "s\n";
#endif
  return 0;
}

Compilation message

sure.cpp: In function 'int main()':
sure.cpp:127:11: warning: unused variable 'start' [-Wunused-variable]
  127 |   clock_t start = clock();
      |           ^~~~~
sure.cpp: In function 'void solve()':
sure.cpp:93:10: warning: 'idx1' may be used uninitialized in this function [-Wmaybe-uninitialized]
   93 |   int n, idx1, idx2;
      |          ^~~~
sure.cpp:93:16: warning: 'idx2' may be used uninitialized in this function [-Wmaybe-uninitialized]
   93 |   int n, idx1, idx2;
      |                ^~~~
sure.cpp:112:10: warning: 's2' may be used uninitialized in this function [-Wmaybe-uninitialized]
  112 |       s2 += b[idx2];
sure.cpp:109:10: warning: 's1' may be used uninitialized in this function [-Wmaybe-uninitialized]
  109 |       s1 += a[idx1];

Subtask #1
20.0 / 20.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 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 316 KB Output is correct
6 Correct 1 ms 240 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 324 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 65 ms 3248 KB Output is correct
18 Correct 64 ms 3144 KB Output is correct
19 Correct 59 ms 3252 KB Output is correct
20 Correct 58 ms 3144 KB Output is correct
21 Correct 63 ms 3624 KB Output is correct
22 Correct 58 ms 3248 KB Output is correct
23 Correct 79 ms 3244 KB Output is correct
24 Correct 69 ms 3156 KB Output is correct
25 Correct 58 ms 3144 KB Output is correct
26 Correct 62 ms 3544 KB Output is correct