oj.uz

답안 #1107284

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1107284 2024-11-01T05:43:12 Z vjudge1 Kpart (eJOI21_kpart) C++17
10 / 100
 2000 ms 476 KB 
/**
 *    hello
 *    author:  N29
 *    created: 2024-11-01 10:28:15
**/
#include<bits/stdc++.h>
using namespace std;
#ifndef BADGNU
#pragma GCC target("sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#endif
#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp> 
using namespace __gnu_pbds;
#define ll long long
#define int ll
#define ld long double
#define y1 cheza
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T> using ordered_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
template<class T> using ordered_multiset = tree<T,null_type,less_equal<T>,rb_tree_tag,tree_order_statistics_node_update>;
const int N=1e5+100;
const int M=5001;
const int B=447;
const int mod=998244353;
const ll INF=1e18;
const int dx[]={1,-1,0,0};
const int dy[]={0,0,1,-1};
const double eps=1e-6;
int n;
int a[N];
int pref[N];
bitset<N> dp;
bool check(int l,int r){
    int sum=pref[r]-pref[l-1];
    if(sum%2)return 0;
    sum/=2;
    for(int j=0;j<=sum;j++){
        dp[j]=0;
    }
    dp[0]=1;
    for(int i=l;i<=r;i++){
        for(int j=sum-a[i];j>=0;j--){
            dp[j+a[i]]=dp[j+a[i]]|dp[j];
        }
    } 
    return dp[sum];
}
void test(){
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    for(int i=1;i<=n;i++){
        pref[i]=pref[i-1]+a[i];
    }
    vector<int>v;
    for(int k=2;k<=n;k++){
        v.push_back(k);
        for(int i=1;i+k-1<=n;i++){
            int j=i+k-1;
            if(!check(i,j)){
                v.pop_back();
                break;
            }
        }
    }
    cout<<v.size()<<' ';
    for(auto i:v){
        cout<<i<<' ';
    }
    cout<<'\n';
    
}



/*

*/
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    // cout.tie(nullptr);
    int t2=1;
    cin>>t2;
    for(int i=1;i<=t2;i++){
        test();
    }
}

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 910 ms 476 KB Output is correct
2 Execution timed out 2048 ms 336 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2060 ms 336 KB Time limit exceeded
2 Halted 0 ms 0 KB -