# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
91458 | 2018-12-27T15:35:30 Z | davitmarg | Bootfall (IZhO17_bootfall) | C++17 | 2 ms | 652 KB |
/* DEATH-MATCH Davit-Marg */ #include <iostream> #include <algorithm> #include <cmath> #include <vector> #include <string> #include <cstring> #include <map> #include <set> #include <queue> #include <deque> #include <stack> #include <iterator> #include <ctype.h> #include <stdlib.h> #include <fstream> #define mod 1000000007ll #define LL long long #define LD long double #define MP make_pair #define PB push_back using namespace std; int n,a[502],cant[502 * 502*4]; int sum,sm; vector<int> ans; LL dp[502 * 502*4]; void add(LL k) { for (int i = sum; i >= k; i--) { dp[i] += dp[i - k]; } } void rem(LL k) { for (int i = k; i <= sum; i++) { dp[i] -= dp[i - k]; } } int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; sum += a[i]; } dp[0] = 1; for (int i = 0; i < n; i++) for (int j = sum; j >= 0; j--) dp[j + a[i]]+=dp[j]; if (sum % 2==1 || dp[sum / 2] == 0) { cout << 0 << endl; return 0; } sm = sum; for (int i = 0; i < n; i++) { rem(a[i]); sum -= a[i]; for (int j = 0; j <= sm*2; j++) if ((sum+j) % 2==1 || dp[(sum+j) / 2] == 0) cant[j] = 1; add(a[i]); sum += a[i]; } for (int j = 0; j <= sm; j++) if (!cant[j]) ans.PB(j); cout << ans.size() << endl; if (ans.size() == 0) return 0; for (int i = 0; i < ans.size(); i++) cout << ans[i] << " "; cout << endl; return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 380 KB | Output is correct |
3 | Correct | 2 ms | 440 KB | Output is correct |
4 | Correct | 2 ms | 444 KB | Output is correct |
5 | Correct | 2 ms | 464 KB | Output is correct |
6 | Correct | 2 ms | 516 KB | Output is correct |
7 | Correct | 2 ms | 520 KB | Output is correct |
8 | Correct | 2 ms | 652 KB | Output is correct |
9 | Correct | 2 ms | 652 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 380 KB | Output is correct |
3 | Correct | 2 ms | 440 KB | Output is correct |
4 | Correct | 2 ms | 444 KB | Output is correct |
5 | Correct | 2 ms | 464 KB | Output is correct |
6 | Correct | 2 ms | 516 KB | Output is correct |
7 | Correct | 2 ms | 520 KB | Output is correct |
8 | Correct | 2 ms | 652 KB | Output is correct |
9 | Correct | 2 ms | 652 KB | Output is correct |
10 | Correct | 2 ms | 652 KB | Output is correct |
11 | Correct | 2 ms | 652 KB | Output is correct |
12 | Correct | 2 ms | 652 KB | Output is correct |
13 | Correct | 2 ms | 652 KB | Output is correct |
14 | Incorrect | 2 ms | 652 KB | Output isn't correct |
15 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 380 KB | Output is correct |
3 | Correct | 2 ms | 440 KB | Output is correct |
4 | Correct | 2 ms | 444 KB | Output is correct |
5 | Correct | 2 ms | 464 KB | Output is correct |
6 | Correct | 2 ms | 516 KB | Output is correct |
7 | Correct | 2 ms | 520 KB | Output is correct |
8 | Correct | 2 ms | 652 KB | Output is correct |
9 | Correct | 2 ms | 652 KB | Output is correct |
10 | Correct | 2 ms | 652 KB | Output is correct |
11 | Correct | 2 ms | 652 KB | Output is correct |
12 | Correct | 2 ms | 652 KB | Output is correct |
13 | Correct | 2 ms | 652 KB | Output is correct |
14 | Incorrect | 2 ms | 652 KB | Output isn't correct |
15 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 380 KB | Output is correct |
3 | Correct | 2 ms | 440 KB | Output is correct |
4 | Correct | 2 ms | 444 KB | Output is correct |
5 | Correct | 2 ms | 464 KB | Output is correct |
6 | Correct | 2 ms | 516 KB | Output is correct |
7 | Correct | 2 ms | 520 KB | Output is correct |
8 | Correct | 2 ms | 652 KB | Output is correct |
9 | Correct | 2 ms | 652 KB | Output is correct |
10 | Correct | 2 ms | 652 KB | Output is correct |
11 | Correct | 2 ms | 652 KB | Output is correct |
12 | Correct | 2 ms | 652 KB | Output is correct |
13 | Correct | 2 ms | 652 KB | Output is correct |
14 | Incorrect | 2 ms | 652 KB | Output isn't correct |
15 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 380 KB | Output is correct |
3 | Correct | 2 ms | 440 KB | Output is correct |
4 | Correct | 2 ms | 444 KB | Output is correct |
5 | Correct | 2 ms | 464 KB | Output is correct |
6 | Correct | 2 ms | 516 KB | Output is correct |
7 | Correct | 2 ms | 520 KB | Output is correct |
8 | Correct | 2 ms | 652 KB | Output is correct |
9 | Correct | 2 ms | 652 KB | Output is correct |
10 | Correct | 2 ms | 652 KB | Output is correct |
11 | Correct | 2 ms | 652 KB | Output is correct |
12 | Correct | 2 ms | 652 KB | Output is correct |
13 | Correct | 2 ms | 652 KB | Output is correct |
14 | Incorrect | 2 ms | 652 KB | Output isn't correct |
15 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 380 KB | Output is correct |
3 | Correct | 2 ms | 440 KB | Output is correct |
4 | Correct | 2 ms | 444 KB | Output is correct |
5 | Correct | 2 ms | 464 KB | Output is correct |
6 | Correct | 2 ms | 516 KB | Output is correct |
7 | Correct | 2 ms | 520 KB | Output is correct |
8 | Correct | 2 ms | 652 KB | Output is correct |
9 | Correct | 2 ms | 652 KB | Output is correct |
10 | Correct | 2 ms | 652 KB | Output is correct |
11 | Correct | 2 ms | 652 KB | Output is correct |
12 | Correct | 2 ms | 652 KB | Output is correct |
13 | Correct | 2 ms | 652 KB | Output is correct |
14 | Incorrect | 2 ms | 652 KB | Output isn't correct |
15 | Halted | 0 ms | 0 KB | - |