Submission #1201783

#	Time	Username	Problem	Language	Result	Execution time	Memory
1201783		asli_bg	Kpart (eJOI21_kpart)	C++20	100 / 100	614 ms	920 KiB

Main

#include <bits/stdc++.h>
using namespace std;
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;

#define int long long
 
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<bool> vb;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<pll> vll;
 
typedef tree<pii,null_type,less<pii>,rb_tree_tag,
tree_order_statistics_node_update> oset;
 
#define fi first
#define se second
#define pb push_back
#define pf push_front
 
#define mid (l+r)/2
#define all(x) x.begin(),x.end()
#define FOR(i,a) for(int i=0;i<(a);i++)
#define FORE(i,a,b) for(int i=(a);i<(b);i++)
 
#define cont(x) for(auto el:x) cout<<el<<' ';cout<<endl;
#define contp(x) for(auto el:x) cout<<el.fi<<'-'<<el.se<<' ';cout<<endl;
#define sp <<" "<<
 
#define DEBUG(x) cout<<(#x) sp x<<endl
#define carp(a,b) (((a%MOD)*(b%MOD))%MOD)
#define topla(a,b) (((a%MOD)+(b%MOD))%MOD)
 
const ll INF=1e18;
const int MAXN=5e4+5;
const int MOD=1e9+7;

int pos[MAXN];

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

    int t;
    cin>>t;
    while(t--){
        memset(pos,-1,sizeof pos);
        int n;
        cin>>n;
        vi a(n+1);
        FORE(i,1,n+1) cin>>a[i];

        set<int> ans;
        FORE(i,1,n+1) ans.insert(i);

        pos[0]=0;
        set<int> sil;
        FORE(i,1,n+1){
            for(int top=MAXN-1;top>=0;top--){
                if(top+a[i]>=MAXN) continue;
                pos[top+a[i]]=max(pos[top+a[i]],pos[top]);
                //cout<<"here" sp top+a[i] sp pos[top+a[i]]<<endl;
            }

            pos[a[i]]=i;

            int once=0;
            int sum=0;
            for(auto el:ans){
                if(el>i) break;

                while(once<el){
                    sum+=a[i-once];
                    once++;
                }

                if(sum%2!=0 or pos[sum/2]<i-el+1){
                    sil.insert(el);
                }
            }

            for(auto el:sil) ans.erase(el);
            sil.clear();

            //cont(ans);
        }

        cout<<ans.size()<<' ';
        cont(ans);
    }
}

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