oj.uz

답안 #595855

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
595855 2022-07-14T07:41:35 Z OttoTheDino Sure Bet (CEOI17_sure) C++17
60 / 100
 2000 ms 3132 KB 
#include <bits/stdc++.h>
using namespace std;

#define rep(i,s,e)                  for (int i = s; i <= e; ++i)
#define rrep(i,s,e)                 for (int i = s; i >= e; --i)
#define pb                          push_back
#define pf                          push_front
#define fi                          first
#define se                          second
#define all(a)                      a.begin(), a.end()
#define len(a)                      (int)a.size()
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    int n; cin >> n;
    double a[n+1] = {}, b[n+1] = {}, s1 = 0, s2 = 0, ma = 0;
    rep (i,0,n-1) {
        cin >> a[i] >> b[i];
    }

    sort(a,a+n,greater<double>());
    sort(b,b+n,greater<double>());

    rep (i,0,n) {
        s2 = 0;
        rep (j,0,n) {
            ma = max(ma, min(s1, s2)-i-j);
            s2 += b[j];
        }
        s1 += a[i];
    }

    cout << fixed << setprecision(4) << ma << "\n";

    return 0;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 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 320 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 316 KB Output is correct
12 Correct 3 ms 328 KB Output is correct
13 Correct 3 ms 332 KB Output is correct
14 Correct 3 ms 324 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 3 ms 352 KB Output is correct
17 Execution timed out 2055 ms 3132 KB Time limit exceeded
18 Halted 0 ms 0 KB -