oj.uz

Submission #543251

# Submission time Handle Problem Language Result Execution time Memory
543251 2022-03-30T01:23:36 Z Olympia Sure Bet (CEOI17_sure) C++17
60 / 100
 2000 ms 4676 KB 
#include <vector>
#include <algorithm>
#include <iostream>
#include <set>
#include <cmath>
#include <map>
#include <random>
#include <cassert>
#include <ctime>
#include <cstdlib>
#include <queue>
#include <limits.h>

using namespace std;
int main () {
    int N; cin >> N;
    vector<double> a(N), b(N);
    for (int i = 0; i < N; i++) {
        cin >> a[i] >> b[i];
    }
    sort(a.begin(), a.end()), reverse(a.begin(), a.end());
    sort(b.begin(), b.end()), reverse(b.begin(), b.end());
    vector<double> pref_a(N + 1), pref_b(N + 1);
    pref_a[0] = pref_b[0] = 0;
    for (int i = 1; i <= N; i++) {
        pref_a[i] = pref_a[i - 1] + a[i - 1];
        pref_b[i] = pref_b[i - 1] + b[i - 1];
    }
    double ansr = 0;
    for (int i = 0; i <= N; i++) {
        for (int j = 0; j <= N; j++) {
            //cout << pref_a[i] - i - j << " " << pref_b[j] - i - j << '\n';
            double ans = min(pref_a[i] - i - j, pref_b[j] - i - j);
            ansr = max(ansr, ans);
        }
    }
    printf("%.4lf",(double)ansr);
}

Subtask #1
20.0 / 20.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 296 KB Output is correct
5 Correct 0 ms 296 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 3 ms 308 KB Output is correct
13 Correct 3 ms 308 KB Output is correct
14 Correct 3 ms 340 KB Output is correct
15 Correct 3 ms 340 KB Output is correct
16 Correct 4 ms 340 KB Output is correct
17 Execution timed out 2084 ms 4676 KB Time limit exceeded
18 Halted 0 ms 0 KB -