Roller coaster

input/code.cpp: In function 'void solve()':
input/code.cpp:56:28: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   56 |     for(int i = 0; i < 1<<N+1; i++) {
      |                           ~^~
input/code.cpp:60:23: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
   60 |         if(i & (1<<N) > 0) currentR = P(N-1);
      |                ~~~~~~~^~~
input/code.cpp:64:29: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
   64 |             if(i & (1 << j) > 0) currentR = max(P(j), currentR);
      |                    ~~~~~~~~~^~~

#include <bits/stdc++.h>
using namespace std;

// debug
template<class T> ostream& operator<<(ostream&, const vector<T>&);
template<class T> ostream& operator<<(ostream&, const set<T>&);
template<class T> ostream& operator<<(ostream&, const multiset<T>&);
template<class K, class V> ostream& operator<<(ostream&, const map<K, V>&);
template<class T, size_t N> ostream& operator<<(ostream&, const array<T, N>&);
template<class A, class B> ostream& operator<<(ostream& os, const pair<A, B>& p) { return os << "(" << p.first << ", " << p.second << ")"; }
template<class T>
void print_collection(ostream& os, const T& v) {
    os << "{";
    bool first = true;
    for (const auto& x : v) {
        if (!first) os << ", ";
        first = false;
        os << x;
    }
    os << "}";
}
template<class T> ostream& operator<<(ostream& os, const vector<T>& v) { print_collection(os, v); return os; }
template<class T> ostream& operator<<(ostream& os, const set<T>& v) { print_collection(os, v); return os; }
template<class T> ostream& operator<<(ostream& os, const multiset<T>& v) { print_collection(os, v); return os; }
template<class K, class V> ostream& operator<<(ostream& os, const map<K, V>& v) { print_collection(os, v); return os; }
template<class T, size_t N> ostream& operator<<(ostream& os, const array<T, N>& v) { print_collection(os, v); return os; }
#define dbg(x) cerr << #x << " = " << (x) << '\n'

using ll = long long;
constexpr int INF = 1'000'000'000; // 1e9
constexpr ll LINF = 1'000'000'000'000'000'000LL; // 1e18
constexpr int MOD = 1'000'000'007; // 1e9 + 7

inline ll add(ll a, ll b) { return (a + b) % MOD; }
inline ll sub(ll a, ll b) { return ((a - b) % MOD + MOD) % MOD; }
inline ll mul(ll a, ll b) { return (a * b) % MOD; }

#define P(i) get<0>(x[i])
#define R(i) get<1>(x[i])
#define A(i) get<2>(x[i])
#define F(i) get<3>(x[i])


void solve() {
    int N;
    cin >> N;

    // P (happy), R (min), A (total red), F (frac red)
    vector<tuple<double, double, int, int>> x(N);
    for(int i=0;i<N;++i) {
        cin >> get<0>(x[i]) >> get<1>(x[i]) >> get<2>(x[i]) >> get<3>(x[i]);
    }
    
    double min = INF;

    for(int i = 0; i < 1<<N+1; i++) {
        if(__builtin_popcount(i)>(N+1)/2) continue;
        int p = 0;
        double currentR = R(N-1);
        if(i & (1<<N) > 0) currentR = P(N-1);
        if(currentR >= P(N-1)) p++;
        for(int j = N-2; j>=0; j--) {
            currentR = max(R(j), (100 * (currentR + A(j))) / (100-F(j)));
            if(i & (1 << j) > 0) currentR = max(P(j), currentR);
            if(currentR >= P(j)) p++;
        }
        if(p>=(N+1)/2 && currentR < min) min = currentR;
    }

    cout << min << endl;
    cout << ceil(min);
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    solve();

    return 0;
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER