oj.uz

답안 #889374

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
889374 2023-12-19T14:24:19 Z Nelt Kpart (eJOI21_kpart) C++17
100 / 100
 1382 ms 1568 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma,popcnt")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

/* DEFINES */
#define S second
#define F first
#define ll long long
#define ull unsigned long long
#define ld long double
#define npos ULLONG_MAX
#define INF LLONG_MAX
#define vv(a) vector<a>
#define pp(a, b) pair<a, b>
#define pq(a) priority_queue<a>
#define qq(a) queue<a>
#define ss(a) set<a>
#define mm(a, b) map<a, b>
#define ump(a, b) unordered_map<a, b>
#define ANDROID                   \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);
#define elif else if
#define endl "\n"
#define allc(a) begin(a), end(a)
#define all(a) a, a + sizeof(a) / sizeof(a[0])
#define pb push_back
#define logi(a) __lg(a)
#define sqrt(a) sqrtl(a)
#define mpr make_pair
#define ins insert
using namespace std;
using namespace __gnu_pbds;
using namespace __cxx11;
typedef char chr;
typedef basic_string<chr> str;
template <typename T, typename key = less<T>>
using ordered_set = tree<T, null_type, key, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll MAX = 1e5 + 5, N = 1005;
ll a[N];
ll dp[MAX];
bool can[N];
void solve()
{
    ll n;
    cin >> n;
    for (ll i = 1; i <= n; i++)
        cin >> a[i], can[i] = true;
    for (ll i = 0; i < MAX; i++)
        dp[i] = n + 1;
    dp[0] = n;
    for (ll i = n; i >= 1; i--)
    {
        for (ll j = MAX - a[i]; j >= 0; j--)
            dp[j + a[i]] = min(dp[j + a[i]], dp[j]);
        dp[0] = i - 1;
        for (ll j = i, sum = 0; j <= n; j++)
            sum += a[j], can[j - i + 1] &= !(sum & 1) and dp[sum >> 1] <= j;
    }
    vv(ll) ans;
    for (ll i = 1; i <= n; i++)
        if (can[i])
            ans.pb(i);
    cout << ans.size() << " ";
    for (ll i : ans)
        cout << i << " ";
    cout << endl;
}
/*

*/
int main()
{
    ANDROID
    // precomp();
    ll t = 1;
    cin >> t;
    for (ll i = 1; i <= t; i++)
        // cout << "Case #" << i << ": ",
        solve();
    cerr << "\nTime elapsed : " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms\n";
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 1112 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 81 ms 1116 KB Output is correct
2 Correct 156 ms 1112 KB Output is correct

Subtask #3
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 299 ms 1112 KB Output is correct
2 Correct 527 ms 1236 KB Output is correct
3 Correct 540 ms 1376 KB Output is correct
4 Correct 750 ms 1544 KB Output is correct
5 Correct 1101 ms 1312 KB Output is correct
6 Correct 1382 ms 1564 KB Output is correct
7 Correct 1255 ms 1568 KB Output is correct