oj.uz

Submission #865058

# Submission time Handle Problem Language Result Execution time Memory
865058 2023-10-24T04:55:32 Z vjudge1 Sure Bet (CEOI17_sure) C++17
20 / 100
 2000 ms 456 KB 
//Bismillahir-Rahmanir-Rahim
#include <bits/stdc++.h>
         
using namespace std;
      
#define flash ios_base::sync_with_stdio(0),cin.tie(0)
#define pb push_back
#define ll long long
#define ld long double
#define dbg(x) cerr << #x << " = " << x << "\n";
#define ff first
#define ss second
 
 /*     
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma comment (linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
*/ 
 
const long long INF = 1e9 + 7;
const long long MOD = 1e9 + 7;
const int maxn = 1e5 + 10;

int n;
double a[maxn], b[maxn], ans;

void get(int i, double x, double y, double cnt) {
	if (i > n) {
		ans = max(ans, min(x - cnt, y - cnt));
		return;
	}
	get(i + 1, x + a[i], y, cnt + 1);
	get(i + 1, x, y + b[i], cnt + 1);
	get(i + 1, x + a[i], y, cnt + 1);
	get(i + 1, x + a[i], y + b[i], cnt + 2);
	get(i + 1, x, y, cnt);
}

void press_F_() {
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i] >> b[i];
	}
	get(1, 0.0, 0.0, 0);
	printf("%.4lf",(double)ans);
} 

int main() {
    flash;
    // srand(time(0));
    int T = 1;
    // cin >> T;
    for (int i = 1; i <= T; i++) {
        // cout << "Case" << " " << i << ':' << "\n";
        press_F_();
    }
    //Respa gold 2023-2024 InshAllah
    return 0;
}
/*
Maybe not today and tomorrow, but InshAllah one day I will reach expert
*/
// g++ -std=c++17 main.cpp
// ./a.out

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 37 ms 456 KB Output is correct
4 Correct 35 ms 348 KB Output is correct
5 Correct 37 ms 348 KB Output is correct
6 Correct 35 ms 344 KB Output is correct

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 37 ms 456 KB Output is correct
4 Correct 35 ms 348 KB Output is correct
5 Correct 37 ms 348 KB Output is correct
6 Correct 35 ms 344 KB Output is correct
7 Execution timed out 2047 ms 348 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 37 ms 456 KB Output is correct
4 Correct 35 ms 348 KB Output is correct
5 Correct 37 ms 348 KB Output is correct
6 Correct 35 ms 344 KB Output is correct
7 Execution timed out 2047 ms 348 KB Time limit exceeded
8 Halted 0 ms 0 KB -