oj.uz

Submission #1107478

# Submission time Handle Problem Language Result Execution time Memory
1107478 2024-11-01T09:28:57 Z vjudge1 Kpart (eJOI21_kpart) C++17
0 / 100
 1167 ms 504 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define nn "\n";
#define pb push_back
#define all(v) (v).begin() , (v).end()
const int N = 2e4+ 4;
int n , T , q , m ;
signed main(){
    ios_base::sync_with_stdio(0) , cin.tie(0);
    cin>> T;
    while(T--){
        cin>> n ;
        int a[n+1];
        set<int>st;
        for(int i=1 ; i <= n; i++){
            cin>> a[i];
        }
        map<int , int >us;
        for(int i =1 ; i < n ; i++){
            for(int j = i+1 ; j <= n;  j++){
                      vector<int>v;
                      int sum =0 ;
                for(int u = i ; u <= j ; u++){
                    v.pb(a[u]);
                    sum+=a[u];
                }
                int x = sum/2;
                sort(all(v));
                int ans =0 ;
                for(int i=  v.size() - 1 ; i >=  0 ; i--){
                    if(ans + v[i] <= x ){
                        ans+=v[i];
                    }
                    if(ans==x)break;
                }
                if(ans == x && sum - x ==x  ){
                    us[v.size()]++;
                }
            }
        }
        vector<int>way;
        for(int i =1 ;i <= n ; i++){
            if(us[i]== n - i + 1 ){
                way.pb(i);
            }
        }
        cout << way.size()<< ' ';
        for(auto it:way)cout <<it << ' ';
        cout << nn
    }
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 336 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 18 ms 504 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 1167 ms 336 KB Output isn't correct
2 Halted 0 ms 0 KB -