oj.uz

답안 #498303

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
498303 2021-12-25T03:20:31 Z armashka Sure Bet (CEOI17_sure) C++17
60 / 100
 2000 ms 3144 KB 
#include <bits/stdc++.h>
 
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define all(v) v.begin(),v.end()
#define pb push_back
#define sz size()
#define ft first
#define sd second
 
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef unsigned long long ull;
 
const int N = 1e6 + 5;
const ll M = 1e8;
const ll inf = 1e18;
const ll mod = 1e9;
const double Pi = acos(-1); 
 
ll binpow(ll x, ll ti) { ll res = 1;while (ti){if(ti & 1)res *= x;x *= x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll binmul(ll x, ll ti) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); }
bool odd(ll n) { return (n % 2 == 1); }
bool even(ll n) { return (n % 2 == 0); }            

ll n;
double a[N], b[N];

const void solve(/*Armashka*/) {
	cin >> n;
	for (int i = 1; i <= n; ++ i) cin >> a[i] >> b[i];
	sort(a + 1, a + n + 1); reverse(a + 1, a + n + 1);
	sort(b + 1, b + n + 1); reverse(b + 1, b + n + 1);
	double ans = 0.0, res1 = 0.0;
	for (int i = 1; i <= n; ++ i) {
		res1 += a[i];
		double res2 = 0.0;
		for (int j = 1; j <= n; ++ j) {
			res2 += b[j];
			ll cnt = i + j;
			//cout << res1 << " " << res2 << " " << cnt << "\n";
			ans = max(ans, min(res1 - cnt, res2 - cnt));
		}		
	}
	cout << fixed << setprecision(4) << ans << "\n";
}
            
signed main() {
    fast;
    //freopen("divide.in", "r", stdin);
    //freopen("divide.out", "w", stdout);
    int tt = 1;
	//cin >> tt;
    while (tt --) {                                                             
        solve();
    }
}
 
/*
5 4 4
1 2
3 1
3 4
5 3
4 5 2 3
2 1 3 1
1 3 5
2 3 4 5
2 1 3 1
*/

Subtask #1
20.0 / 20.0

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

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 300 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 3 ms 336 KB Output is correct
14 Correct 3 ms 336 KB Output is correct
15 Correct 2 ms 336 KB Output is correct
16 Correct 3 ms 336 KB Output is correct

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 300 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 3 ms 336 KB Output is correct
14 Correct 3 ms 336 KB Output is correct
15 Correct 2 ms 336 KB Output is correct
16 Correct 3 ms 336 KB Output is correct
17 Execution timed out 2052 ms 3144 KB Time limit exceeded
18 Halted 0 ms 0 KB -