oj.uz

답안 #843482

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
843482 2023-09-04T03:28:44 Z vjudge1 Sure Bet (CEOI17_sure) C++17
60 / 100
 2000 ms 6480 KB 
 ///***LTT***///
/// ->TUYEN QUOC GIA<- ///
#include<bits/stdc++.h>
//#pragma GCC optimize ("O3")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("popcnt")
//#define int long long
#define endl "\n"
#define F first
#define S second
#define pb push_back
#define CHECKBIT(mask,i) ((mask>>(i) )&1) // == 1 la bat, == 0 la tat
#define OFFBIT(mask,i) ((1<<(i))^mask) // tat bit thu i
#define ONBIT(mask,i) ((1<<(i))mask) // bat bit thu i
using namespace std;
const long long oo = 1e9+7;
const int N = 2 * 1e5 + 10;
int n;
long double  a[N], b[N], L, R, cntl, cntr, ans;
bool cmp (long double a,long double b){
    return a > b;
}
void inp(){
    cin >> n;
    for (int i = 1;i <= n;i++){
        cin >> a[i] >> b[i];
    }
    return;
}
void solve(){
    sort(a+1,a+n+1,cmp);
    sort(b+1,b+n+1,cmp);
//    for (int i = 1;i <= n;i++){
//        cout << a[i] <<" "<< b[i] <<"\n";
//    }
    for (int i = 1;i <= n;i++){
        cntl++;
        cntr = 0;
        L += a[i];
        R = 0;
        for (int j = 1;j <= n;j++){
            cntr++;
            R += b[j];
            ans = max(ans, min(R - (cntl + cntr), L - (cntl + cntr) ));
        }
    }
    cout << fixed << setprecision(4) << ans;
    return;
}
int main(){
    ios_base::sync_with_stdio(NULL);
    cin.tie(NULL);
    cout.tie(NULL);
    if (fopen("file.inp", "r")){
        freopen("file.inp", "r", stdin);
        freopen("file.out", "w", stdout);
    }
    //int t;
    //cin >> t;
    //while(t--){
    inp();
    solve();
    //}
}

Compilation message

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

Subtask #1
20.0 / 20.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
0 / 40.0

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