Submission #769866

#TimeUsernameProblemLanguageResultExecution timeMemory
769866NintsiChkhaidzeBootfall (IZhO17_bootfall)C++17
0 / 100
199 ms412 KiB
#include <bits/stdc++.h> #define ll long long #define f first #define s second #define pb push_back #define pii pair <int,ll> #define left (h<<1),l,((l + r)>>1) #define right ((h<<1)|1),((l + r)>>1) + 1,r using namespace std; int sum,a[505]; vector <int> ans; signed main() { ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL); int n; cin>>n; for (int i = 1; i <= n; i++) cin>>a[i],sum += a[i]; int l = 1; if (a[1]%2 == 0) l = 2; ++n; for (int x = l; x <= sum; x += 2){ //x-s vamatebt axla a[n] = x; int can = 1; for (int j = 1; j <= n; j++){ //j amovagdot int target = (sum + x - a[j])/2; bitset <250001> dp; dp[0] = 1; for (int i = 1; i <= n; i++){ if (i != j) dp |= (dp << a[i]); } if (!dp[target]) { can = 0; break; } } if (can){ ans.pb(x); } } cout<<ans.size()<<endl; for (int x: ans) cout<<x<<" "; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...