Language: C++

#include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <chrono>
#include <random>

#include <cstring>

using namespace std;

using ll = int64_t;
ll const MM = 1000000007;

#define pv(val) cerr << #val << '=' << (val) << endl
#define pl cerr << '@' << __LINE__ << endl

#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, b, e) for (ll i = (b); i < (e); i++)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()

template <class T>
ostream& operator<<(ostream& os, vector<T> const& vec);
template <class T, size_t S>
ostream& operator<<(ostream& os, array<T, S> const& arr);
template<class T, class U>
ostream& operator<<(ostream& os, pair<T, U> const& p);
template<class... Args>
ostream& operator<<(ostream& os, tuple<Args...> const& t);

template <class T>
ostream& operator<<(ostream& os, vector<T> const& vec) {
    if (vec.empty()) {
        os << "{}";
    } else {
        os << '{';
        for (size_t i = 0; i < vec.size() - 1; i++) os << vec[i] << ", ";
        os << vec.back() << '}';
    }
    return os;
}

template <class T, size_t S>
ostream& operator<<(ostream& os, array<T, S> const& arr) {
    if (arr.empty()) {
        os << "{}";
    } else {
        os << '{';
        for (size_t i = 0; i < arr.size() - 1; i++) os << arr[i] << ", ";
        os << arr.back() << '}';
    }
    return os;
}

template<class T, class U>
ostream& operator<<(ostream& os, pair<T, U> const& p) {
    os << '(' << p.first << ", " << p.second << ')';
    return os;
}

template<size_t I, class... Args>
typename enable_if<sizeof...(Args) == (I + 1)>::type print_tuple(ostream& os, tuple<Args...> const& t) {
    os << get<I>(t);
}
template<size_t I, class... Args>
typename enable_if<sizeof...(Args) != (I + 1)>::type print_tuple(ostream& os, tuple<Args...> const& t) {
    os << get<I>(t) << ", ";
    print_tuple<I + 1, Args...>(os, t);
}

template<class... Args>
ostream& operator<<(ostream& os, tuple<Args...> const& t) {
    os << '(';
    print_tuple<0, Args...>(os, t);
    os << ')';

    return os;
}

namespace math {
    ll gcd(ll u, ll v) {
        while (v != 0) {
            ll r = u % v;
            u = v;
            v = r;
        }
        return u;
    }
    ll lcm(ll m, ll n) {
        if ((0 == m) || (0 == n)) return 0;

        return ((m / math::gcd(m, n)) * n);
    }

    vector<ll> divisor(ll n) {
        vector<ll> ret;
        for (ll i = 1; i * i <= n; i++) {
            if (n % i == 0) {
                ret.push_back(i);
                if (i * i != n) ret.push_back(n / i);
            }
        }
        sort(begin(ret), end(ret));
        return ret;
    }

    set<ll> divisor_set(ll n) {
        set<ll> ret;
        for (ll i = 1; i * i <= n; i++) {
            if (n % i == 0) {
                ret.insert(i);
                if (i * i != n) ret.insert(n / i);
            }
        }
        return ret;
    }

    // https://qiita.com/ofutonfuton/items/92b1a6f4a7775f00b6ae
    struct Combination {
        vector<ll> fac;
        vector<ll> ifac;

        Combination() :
            fac(300001),
            ifac(300001)
        {
            fac[0] = 1;
            ifac[0] = 1;
            for (ll i = 0; i < 300000; i++) {
                fac[i + 1] = fac[i] * (i + 1) % MM;
                ifac[i + 1] = ifac[i] * this->mpow(i + 1, MM - 2) % MM;
            }
        }

        static ll mpow(ll x, ll n) {
            ll ans = 1;
            while (n != 0) {
                if (n & 1) ans = ans * x % MM;
                x = x * x % MM;
                n = n >> 1;
            }
            return ans;
        }

