oj.uz

Submission #519808

# Submission time Handle Problem Language Result Execution time Memory
519808 2022-01-27T11:10:55 Z Carmel_Ab1 Kpart (eJOI21_kpart) C++17
0 / 100
 939 ms 2008 KB 
/*
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
 */
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;
using namespace std;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int>vi;
typedef vector<vector<int>>vvi;
typedef vector<ll>vl;
typedef vector<vl> vvl;
typedef pair<int,int>pi;
typedef pair<ll,ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld,ld> pld;
typedef vector<pi> vpi;

//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T> ostream& operator<<(ostream& os, vector<T>& a){os<<"[";for(int i=0; i<ll(a.size()); i++){os << a[i] << ((i!=ll(a.size()-1)?" ":""));}os << "]\n"; return os;}

#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define outfl(x){cout << x << endl;return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map

template<typename T1, typename T2> istream& operator>>(istream& is, pair<T1, T2>& p){is >> p.first >> p.second;return is;}
template<typename T1, typename T2> ostream& operator<<(ostream& os, pair<T1, T2>& p){os <<"" << p.first << " " << p.second << ""; return os;}
void usaco(string taskname){
    string fin = taskname + ".in";
    string fout = taskname + ".out";
    const char* FIN = fin.c_str();
    const char* FOUT = fout.c_str();
    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);
}
template<typename T>
void read(vector<T>& v){
    int n=v.size();
    for(int i=0; i<n; i++)
        cin >> v[i];
}
template<typename T>
vector<T>UNQ(vector<T>a){
    vector<T>ans;
    for(T t:a)
        if(ans.empty() || t!=ans.back())
            ans.push_back(t);
    return ans;
}



void solve();
int main(){
    GLHF;
    int t=1;
    cin >> t;
    while(t--)
        solve();
}



void solve() {
    int n;
    cin >> n;
    vi a(n);
    read(a);

    vi ans;

    const int mx=(5e4),mod=1e9+7;
    vector<bitset<mx+1>>dp(n);
    dp[0][0]=dp[0][a[0]]=1;

    for(int i=1; i<n; i++)
        dp[i]=dp[i-1]|(dp[i-1]<<a[i]);

    for(int k=2; k<=n; k++){
        int sum=0;
        for(int i=0; i<k; i++)
            sum+=a[i];

        bool ok=1;
        for(int i=k; i<=n; i++){
            if(sum%2 || !(dp[i-1]&dp[i-k+1]<<(sum/2)).count())
                ok=0;
            if(i==n || !ok)break;
            sum+=a[i];
            sum-=a[i-k];
        }
        if(ok)
            ans.pb(k);
    }


    cout << ans.size() << " ";
    print(ans)
}
/*
 2
7
7 3 5 1 3 3 5
6
1 2 3 5 8 3
 */

Compilation message

Main.cpp: In function 'void solve()':
Main.cpp:86:24: warning: unused variable 'mod' [-Wunused-variable]
   86 |     const int mx=(5e4),mod=1e9+7;
      |                        ^~~
Main.cpp: In function 'void usaco(std::string)':
Main.cpp:47:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |     freopen(FIN, "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~
Main.cpp:48:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |     freopen(FOUT, "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

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

Subtask #2
0 / 20.0

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

Subtask #3
0 / 70.0

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