# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
642390 | 2022-09-19T10:46:16 Z | manizare | Kpart (eJOI21_kpart) | C++14 | 80 ms | 15256 KB |
#include<bits/stdc++.h> #define all(a) a.begin(),a.end() #define pb push_back #pragma GCC target ("avx") #pragma GCC optimaze ("unroll-loops") using namespace std ; const int maxn = 1e5 + 10 , maxq = 1e3+10 , mod = 998244353 ,inf = 1e9 ; int a[maxn] , dp[maxq][maxn] , pre[maxn] ; signed main(){ ios::sync_with_stdio(false);cin.tie(0);cout.tie(0); int t ; cin >> t ; while(t--){ int n ; cin >> n ; for(int i =1 ; i<= n ; i++){ cin >> a[i] ; pre[i] = pre[i-1] + a[i] ; } dp[0][0] = 0 ; for(int i = 1; i <= n ; i++){ for(int j = 0 ; j <= pre[i] ; j++){ dp[i][j] = dp[i-1][j] ; if(a[i] <= j){ dp[i][j] = max(dp[i-1][j-a[i]] , dp[i][j]); } if(j == a[i] && j != 0)dp[i][j] = i ; else if(dp[i][j] == 0 && j == 0)dp[i][j] =0 ; } } vector <int> v; for(int i =1 ;i <= n ; i++){ int x = 1 , ok = 0; for(int j = i ; j <= n ; j++){ int sum = pre[j] - pre[x-1] ; if(sum % 2 == 1 || dp[j][sum/2] < x || dp[j][sum/2] == -1){ ok = 1; break; } x++; } if(ok == 0)v.pb(i); } cout << v.size() << " " ; for(short i = 0 ; i <v.size();i++)cout << v[i] << " " ; cout << "\n"; } return 0 ; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 596 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 6 ms | 1748 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 80 ms | 15256 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |