제출 #46376

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
46376		RockyB	Sure Bet (CEOI17_sure)	C++17	0 / 100	37 ms	536 KiB

sure

/// In The Name Of God
 
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
#include <bits/stdc++.h>
 
#define f first
#define s second
 
#define pb push_back
#define pp pop_back
#define mp make_pair
 
#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()
 
#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);
 
#define nl '\n'
#define ioi exit(0);
 
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
 
const int N = (int)5e5 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;
 
const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
 
using namespace std;
 
int n;
double a[N], b[N];
 
double ans, add;
 
void rec(int v = 1, double x = 0, double y = 0) {
	if (v > n) {
		ans = max(ans, min(x, y));
		if (clock() / (double)CLOCKS_PER_SEC > 1.9) cout << setprecision(4) << fixed << ans, ioi
		return;
	}
	rec(v + 1, x, y);
	rec(v + 1, x + a[v] - 1, y - 1);
	rec(v + 1, x - 1, y + b[v] - 1);
}
int main() {
	#ifdef IOI2018
		freopen ("in.txt", "r", stdin);
	#endif
	Kazakhstan
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i] >> b[i];
		if (min(a[i], b[i]) >= 2) add += min(a[i] - 2, b[i] - 2);
	}
	rec();
	cout << setprecision(4) << fixed << ans + add;
	ioi
}

• Subtask 1: 0 / 20
• Subtask 2: 0 / 40
• Subtask 3: 0 / 40