# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
839610 | 2023-08-30T10:41:21 Z | Dzadzo | Kpart (eJOI21_kpart) | C++11 | 2000 ms | 5008 KB |
#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #define pb push_back #define S second #define F first #define pii pair<int,int> #define vi vector <int> #define vvi vector <vi> #define vvvi vector <vvi> #define INF LLONG_MAX #define MOD 1000000009 #define MAXN 100000 using namespace std; using namespace __gnu_pbds; int32_t main() { int t; scanf("%d",&t); while (t--){ int n; scanf("%d",&n); int a[n+1]; int p[n+1]; p[0]=0; for (int i=1;i<=n;i++){scanf("%d",&a[i]);p[i]=p[i-1]+a[i];} bitset<100001>b[n]; for (int i=1;i<n;i++)b[i][0]=1; for (int i=1;i<n;i++){ b[i] |= (b[i]<<a[i]); } vi ans; for (int k=2;k<=n;k++){ bool check=true; for (int i=k;i<=n;i++){ b[i-k+1] |= (b[i-k+1]<<a[i]); if ((p[i]-p[i-k])%2!=0){check=false;}else if (!b[i-k+1][(p[i]-p[i-k])/2])check=false; } if (check)ans.pb(k); } printf("%lu",ans.size()); for (int x:ans)printf(" %d",x); printf("\n"); } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 11 ms | 596 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 70 ms | 1128 KB | Output is correct |
2 | Correct | 300 ms | 1776 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1145 ms | 3436 KB | Output is correct |
2 | Execution timed out | 2045 ms | 5008 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |