Submission #1107519

#	Time	Username	Problem	Language	Result	Execution time	Memory
1107519		vjudge1	Kpart (eJOI21_kpart)	C++17	0 / 100	416 ms	6616 KiB

Main

#include <bits/stdc++.h>
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define ff first
#define int long long
#define ss second
#define pb push_back
#define y1 zildjian

using namespace std;

const int N = 3e6+100;
const int INF = 1e18;
const int mod = 1e9+7;
const int dx[] = {-1,-1,0,1,1,1,0,-1,0};
const int dy[] = {0,1,1,1,0,-1,-1,-1,0};
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

int binpow (int a, int n){
	if (n == 0)
		return 1;
	if (n % 2 == 1)
		return (binpow (a, n-1)%mod * a%mod)%mod;
	else {
		int b = binpow (a, n/2) % mod;
		return (b%mod * b%mod)%mod;
	}
}

int n;
int a[N];
int cnt[N];
int dp[N];
int pref[N];

void solve(){
    cin>>n;
    for(int i = 1;i<=n;i++){
        cin>>a[i];
        cnt[i] = 0;
        pref[i] = pref[i-1]+a[i];
    }
    dp[0] = 1;
    for(int i = 1;i<=n;i++){
        for(int k = a[i];k<=1e5;k++){
            if(dp[k-a[i]]){
                dp[k] = max(dp[k],dp[k-a[i]]);
            }
        }
        dp[a[i]] = i;
        for(int k = 2;i-k+1>=1;k++){
            int s = pref[i]-pref[i-k];
            if(s%2 == 0 && dp[s/2] > i-k){
                cnt[k]++;
            }
        }
    }
    vector<int> ans;
    for(int i = 1;i<=n;i++) if(cnt[i] == (n-i+1)) ans.pb(i);
    cout<<ans.size()<<' ';
    for(auto x:ans) cout<<x<<' ';
    cout<<'\n';
}   

signed main(){
    // freopen("floyd.in","r",stdin); 
    // freopen("floyd.out","w",stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(nullptr);
    // cout.tie(nullptr);
    int T = 1;
    cin>>T;
    for(int i = 1;i<=T;i++){
        // cout<<"Case "<<i<<": ";
        solve();
    }
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 20
• Subtask 3: 0 / 70