oj.uz

답안 #802018

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
802018 2023-08-02T09:07:07 Z hat0412 Sure Bet (CEOI17_sure) C++14
100 / 100
 135 ms 5196 KB 
#include <bits/stdc++.h>

#define lli long long
#define lld long double
#define pb push_back
#define fi first
#define se second
#define name "surebet"

using namespace std;

const int N = 1e5 + 10;
const lld esp = 1e-6;

int n;
long double a[N], b[N];

bool cmp (long double a, long double b)
{
    return a > b;
}

void read()
{
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i] >> b[i];
        a[i] -= 1.0; b[i] -= 1.0;
    }

    sort(a + 1, a + 1 + n, cmp);
    sort(b + 1, b + 1 + n, cmp);
}

void sub1()
{
    lld res = 0, tmp1 = 0, tmp2 = 0;
    for (int i = 0; i <= n; i++)
    {
        tmp1 += a[i]; tmp2 = 0;
        for (int j = 0; j <= n; j++)
        {
            tmp2 += b[j];
            res = max(res, min(tmp1 - j, tmp2 - i));
        }
    }
    cout << fixed << setprecision(4) << res;
}

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

int Find (int i)
{
    int l = 0, r = n;
    while (l < r - 1)
    {
        int m = (l + r) >> 1;
        int mm = (m + r) >> 1;
        if (Cal(i, m) - Cal(i, mm) > esp) r = mm;
        else l = m;
    }
    if (Cal(i, l) > Cal(i, r)) return l;
    return r;
}

void sub2()
{
    lld res = 0;
    for (int i = 1; i <= n; i++) a[i] += a[i - 1];
    for (int i = 1; i <= n; i++) b[i] += b[i - 1];
    for (int i = 0; i <= n; i++)
    {
        int j = Find(i);
        res = max(res, Cal(i, j));
    }
    cout << fixed << setprecision(4) << res;
}

void solve()
{
    if (n <= 1000) {sub1(); return;}
    sub2();
}

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

    if (fopen(name ".inp", "r"))
    {
        freopen(name ".inp", "r", stdin);
        freopen(name ".out", "w", stdout);
    }

    read();
    solve();
}

Compilation message

sure.cpp: In function 'int main()':
sure.cpp:96:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   96 |         freopen(name ".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
sure.cpp:97:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   97 |         freopen(name ".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 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 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 8 ms 340 KB Output is correct
13 Correct 5 ms 340 KB Output is correct
14 Correct 5 ms 352 KB Output is correct
15 Correct 5 ms 340 KB Output is correct
16 Correct 5 ms 468 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 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 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 8 ms 340 KB Output is correct
13 Correct 5 ms 340 KB Output is correct
14 Correct 5 ms 352 KB Output is correct
15 Correct 5 ms 340 KB Output is correct
16 Correct 5 ms 468 KB Output is correct
17 Correct 115 ms 4812 KB Output is correct
18 Correct 124 ms 4732 KB Output is correct
19 Correct 135 ms 4816 KB Output is correct
20 Correct 125 ms 4812 KB Output is correct
21 Correct 134 ms 5196 KB Output is correct
22 Correct 114 ms 4808 KB Output is correct
23 Correct 112 ms 4808 KB Output is correct
24 Correct 113 ms 4812 KB Output is correct
25 Correct 113 ms 4816 KB Output is correct
26 Correct 120 ms 5088 KB Output is correct