oj.uz

답안 #978853

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
978853 2024-05-09T19:41:50 Z VMaksimoski008 Kpart (eJOI21_kpart) C++17
30 / 100
 2000 ms 484 KB 
#include <bits/stdc++.h>

#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

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

    vector<int> v(n+1);
    for(int i=1; i<=n; i++) cin >> v[i];
       
    vector<bool> ans(n+1, 1);
    for(int i=1; i<=n; i++) {
        bitset<100001> bs;
        bs[0] = 1;
        ll sum = 0;
        for(int j=i; j<=n; j++) {
            sum += v[j];
            bs |= (bs << v[j]);
            
            if(sum % 2 == 1 || !ans[j-i+1]) {
                ans[j-i+1] = 0;
                continue;
            }

            if(!bs[sum/2]) ans[j-i+1] = 0;
        }
    }

    vector<int> res;
    for(int i=1; i<=n; i++) if(ans[i]) res.push_back(i);
    cout << res.size() << " ";
    for(int &x : res) cout << x << " ";
    cout << '\n';
}

int32_t main() {
    int t = 1; cin >> t;
    while(t--) solve();

    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 90 ms 348 KB Output is correct
2 Correct 287 ms 440 KB Output is correct

Subtask #3
0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1201 ms 452 KB Output is correct
2 Execution timed out 2032 ms 484 KB Time limit exceeded
3 Halted 0 ms 0 KB -