# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1089974 | 2024-09-17T12:57:00 Z | vjudge1 | Kpart (eJOI21_kpart) | C++17 | 1034 ms | 2032 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") // #pragma GCC optimize("-funsafe-loop-optimizations") #pragma GCC optimize("-funroll-loops") // #pragma GCC optimize("-fwhole-program") #pragma GCC optimize("Ofast,no-stack-protector") #pragma GCC optimize("-fthread-jumps") #pragma GCC optimize("-falign-functions") #pragma GCC optimize("-falign-jumps") #pragma GCC optimize("-falign-loops") #pragma GCC optimize("-falign-labels") #pragma GCC optimize("-fcaller-saves") #pragma GCC optimize("-fcrossjumping") #pragma GCC optimize("-fcse-follow-jumps") // #pragma GCC optimize("-fcse-skip-blocks") #pragma GCC optimize("-fdelete-null-pointer-checks") #pragma GCC optimize("-fdevirtualize") #pragma GCC optimize("-fexpensive-optimizations") #pragma GCC optimize("-fgcse") #pragma GCC optimize("-fgcse-lm") #pragma GCC optimize("-fhoist-adjacent-loads") #pragma GCC optimize("-finline-small-functions") #pragma GCC optimize("-findirect-inlining") #pragma GCC optimize("-fipa-sra") #pragma GCC optimize("-foptimize-sibling-calls") #pragma GCC optimize("-fpartial-inlining") #pragma GCC optimize("-fpeephole2") #pragma GCC optimize("-freorder-blocks") #pragma GCC optimize("-freorder-functions") #pragma GCC optimize("-frerun-cse-after-loop") #pragma GCC optimize("-fsched-interblock") #pragma GCC optimize("-fsched-spec") #pragma GCC optimize("-fschedule-insns") #pragma GCC optimize("-fschedule-insns2") #pragma GCC optimize("-fstrict-aliasing") // #pragma GCC optimize("-fstrict-overflow") #pragma GCC optimize("-ftree-switch-conversion") #pragma GCC optimize("-ftree-tail-merge") #pragma GCC optimize("-ftree-pre") #pragma GCC optimize("-ftree-vrp") #pragma GCC target("avx") 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); int t; cin >> t; while (t --> 0) { int n; cin >> n; vector<int> a(n); for (auto &x : a) cin >> x; vector<int> valid(n + 1, 1); const int N = 1e5 + 3; int dp[N], pref[N]; for (int i = 0; i <= n; i++) pref[i] = dp[i] = 0; pref[0] = 0; for (int i = 1; i <= n; i++) { pref[i] = pref[i - 1] + a[i - 1]; } for (int i = 0; i <= pref[n]; i++) dp[i] = 0; for (int i = 1; i <= n; i++) { for (int j = pref[n]; j >= a[i - 1]; j--) { dp[j] = max(dp[j], dp[j - a[i - 1]]); } dp[a[i - 1]] = i; for (int j = 1; j <= i - 1; j++) { int sum = pref[i] - pref[j - 1]; if (sum % 2 != 0 || dp[sum / 2] < j)/* cout << i - j + 1 << ' ', */valid[i - j + 1] = 0; } } vector<int> ans; for (int i = 2; i <= n; i++) if (valid[i]) ans.push_back(i); cout << ans.size() << ' '; for (auto to : ans) cout << to << ' '; cout << endl; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 1880 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 1880 KB | Output is correct |
2 | Correct | 15 ms | 1884 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 55 ms | 1884 KB | Output is correct |
2 | Correct | 151 ms | 2024 KB | Output is correct |
3 | Correct | 174 ms | 1880 KB | Output is correct |
4 | Correct | 316 ms | 1884 KB | Output is correct |
5 | Correct | 729 ms | 2032 KB | Output is correct |
6 | Correct | 1034 ms | 2028 KB | Output is correct |
7 | Correct | 919 ms | 1884 KB | Output is correct |