oj.uz

Submission #559471

# Submission time Handle Problem Language Result Execution time Memory
559471 2022-05-09T23:41:30 Z illyakr Kpart (eJOI21_kpart) C++14
10 / 100
 2000 ms 680 KB 
//#pragma GCC optimize("inline,Ofast,no-stack-protector,unroll-loops,fast-math,O3")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4.1,sse4.2,popcnt,avx,abm")
#include <bits/stdc++.h>
#define ll long long
#define int ll
typedef long double ld;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define y0 dfgoert
#define y1 kjsjofd
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int mod = 1000000007;
const int INF1e9 = 1010101010;
const int INF1e18 = 1010101010101010101;
const ld PI =  3.14159265358979323846264338327950288419716939937510;

int n;
int a[101010];
bitset<1000001> id;
bitset<1000001> chk;
bool can[101010];
void solve() {
    cin >> n;
    for (int i = 1; i <= n; i++)cin >> a[i];
    for (int i = 1; i <= n; i++)can[i] = true;
    vector<int> ans;
    for (int i = 1; i <= n; i++) {
        id = 0;
        id[0] = 1;
        int sum = 0;
        for (int j = i; j <= n; j++) {
            id |= (id << a[j]);
            sum += a[j];
            if (sum % 2 != 0) {can[j - i + 1] = false;continue;}
            if (!id[sum / 2]) {can[j - i + 1] = false;continue;}
        }
    }
    for (int i = 1; i <= n; i++) {
        if (!can[i])continue;
        ans.push_back(i);
    }
    cout << ans.size();
    for (int i : ans)cout << " " << i;
    cout << '\n';
    return;

//    for (int k = 1; k <= n; k++) {
//        id = 0;
//        id[0] = 1;
//        bool ok = true;
//        int sum = 0;
//        cout << k << endl;
//        for (int i = 1; i <= n; i++) {
//            id |= (id << a[i]);
//            sum += a[i];
//            if (i - k >= 1){id &= (id >> a[i - k]);sum -= a[i - k];}
//            for (int p = 0; p <= 30; p++)
//                cout << id[p];
//            cout << endl;
//
//            if (i - k >= 0) {
//                chk = 0;
//                chk[0] = 1;
//                for (int j = i - k + 1; j <= i; j++)
//                    chk |= (chk << a[j]);
//                for (int p = 0; p <= 30; p++)
//                    cout << chk[p];
//                cout << endl << endl;
//                if (chk != id)exit(1);
//                if (sum % 2 != 0){ok = false;break;}
//                if (!id[sum / 2]){ok = false;break;}
//                continue;
//            }
//            cout << endl;
//        }
//        cout << endl;
//        if (ok)ans.push_back(k);
//    }
//    cout << ans.size() << " ";
//    for (int i : ans)cout << i << " ";
//    cout << '\n';
}

int32_t main() {
    fast
    int t = 1;
    cin >> t;
    for (int id = 1; id <= t; id++) {
//        cout << "Case " << id << ": ";
        solve();
    }
}
/**
6
2 3 5 1 8 3
*/

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 168 ms 596 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1130 ms 680 KB Output is correct
2 Execution timed out 2073 ms 596 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 70.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2092 ms 672 KB Time limit exceeded
2 Halted 0 ms 0 KB -