제출 #1154356

#제출 시각아이디문제언어결과실행 시간메모리
1154356CiprianKpart (eJOI21_kpart)C++20
0 / 100
0 ms324 KiB
#include <bits/stdc++.h> using namespace std; #define int long long int deep(int sum, vector<int>&v, int l, int r){ vector<int>a; for(int i=l; i<=r; i++)a.push_back(v[i]); int n=a.size(); vector<vector<bool>>dp(n+2, vector<bool>(sum/2+3)); dp[0][0]=true; for(int i=1; i<=n; i++){ dp[i][0]=true; for(int j=1; j<=sum/2; j++){ if(j-a[i-1]>=0)dp[i][j]=(dp[i-1][j-a[i-1]]|dp[i-1][j]); cout<<dp[i][j]<<" "; }cout<<endl; }return dp[n][sum/2]; } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); int t; cin>>t; for(int i=0; i<t; i++){ int n; cin>>n; vector<int>a; for(int j=0; j<n; j++){ int x; cin>>x; a.push_back(x); }bool d=deep(10, a, 0, 1); cout<<d<<endl; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...