oj.uz

Submission #498309

# Submission time Handle Problem Language Result Execution time Memory
498309 2021-12-25T03:33:58 Z mansur Sure Bet (CEOI17_sure) C++17
20 / 100
 61 ms 292 KB 
#include<bits/stdc++.h>	
/* 
#pragma optimize ("g",on)
#pragma GCC optimize ("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("03")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native")
#pragma comment(linker, "/stack:200000000")
*/ 
//01001101 01100001 01101011 01101000 01100001  01100111 01100001 01111001 
 
using namespace std;
 
#define all(a) a.begin(), a.end()                                                   
#define rall(a) a.rbegin(), a.rend()
#define ll long long
#define pb push_back
#define sz(a) a.size()
#define nl '\n'
#define popb pop_back()                                                                   
#define ld double
#define ull unsigned long long
#define ff first                                         
#define ss second  
#define fix fixed << setprecision
#define pii pair<int, int>                          
#define E exit (0)
#define int long long
 
const int inf = 1e15, N = 2e5 + 5, mod = 998244353;                    
 
vector<pii> dir = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};

main() {                                                         
	//freopen("triangles.in", "r", stdin);                                                                                     
	//freopen("triangles.out", "w", stdout);                                                                                     
	ios_base::sync_with_stdio(NULL);                                                                                        
	cin.tie(NULL);
	int n;
	cin >> n;
	vector<double> a, b;
	for (int i = 1; i <= n; i++) {
		double x, y;
		cin >> x >> y;
		a.pb(x);
		b.pb(y);
	}
	double ans = 0;
	for (int mask = 0; mask < (1 << (n * 2)); mask++) {
		double val1 = 0, val2 = 0, cnt = 0;
		for (int i = 0; i < n; i++) {
			if (mask >> i & 1) val1 += a[i], cnt++;
		}
		for (int i = 0; i < n; i++) {
			if (mask >> (i + n) & 1) val2 += b[i], cnt++;
		}
		ans = max(ans, min(val1, val2) - cnt);
	}
	cout << fix(4) << ans;
}

Compilation message

sure.cpp:35:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   35 | main() {
      | ^~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 61 ms 204 KB Output is correct
4 Correct 53 ms 288 KB Output is correct
5 Correct 53 ms 204 KB Output is correct
6 Correct 55 ms 292 KB Output is correct

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 61 ms 204 KB Output is correct
4 Correct 53 ms 288 KB Output is correct
5 Correct 53 ms 204 KB Output is correct
6 Correct 55 ms 292 KB Output is correct
7 Incorrect 1 ms 204 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 61 ms 204 KB Output is correct
4 Correct 53 ms 288 KB Output is correct
5 Correct 53 ms 204 KB Output is correct
6 Correct 55 ms 292 KB Output is correct
7 Incorrect 1 ms 204 KB Output isn't correct
8 Halted 0 ms 0 KB -