/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Accepted 3ms 532.0 KiB
#3 Accepted 3ms 580.0 KiB
#4 Accepted 3ms 532.0 KiB
#5 Accepted 2ms 532.0 KiB
#6 Accepted 5ms 764.0 KiB
#7 Accepted 58ms 576.0 KiB
#8 Accepted 4ms 536.0 KiB
#9 Accepted 32ms 576.0 KiB
#10 Accepted 50ms 532.0 KiB

Code

#include<numeric>
#include<random>
#include <iostream>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <cassert>
#include <chrono>
#include <iomanip>
#include <set>
#include <map>
#include <string>
#include <complex>
#include<vector>
#include<unordered_map>
#include<unordered_set>
#include<cmath>

#ifdef __GNUC__
#pragma GCC target ("avx2")
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#endif
using namespace std;
using ll = int64_t;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using namespace std;
bool c = 1;
inline ll msb(ll x) {
    if (!x)
        return -1;
#ifdef _MSC_VER
    unsigned long ret;
    _BitScanReverse64(&ret, x);
    return ret;
#endif
#ifdef __GNUC__
    int ret = 63 - __builtin_clzll(x);
    return ret;
#endif
    return 0;
}

void nine11(int tst) {
    bitset<50005> dp;
    dp[0] = 1;
    int n; cin >> n;
    for (int i = 0; i < n; i++) {
        int x; cin >> x;
        if (x > n)continue;
        dp |= dp << x;
    }
    int ans = 0;
    for (int i = 0; i <= n; i++)
        if (dp[i])ans = i;
    cout << ans << '\n';
}
signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    int t = 1; cin >> t;
    for (int i = 1; i <= t && c; i++) {
        nine11(i);
    }
    cout.flush();
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1234 E. Roy and Maximum Removals
Contest
Happy New Year 2026
Language
C++17 (G++ 13.2.0)
Submit At
2026-01-06 14:50:28
Judged At
2026-01-06 14:50:28
Judged By
Score
100
Total Time
58ms
Peak Memory
764.0 KiB