oj.uz

답안 #914195

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
914195 2024-01-21T10:43:14 Z PieArmy Kpart (eJOI21_kpart) C++17
100 / 100
 865 ms 1112 KB 
    #include <bits/stdc++.h>
    using namespace std;
     
    int main(){
        ios_base::sync_with_stdio(false);cin.tie(NULL);
        int t;cin>>t;
        while(t--){
            int n;cin>>n;
            int arr[n];
            int pref[n+1];pref[0]=0;
            for(int i=0;i<n;i++){cin>>arr[i];pref[i+1]=pref[i]+arr[i];}
            vector<int>dp(100001,-1);
            vector<int>nex(n+1,-1);
            for(int i=0;i<n;i++){
                for(int j=pref[i+1];j>=arr[i];j--){
                    dp[j]=max(dp[j],dp[j-arr[i]]);
                }
                dp[arr[i]]=i;
                int las=0,pos=nex[0];
                while(pos!=-1){
                    int sum=pref[i+1]-pref[i+1-pos];
                    if((sum&1)||dp[sum>>1]<=i+1-pos){nex[las]=nex[pos];}
                    else las=pos;
                    pos=nex[pos];
                }
                if((pref[i+1]&1)==0&&dp[pref[i+1]>>1]!=-1)nex[las]=i+1;
            }
            vector<int>ans;
            int pos=nex[0];
            while(pos!=-1){ans.push_back(pos);pos=nex[pos];}
            cout<<ans.size();
            for(int x:ans)cout<<" "<<x;
            cout<<'\n';
        }
        return 0;
    }

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 856 KB Output is correct
2 Correct 12 ms 872 KB Output is correct

Subtask #3
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 860 KB Output is correct
2 Correct 130 ms 860 KB Output is correct
3 Correct 145 ms 860 KB Output is correct
4 Correct 265 ms 884 KB Output is correct
5 Correct 611 ms 964 KB Output is correct
6 Correct 865 ms 956 KB Output is correct
7 Correct 768 ms 1112 KB Output is correct