oj.uz

Submission #854643

# Submission time Handle Problem Language Result Execution time Memory
854643 2023-09-28T09:51:32 Z anhphant Sure Bet (CEOI17_sure) C++14
100 / 100
 94 ms 8452 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ldb;
#define endl '\n'

ll N;
ldb A[100007], B[100007];

void initialize() {
    ios_base :: sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    if (fopen("FILE.INP", "r")) {
        freopen("FILE.INP", "r", stdin);
        freopen("FILE.OUT", "w", stdout);
    }

    cin >> N;
    for(int i = 1; i <= N; ++i) cin >> A[i] >> B[i];

    sort(A + 1, A + 1 + N, greater<ldb>());
    sort(B + 1, B + 1 + N, greater<ldb>());

    /*for(int i = 1; i <= N; ++i) {
        cerr << A[i] << " " << B[i] << endl;
    }*/
}

namespace subtask2 {
    void solve() {
        ldb sum1 = 0;
        ldb ans = 0;
        for(int i = 0; i <= N; ++i) {
            sum1 += A[i];
            ldb sum2 = 0;
            for(int j = 0; j <= N; ++j) {
                sum2 += B[j];
                ans = max(ans, min(sum1 - ldb(i + j), sum2 - ldb(i + j)));

                //cerr << i << " " << j << " " << i + j << endl;
                //cerr << setprecision(4) << sum1 << " " << sum2 << " " <<
                //sum1 - ldb(i + j) << " " << sum2 - ldb(i + j) << endl;
            }
        }

        cout << fixed << setprecision(4) << ans;
    }

    void process() {
        solve();
    }
}

namespace subtask3 {
    ldb Apre[100007], Bpre[100007];
    void solve() {
        for(int i = 1; i <= N; ++i) {
            Apre[i] = Apre[i - 1] + A[i];
            Bpre[i] = Bpre[i - 1] + B[i];
        }

        ldb ans = 0;

        for(int i = 1; i <= N; ++i) {
            int j;
            j = lower_bound(Bpre + 1, Bpre + 1 + N, Apre[i]) - Bpre;
            if (j != N + 1) ans = max(ans, Apre[i] - ldb(i + j));

            j = lower_bound(Apre + 1, Apre + 1 + N, Bpre[i]) - Apre;
            if (j != N + 1) ans = max(ans, Bpre[i] - ldb(i + j));
        }

        cout << fixed << setprecision(4) << ans;
    }

    void process() {
        solve();
    }
}

int main() {
    initialize();
    subtask3 :: process();
}

Compilation message

sure.cpp: In function 'void initialize()':
sure.cpp:14:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |         freopen("FILE.INP", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
sure.cpp:15:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |         freopen("FILE.OUT", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2648 KB Output is correct

Subtask #2
40.0 / 40.0

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

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2648 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 2 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 89 ms 6592 KB Output is correct
18 Correct 92 ms 8020 KB Output is correct
19 Correct 86 ms 8016 KB Output is correct
20 Correct 84 ms 8076 KB Output is correct
21 Correct 91 ms 8448 KB Output is correct
22 Correct 94 ms 8196 KB Output is correct
23 Correct 88 ms 7984 KB Output is correct
24 Correct 85 ms 8020 KB Output is correct
25 Correct 83 ms 7900 KB Output is correct
26 Correct 88 ms 8452 KB Output is correct