wtf is this

I think there's a typo. "sponser" should be "sponsor"

Which extension are u using?

AI Beat Contest

But then the answer will be more than 2^63.

Your DP table is undersized. you declared it as vector<vector>(1<<8, vector(5000, -1.0)) but since x can be up to 5000 you end up indexing dp[...][5000] on a vector that only goes 0–4999, Just size the second dimension to X+1 so it covers 0 through X inclusive.

Second, you never guard against overspending: you compute

double cand = p*(s + solve(nxt, x-c)) + (1-p)*solve(his, x-c);

even when c > x. Both calls then see a negative budgete and return 0 giving you an illegal “free” gain of p * s To fix it : before recursing skip any problem you can’t afford:

if (c > x) continue;

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

#define int long long
#define pb push_back
#define all(v) v.begin(), v.end()
#define sz(v) ((int)(v).size())
#define pii pair<int, int>
#define vi vector<int>
#define vpii vector<pii>
#define F first
#define S second
#define endl '\n'

const int MOD = 1e9 + 7;
const int INF = 1e18;

int n, X;
vector<vector<double>> dp;
vector<vector<int>> v;

double dfs(int mask, int rem) {
    if (rem == 0) return 0.0;
    if (dp[mask][rem] > -0.5)return dp[mask][rem];

    double ans = 0;
    for (int i = 0; i < n; i++) {
        if (mask & (1<<i)) continue;
        int c = v[i][1];
        if (c > rem) continue;      
        double p = v[i][2] / 100.0;
        double s = v[i][0];
        int nxt = mask |(1<<i);

        double take = p * (s + dfs(nxt, rem - c)) + (1 - p) *dfs(mask, rem - c);
        ans = max(ans, take);
    }

    return dp[mask][rem] = ans;
}

void solve() {
    cin >> n >> X;
    v.assign(n, vector<int>(3));
    for (int i = 0; i < n; i++)
        cin >> v[i][0]>> v[i][1] >> v[i][2];

    dp.assign(1<<n, vector<double>(X+1, -1.0));
    for (int mask = 0; mask < (1<<n); mask++)
        dp[mask][0] = 0.0;

    cout << fixed << setprecision(10)
         << dfs(0, X) << endl;
}

int32_t main() {

    int t = 1;
    while (t--) solve();
    return 0;
}

Delete the 31st line.

Consider 5 points in circle. Line (2, 5) and (3, 4) are parallel.