oj.uz

답안 #978856

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
978856 2024-05-09T19:46:22 Z VMaksimoski008 Kpart (eJOI21_kpart) C++17
30 / 100
 2000 ms 716 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,bmi,bmi2,lzcnt,popcnt")

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<50001> 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';
}

int main() {
    ios_base::sync_with_stdio(false);
    cout.tie(0); cin.tie(0);

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

    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 348 KB Output is correct
2 Correct 75 ms 452 KB Output is correct

Subtask #3
0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 338 ms 344 KB Output is correct
2 Correct 862 ms 344 KB Output is correct
3 Correct 992 ms 704 KB Output is correct
4 Correct 1808 ms 716 KB Output is correct
5 Execution timed out 2054 ms 348 KB Time limit exceeded
6 Halted 0 ms 0 KB -