답안 #534603

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
534603	2022-03-08T11:38:20 Z	alextodoran	Sure Bet (CEOI17_sure)	C++17	100 / 100	88 ms	5076 KB

sure

/**
 ____ ____ ____ ____ ____
||a |||t |||o |||d |||o ||
||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|

**/

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;

const int N_MAX = (int) 1e5;

int n;
ld a[N_MAX + 2];
ld b[N_MAX + 2];

ld f (int i, int j) {
    return min(a[i] - i - j, b[j] - i - j);
}

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

    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i] >> b[i];
    }
    sort(a + 1, a + n + 1, greater <ld> ());
    sort(b + 1, b + n + 1, greater <ld> ());

    for (int i = 1; i <= n; i++) {
        a[i] += a[i - 1];
        b[i] += b[i - 1];
    }

    ld answer = 0;
    for (int i = 0, j = 0; i <= n; i++) {
        while (j < n && b[j + 1] <= a[i]) {
            j++;
        }
        answer = max(answer, f(i, j));
        if (j + 1 <= n) {
            answer = max(answer, f(i, j + 1));
        }
    }
    cout << fixed << setprecision(4) << answer << "\n";

    return 0;
}

Subtask #1

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	0 ms	332 KB	Output is correct
4	Correct	0 ms	320 KB	Output is correct
5	Correct	1 ms	316 KB	Output is correct
6	Correct	1 ms	320 KB	Output is correct

Subtask #2

40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	0 ms	332 KB	Output is correct
4	Correct	0 ms	320 KB	Output is correct
5	Correct	1 ms	316 KB	Output is correct
6	Correct	1 ms	320 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	0 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	2 ms	332 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct

Subtask #3

40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	0 ms	332 KB	Output is correct
4	Correct	0 ms	320 KB	Output is correct
5	Correct	1 ms	316 KB	Output is correct
6	Correct	1 ms	320 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	0 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	2 ms	332 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	79 ms	4804 KB	Output is correct
18	Correct	84 ms	4820 KB	Output is correct
19	Correct	80 ms	4804 KB	Output is correct
20	Correct	86 ms	4760 KB	Output is correct
21	Correct	88 ms	5076 KB	Output is correct
22	Correct	79 ms	4800 KB	Output is correct
23	Correct	80 ms	4764 KB	Output is correct
24	Correct	80 ms	4792 KB	Output is correct
25	Correct	84 ms	4804 KB	Output is correct
26	Correct	88 ms	5072 KB	Output is correct