# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
168072 | 2019-12-11T09:02:52 Z | Gurban | Bootfall (IZhO17_bootfall) | C++14 | 51 ms | 1400 KB |
#include <bits/stdc++.h> #define pb push_back #define ss second #define ff first #define N 250000 #define inf 1000000009 #define ll long long #define mid(a,b) (a+b)/2 using namespace std; int n,a[N],sum,sum1,l; int c[509][N],s[509][N],dp[509][N]; map <int,int> m; vector <int> v; int main() { scanf("%d",&n); for(int i = 1;i <= n;i++){ scanf("%d",&a[i]); sum += a[i]; s[0][i] = 1; c[0][i] = 1; } c[0][0] = 1; s[0][0] = 1; sum1 = ceil(double(sum)/2.0); for(int i = 1;i <= sum;i++) for(int j = 1;j <= n;j++) if(c[i][j - 1] or (i >= a[j] and c[i - a[j]][j - 1] > 0)) c[i][j] = 1; for(int i = 1;i <= sum;i++){ for(int j = n;j >= 1;j--){ l = n - j + 1; if(s[i][l - 1] or (i >= a[j] and s[i - a[j]][l - 1] > 0)) s[i][l] = 1; } } if(sum % 2 == 1 or (c[sum1][n] == 0)) return cout << 0,0; for(int i = 1;i <= n;i++){ for(int j = 1;j <= sum;j++){ for(int k = 1;k <= sum;k++){ if(c[j][i - 1]) dp[i][j] = 1; if(s[k][n - i]) dp[i][k] = 1; if(c[j][i - 1] and s[k][n - i]){ dp[i][j + k] = 1; } } } } for(int i = 1;i <= n;i++) dp[i][0] = 1; for(int i = 1;i <= n;i++){ for(int j = 1;j < sum;j++){ l = sum - a[i] + j; if(l % 2 == 1) continue; if(dp[i][l / 2 - j]) m[j]++; } } for(auto i : m) if(i.ss == n) v.pb(i.ff); printf("%d\n",v.size()); for(auto i : v) printf("%d\n",i); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 504 KB | Output is correct |
2 | Correct | 2 ms | 888 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Runtime error | 51 ms | 1400 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 504 KB | Output is correct |
2 | Correct | 2 ms | 888 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Runtime error | 51 ms | 1400 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 504 KB | Output is correct |
2 | Correct | 2 ms | 888 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Runtime error | 51 ms | 1400 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 504 KB | Output is correct |
2 | Correct | 2 ms | 888 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Runtime error | 51 ms | 1400 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 504 KB | Output is correct |
2 | Correct | 2 ms | 888 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Runtime error | 51 ms | 1400 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 504 KB | Output is correct |
2 | Correct | 2 ms | 888 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Runtime error | 51 ms | 1400 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
5 | Halted | 0 ms | 0 KB | - |