        ll operator()(ll a, ll b) const {
            return this->comb(a, b);
        }

        ll comb(ll a, ll b) const {
            if (a == 0 && b == 0)return 1;
            if (a < b || a < 0 || b < 0)return 0;
            ll const tmp = ifac[a - b] * ifac[b] % MM;
            return tmp * fac[a] % MM;
        }

    } comb;

}  // namespace math

struct UnionFind {
    vector<ll> data;
    UnionFind(ll size) : data(size, -1) {}
    bool unionSet(ll x, ll y) {
        x = root(x);
        y = root(y);
        if (x != y) {
            if (data[y] < data[x]) swap(x, y);
            data[x] += data[y];
            data[y] = x;
        }
        return x != y;
    }
    bool findSet(ll x, ll y) { return root(x) == root(y); }
    ll root(ll x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
    ll size(ll x) { return -data[root(x)]; }
};

ll bound(function<bool(ll)> f, ll ng, ll ok) {
    while (abs(ng - ok) > 1) {
        ll mid = (ng + ok) / 2;
        if (f(mid))
            ok = mid;
        else
            ng = mid;
    }

    return ok;
}

template<class T>
T read() {
    T t;
    cin >> t;

    return t;
}


const ll MAX_N = 1000; // nの最大値
const ll MAX_W = 5000; // Wの最大値

ll n, W;
ll w[MAX_N], v[MAX_N];

ll dp[MAX_N + 1][MAX_W + 1];

ll rec_dp(ll i, ll j) {
  if (dp[i][j] != -1) {
    return dp[i][j];
  }
  ll res;
  if (i == n) {
    res = 0;
  } else if (j < w[i]) {
    res = rec_dp(i + 1, j);
  } else {
    res = max(
        rec_dp(i + 1, j),
        rec_dp(i + 1, j - w[i]) + v[i]
    );
  }
  return dp[i][j] = res;
}

ll solve_dp() {
  memset(dp, -1, sizeof(dp));
  return rec_dp(0, W);
}

class Timer {
  using clock = chrono::high_resolution_clock;
  clock::time_point startTime;
 
  template <class T>
  auto elapsed() const {
    return chrono::duration_cast<T>(clock::now() - startTime).count();
  }
 
public:
  Timer() { restart(); }
 
  void restart() { startTime = clock::now(); }
 
  auto milli() const { return elapsed<chrono::milliseconds>(); }
 
  auto micro() const { return elapsed<chrono::microseconds>(); }
};
 
Timer globalTimer;

int main(void) {
    cout << setprecision(10);

    ll n;
    cin >> n;
    vector<ll> x(n), y(n);

    rep(i, n)
        cin >> x[i] >> y[i];

    vector<bool> ans(n, false);
    ll score = 0;
    ll bestscore = 0;
    ll X = 0, Y = 0;
    double temp = 10.0;

    uniform_real_distribution<double> dist01(0.0, 1.0);
    mt19937 mtGen;

    while(true) {
        if (globalTimer.milli() > 1750)
            break;
        rep(i, n) {
            ll nX = X, nY = Y;
            if (ans[i]) {
                nX -= x[i];
                nY -= y[i];
            } else {
                nX += x[i];
                nY += y[i];
            }
            ll nScore = nX * nX + nY * nY;
            if (nScore > score|| exp ((nScore - score) / temp) > dist01(mtGen) {
                score = nScore;
                X = nX;
                Y = nY;
                ans[i] = !ans[i];
            }
            if (score > bestscore
                ) {
                bestscore = score;
            }
        }
        temp *= 0.995;
    }

    cout << sqrt(bestscore) << endl;

    return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:297:79: error: expected ')' before '{' token
  297 |             if (nScore > score|| exp ((nScore - score) / temp) > dist01(mtGen) {
      |                ~                                                              ^~
      |                                                                               )
a.cc:307:9: error: expected primary-expression before '}' token
  307 |         }
      |         ^