oj.uz

답안 #1089338

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1089338 2024-09-16T10:12:34 Z vjudge1 Kpart (eJOI21_kpart) C++17
10 / 100
 2000 ms 1864 KB 
/**
 *    data : 09.07.2024  
 *     
**/
#include <bits/stdc++.h>
// #include "algo/turnikmen.h"

using namespace std;


#define int long long
#define bitt __builtin_popcountll
#define bitzero __builtin_clz

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

void fReopen () {
        #ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
        #endif
}


signed main (/*  time : 9:17 AM   */) {
        ios_base::sync_with_stdio(false);
        cin.tie(nullptr);
        cout.tie(nullptr);

      //  fReopen();

        int t; cin >> t;
        while (t --> 0) {
                int n; cin >> n;

                vector<int> a(n); for (auto &x : a) cin >> x;
                vector<int> pref(n + 1);
                vector<int> ans;
                for (int i = 0; i < n; i++) pref[i + 1] = pref[i] + a[i]; 
                for (int len = 2; len <= n; len++) {
                        int ok = 1;
                        const int N = 1e5 + 3;
                        vector<int> st(100002, -1);
                        set<int> d;
                        int mx = -2e9;
                        for (int i = 0; i + len <= n; i++) {
                                int sum = pref[i + len] - pref[i];
                                mx = max(mx, sum);
                                if (sum % 2 == 1) {
                                        ok = 0;
                                        break;
                                }
                                if (st[sum] == -1)
                                        st[sum] = i;

                        }
                        if (!ok) continue;
                        // cout << len << "  ";
                        for (int s = 0; s <= 100000; s++) {
                                if (st[s] == -1) continue;
                                // cout << s << ' ';
                                bitset<131072> dp;
                                // dp.reset();
                                dp[0] = 1;
                                for (int i = st[s];  i < st[s] + len; i++) {
                                        if (a[i] > s / 2) continue;
                                        // dp[i] = 1;
                                        dp |= (dp << a[i]);
                                }
                                // cout << dp << '\n';
                                ok &= (dp[s / 2] == 1);

                        }
                        // cout << endl;
                        if (ok) ans.push_back(len);
                }
                cout << ans.size() << ' ';
                for (auto to : ans) cout << to << ' ';
                cout << endl;
        }


}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:43:35: warning: unused variable 'N' [-Wunused-variable]
   43 |                         const int N = 1e5 + 3;
      |                                   ^
Main.cpp: In function 'void fReopen()':
Main.cpp:20:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |         freopen("input.txt", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:21:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |         freopen("output.txt", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 673 ms 1844 KB Output is correct
2 Execution timed out 2033 ms 1848 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2061 ms 1264 KB Time limit exceeded
2 Halted 0 ms 0 KB -