oj.uz

답안 #865246

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
865246 2023-10-24T06:47:37 Z vjudge1 Sure Bet (CEOI17_sure) C++
60 / 100
 2000 ms 2824 KB 
#include <bits/stdc++.h>
#include <sstream>
#include <fstream>
#define et "\n"
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define ioi ios::sync_with_stdio(false); cin.tie(0);  cout.tie(0)
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define M 1000000007
 
using namespace std;
ll n,m,k;
string s1;
map <ll,ll> mp;
double ans,cnt,cnt1;
double a[211111],b[211111];
void solve() {
	cin >> n;
	ans = 0;
	for (int i = 1;i <= n;i++) {
		cin >> a[i] >> b[i];
	}
	sort(a + 1,a + n + 1);
	sort(b + 1,b + n + 1);
	cnt = 0;
	cnt1 = 0;
	for (int i = n;i >= 1;i --) {
		cnt += a[i] - 1.0;
		cnt1 -= (double)(n - i) + 1.0;
		for (int j = n;j >= 1;j--) {
			cnt1 += b[j] - 1.0;
			cnt -= 1.0;
			ans = max(ans,min(cnt,cnt1));
		}
		cnt += (double)n;
		cnt1 = 0;
//		cout << ans << ' ' << i << ' ' << b[i] << et;
	}
	cnt = 0;
	cnt1 = 0;
	for (int i = n;i >= 1;i --) {
		cnt += b[i] - 1.0;
		cnt1 -= (double)(n - i) + 1.0;
		for (int j = n;j >= 1;j--) {
			cnt1 += a[j] - 1.0;
			cnt -= 1.0;
			ans = max(ans,min(cnt,cnt1));
		}
		cnt += (double)n;
		cnt1 = 0;
//		cout << ans << ' ' << i << ' ' << b[i] << et;
	}
	printf("%.4lf",(double)ans);
}
int main() {
	ioi;
	ll tt = 1;
//	cin >> tt;
	while (tt--) {
		solve();
	}
}

Subtask #1
20.0 / 20.0

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

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2512 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 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 2396 KB Output is correct
12 Correct 4 ms 2396 KB Output is correct
13 Correct 4 ms 2396 KB Output is correct
14 Correct 4 ms 2396 KB Output is correct
15 Correct 4 ms 2396 KB Output is correct
16 Correct 4 ms 2396 KB Output is correct

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2512 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 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 2396 KB Output is correct
12 Correct 4 ms 2396 KB Output is correct
13 Correct 4 ms 2396 KB Output is correct
14 Correct 4 ms 2396 KB Output is correct
15 Correct 4 ms 2396 KB Output is correct
16 Correct 4 ms 2396 KB Output is correct
17 Execution timed out 2068 ms 2824 KB Time limit exceeded
18 Halted 0 ms 0 KB -