# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1112908 | 2024-11-15T08:50:01 Z | adiyer | Bootfall (IZhO17_bootfall) | C++17 | 2 ms | 336 KB |
#include <bits/stdc++.h> #define ios ios_base::sync_with_stdio(0); cin.tie(0); #define pb push_back using namespace std; typedef int ll; const int N = 5e2 + 11; const int MAX = 1e6; short int n; int s; short int a[N]; vector < int > ans; bitset < 500 * 500 + 3 > dp; void sol(){ cin >> n, dp[0] = 1; for(ll i = 1; i <= 10; i++) ans.pb(i); for(ll i = 1; i <= n; i++) cin >> a[i], dp |= (dp << a[i]), s += a[i]; if(s % 2 || dp[s / 2] == 0){ cout << "0\n"; return; } for(short int i = 1; i <= n; i++){ dp &= 0, dp[0] = 1, s = 0; for(short int j = 1; j <= n; j++) if(i != j) dp |= (dp << a[j]), s += a[j]; int j = 0; while(j < ans.size()){ if(ans.size() && (s < ans[j] || (s - ans[j]) % 2 || !dp[(s - ans[j]) / 2])){ if(j < ans.size()) swap(ans[j], ans[ans.size() - 1]); ans.pop_back(); } else{ j++; } } } cout << ans.size() << '\n'; for(int x : ans) cout << x << ' '; } signed main(){ ios sol(); // slow(); // stress(); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 336 KB | Output is correct |
2 | Incorrect | 2 ms | 336 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 336 KB | Output is correct |
2 | Incorrect | 2 ms | 336 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 336 KB | Output is correct |
2 | Incorrect | 2 ms | 336 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 336 KB | Output is correct |
2 | Incorrect | 2 ms | 336 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 336 KB | Output is correct |
2 | Incorrect | 2 ms | 336 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 336 KB | Output is correct |
2 | Incorrect | 2 ms | 336 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |