oj.uz

답안 #872565

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
872565 2023-11-13T11:28:39 Z vjudge1 Sure Bet (CEOI17_sure) C++17
60 / 100
 2000 ms 3244 KB 
//author: Ahmet Alp Orakci
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;

#define ONLINE_JUDGE
void solve() {
    int n;
    cin >> n;

    double a[n], b[n];
    for(int i = 0; i < n; i++) {
        cin >> a[i] >> b[i];
    }

    sort(a, a + n);
    sort(b, b + n);

    double ans = 0;
    for(int i = 0; i <= n * 2; i++) {
        double calc1 = 0, calc2 = 0;
        int ptr1 = n -1, ptr2 = n -1;
        for(int j = 0; j < i; j++) {
            if(calc1 <= calc2) {
                if(ptr1 >= 0) {
                    calc1 += a[ptr1];
                    ptr1--;
                } else {
                    calc2 += b[ptr2];
                    ptr2--;
                }
            } else {
                if(ptr2 >= 0) {
                    calc2 += b[ptr2];
                    ptr2--;
                } else {
                    calc1 += a[ptr1];
                    ptr1--;
                }
            } 
        }

        //cerr << i << " :: " << calc1 << " " << calc2 << "\n";
        ans = max(ans, min(calc1, calc2) - i);
    }

    printf("%.4lf", double(ans));
    
    return;
}

signed main() {
    #ifndef ONLINE_JUDGE
        freopen(".in", "r", stdin);
        freopen(".out", "w", stdout);
    #endif

    int t = 1; //cin >> t;
    for(int i = 1; i <= t; i++) {
        solve();
    }

    return 0;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 504 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 356 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 3 ms 444 KB Output is correct
13 Correct 3 ms 348 KB Output is correct
14 Correct 3 ms 464 KB Output is correct
15 Correct 4 ms 344 KB Output is correct
16 Correct 3 ms 348 KB Output is correct

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 504 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 356 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 3 ms 444 KB Output is correct
13 Correct 3 ms 348 KB Output is correct
14 Correct 3 ms 464 KB Output is correct
15 Correct 4 ms 344 KB Output is correct
16 Correct 3 ms 348 KB Output is correct
17 Execution timed out 2001 ms 3244 KB Time limit exceeded
18 Halted 0 ms 0 KB -