oj.uz

답안 #118880

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
118880 2019-06-20T00:27:26 Z silxikys Sure Bet (CEOI17_sure) C++14
60 / 100
 2000 ms 3192 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

/*
 * max(min(Sum_{1 to n} of ai or -1,
 *         Sum_{1 to n} of bi or -1))
 * 
 */

const int maxn = 1e5+5;
int n;
double a[maxn], b[maxn];

int main()
{
    //ios_base::sync_with_stdio(false); cin.tie(0);
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i] >> b[i];
    }
    sort(a+1,a+1+n,greater<double>());
    sort(b+1,b+1+n,greater<double>());
    for (int i = 2; i <= n; i++) {
        a[i] += a[i-1];
        b[i] += b[i-1];
        //cout << a[i] << ' ' << b[i] << '\n';
    }
    double maxans = 0;
    for (int i = 0; i <= n; i++) {
        for (int j = 0; j <= n; j++) {
            double aa = a[i] - i - j;
            double bb = b[j] - j - i;
            //cout << min(aa,bb) << '\n';
            maxans = max(maxans,min(aa,bb));
        }
    }
    printf("%.4lf\n",(double)maxans);
}

Subtask #1
20.0 / 20.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 6 ms 384 KB Output is correct
13 Correct 6 ms 384 KB Output is correct
14 Correct 6 ms 384 KB Output is correct
15 Correct 6 ms 384 KB Output is correct
16 Correct 6 ms 384 KB Output is correct
17 Execution timed out 2041 ms 3192 KB Time limit exceeded
18 Halted 0 ms 0 KB -