oj.uz

답안 #891206

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
891206 2023-12-22T11:44:06 Z sleepntsheep Kpart (eJOI21_kpart) C++17
100 / 100
 980 ms 900 KB 
#include <iostream>
#include <bitset>
#include <fstream>
#include <iomanip>
#include <cmath>
#include <cassert>
#include <cstring>
#include <numeric>
#include <vector>
#include <algorithm>
#include <deque>
#include <set>
#include <utility>
#include <array>
#include <complex>

using namespace std;
#define ALL(x) begin(x), end(x)
#define ShinLena cin.tie(nullptr)->sync_with_stdio(false);

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,tune=native")


void docase()
{
    int n;
    cin >> n;
    vector<int> a(n), dp(50005, -1);
    int c[1001] { 0 };
    for (auto &x : a) cin >> x;

    for (int sum = 0, i = 0; i < n; ++i)
    {
        sum += a[i];
        for (int j = 50000; j >= a[i]; --j)
        {
            if (j - a[i] >= 0 && dp[j - a[i]] != -1) dp[j] = max(dp[j], dp[j - a[i]]);
            else if (j - a[i] == 0) dp[j] = i + 1;
        }
        for (int sub = sum, j = 0; j <= i; ++j)
        {
            if (!(sub & 1) && dp[sub / 2] >= j + 1);
            else
                c[i-j+1] = 1;
            sub -= a[j];
        }
    }

    cout << n - accumulate(ALL(c), 0) << ' ';
    for (auto i = 1; i <= n; ++i)
        if (!c[i]) cout << i << ' ';


    cout << '\n';
}

int main()
{
    ShinLena;
    int T;
    cin >> T;
    while (T--) docase();
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 664 KB Output is correct
2 Correct 107 ms 664 KB Output is correct

Subtask #3
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 218 ms 604 KB Output is correct
2 Correct 368 ms 632 KB Output is correct
3 Correct 366 ms 600 KB Output is correct
4 Correct 521 ms 628 KB Output is correct
5 Correct 763 ms 900 KB Output is correct
6 Correct 980 ms 724 KB Output is correct
7 Correct 863 ms 900 KB Output is correct