oj.uz

답안 #38248

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
38248 2018-01-03T06:56:43 Z Talant Bootfall (IZhO17_bootfall) C++14
28 / 100
 1000 ms 83428 KB 
#include <bits/stdc++.h>

#define fr first
#define sc second
#define OK puts("OK");
#define pb push_back
#define mk make_pair

using namespace std;

typedef long long ll;

const ll inf = (ll)1e9 + 7;
const int N = (int)1e6 + 1;
const int M = (int)72901;

int n;
int dp[271][72905];
int a[N],sum;
vector <int> ans;

int main () {
        cin >> n;

        for (int i = 1; i <= n; i ++)
                cin >> a[i],sum += a[i];

        for (int i = 0; i <= n; i ++)
                memset(dp[i],-1,sizeof(dp[i]));

        for (int i = 0; i <= n; i ++) {
                dp[i][0] = 1;
                vector <int> v;
                v.pb(0);
                for (int j = 1; j <= n; j ++) {
                        if (j == i)
                                continue;
                        int o = (int) v.size();
                        for (int k = 0; k < o; k ++) {
                                if (sum >= v[k] + a[j] && dp[i][v[k] + a[j]] == -1) {
                                        dp[i][v[k] + a[j]] = 1;
                                        v.pb(v[k] + a[j]);
                                }
                        }
                }
                if (sum % 2 != 0 || dp[0][sum / 2] == -1) {
                        cout << "0";
                        return 0;
                }
        }

        for (int i = 1; i <= sum; i ++) {
                int f = 0;
                if (sum % 2 != 0 || dp[0][sum / 2] == -1)
                        continue;

                for (int j = 1; j <= n; j ++) {
                        if ((sum - a[j] + i) % 2 != 0 || (sum - a[j] + i) / 2 - i < 0 || dp[j][(sum - a[j] + i) / 2 - i] == -1 || dp[j][(sum - a[j] + i) / 2] == -1) {
                                f = 1;
                                break;
                        }
                }
                if (!f)
                        ans.pb(i);
        }
        cout << ans.size() << endl;

        for (int i = 0; i < ans.size(); i ++)
                cout << ans[i] << " ";
}

Compilation message

bootfall.cpp: In function 'int main()':
bootfall.cpp:68:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < ans.size(); i ++)
                           ^

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 83096 KB Output is correct
2 Correct 0 ms 83096 KB Output is correct
3 Correct 0 ms 83096 KB Output is correct
4 Correct 0 ms 83096 KB Output is correct
5 Correct 0 ms 83096 KB Output is correct
6 Correct 0 ms 83096 KB Output is correct
7 Correct 0 ms 83096 KB Output is correct
8 Correct 0 ms 83096 KB Output is correct
9 Correct 0 ms 83096 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 83096 KB Output is correct
2 Correct 0 ms 83096 KB Output is correct
3 Correct 0 ms 83096 KB Output is correct
4 Correct 0 ms 83096 KB Output is correct
5 Correct 0 ms 83096 KB Output is correct
6 Correct 0 ms 83096 KB Output is correct
7 Correct 0 ms 83096 KB Output is correct
8 Correct 0 ms 83096 KB Output is correct
9 Correct 0 ms 83096 KB Output is correct
10 Correct 0 ms 83096 KB Output is correct
11 Correct 0 ms 83096 KB Output is correct
12 Correct 0 ms 83096 KB Output is correct
13 Correct 0 ms 83096 KB Output is correct
14 Correct 0 ms 83096 KB Output is correct
15 Correct 3 ms 83096 KB Output is correct
16 Correct 6 ms 83096 KB Output is correct
17 Correct 0 ms 83096 KB Output is correct
18 Correct 0 ms 83096 KB Output is correct
19 Correct 0 ms 83096 KB Output is correct
20 Correct 0 ms 83096 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 83096 KB Output is correct
2 Correct 0 ms 83096 KB Output is correct
3 Correct 0 ms 83096 KB Output is correct
4 Correct 0 ms 83096 KB Output is correct
5 Correct 0 ms 83096 KB Output is correct
6 Correct 0 ms 83096 KB Output is correct
7 Correct 0 ms 83096 KB Output is correct
8 Correct 0 ms 83096 KB Output is correct
9 Correct 0 ms 83096 KB Output is correct
10 Correct 0 ms 83096 KB Output is correct
11 Correct 0 ms 83096 KB Output is correct
12 Correct 0 ms 83096 KB Output is correct
13 Correct 0 ms 83096 KB Output is correct
14 Correct 0 ms 83096 KB Output is correct
15 Correct 3 ms 83096 KB Output is correct
16 Correct 6 ms 83096 KB Output is correct
17 Correct 0 ms 83096 KB Output is correct
18 Correct 0 ms 83096 KB Output is correct
19 Correct 0 ms 83096 KB Output is correct
20 Correct 0 ms 83096 KB Output is correct
21 Correct 13 ms 83096 KB Output is correct
22 Correct 23 ms 83096 KB Output is correct
23 Correct 9 ms 83096 KB Output is correct
24 Correct 36 ms 83236 KB Output is correct
25 Correct 59 ms 83236 KB Output is correct
26 Correct 69 ms 83236 KB Output is correct
27 Correct 46 ms 83096 KB Output is correct
28 Correct 29 ms 83096 KB Output is correct
29 Correct 33 ms 83236 KB Output is correct
30 Correct 46 ms 83236 KB Output is correct
31 Correct 76 ms 83236 KB Output is correct
32 Correct 46 ms 83236 KB Output is correct
33 Correct 0 ms 83096 KB Output is correct
34 Correct 3 ms 83096 KB Output is correct
35 Correct 29 ms 83096 KB Output is correct
36 Correct 43 ms 83236 KB Output is correct

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 83096 KB Output is correct
2 Correct 0 ms 83096 KB Output is correct
3 Correct 0 ms 83096 KB Output is correct
4 Correct 0 ms 83096 KB Output is correct
5 Correct 0 ms 83096 KB Output is correct
6 Correct 0 ms 83096 KB Output is correct
7 Correct 0 ms 83096 KB Output is correct
8 Correct 0 ms 83096 KB Output is correct
9 Correct 0 ms 83096 KB Output is correct
10 Correct 0 ms 83096 KB Output is correct
11 Correct 0 ms 83096 KB Output is correct
12 Correct 0 ms 83096 KB Output is correct
13 Correct 0 ms 83096 KB Output is correct
14 Correct 0 ms 83096 KB Output is correct
15 Correct 3 ms 83096 KB Output is correct
16 Correct 6 ms 83096 KB Output is correct
17 Correct 0 ms 83096 KB Output is correct
18 Correct 0 ms 83096 KB Output is correct
19 Correct 0 ms 83096 KB Output is correct
20 Correct 0 ms 83096 KB Output is correct
21 Correct 13 ms 83096 KB Output is correct
22 Correct 23 ms 83096 KB Output is correct
23 Correct 9 ms 83096 KB Output is correct
24 Correct 36 ms 83236 KB Output is correct
25 Correct 59 ms 83236 KB Output is correct
26 Correct 69 ms 83236 KB Output is correct
27 Correct 46 ms 83096 KB Output is correct
28 Correct 29 ms 83096 KB Output is correct
29 Correct 33 ms 83236 KB Output is correct
30 Correct 46 ms 83236 KB Output is correct
31 Correct 76 ms 83236 KB Output is correct
32 Correct 46 ms 83236 KB Output is correct
33 Correct 0 ms 83096 KB Output is correct
34 Correct 3 ms 83096 KB Output is correct
35 Correct 29 ms 83096 KB Output is correct
36 Correct 43 ms 83236 KB Output is correct
37 Correct 753 ms 83428 KB Output is correct
38 Correct 819 ms 83428 KB Output is correct
39 Correct 26 ms 83096 KB Output is correct
40 Execution timed out 1000 ms 83428 KB Execution timed out
41 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 83096 KB Output is correct
2 Correct 0 ms 83096 KB Output is correct
3 Correct 0 ms 83096 KB Output is correct
4 Correct 0 ms 83096 KB Output is correct
5 Correct 0 ms 83096 KB Output is correct
6 Correct 0 ms 83096 KB Output is correct
7 Correct 0 ms 83096 KB Output is correct
8 Correct 0 ms 83096 KB Output is correct
9 Correct 0 ms 83096 KB Output is correct
10 Correct 0 ms 83096 KB Output is correct
11 Correct 0 ms 83096 KB Output is correct
12 Correct 0 ms 83096 KB Output is correct
13 Correct 0 ms 83096 KB Output is correct
14 Correct 0 ms 83096 KB Output is correct
15 Correct 3 ms 83096 KB Output is correct
16 Correct 6 ms 83096 KB Output is correct
17 Correct 0 ms 83096 KB Output is correct
18 Correct 0 ms 83096 KB Output is correct
19 Correct 0 ms 83096 KB Output is correct
20 Correct 0 ms 83096 KB Output is correct
21 Correct 13 ms 83096 KB Output is correct
22 Correct 23 ms 83096 KB Output is correct
23 Correct 9 ms 83096 KB Output is correct
24 Correct 36 ms 83236 KB Output is correct
25 Correct 59 ms 83236 KB Output is correct
26 Correct 69 ms 83236 KB Output is correct
27 Correct 46 ms 83096 KB Output is correct
28 Correct 29 ms 83096 KB Output is correct
29 Correct 33 ms 83236 KB Output is correct
30 Correct 46 ms 83236 KB Output is correct
31 Correct 76 ms 83236 KB Output is correct
32 Correct 46 ms 83236 KB Output is correct
33 Correct 0 ms 83096 KB Output is correct
34 Correct 3 ms 83096 KB Output is correct
35 Correct 29 ms 83096 KB Output is correct
36 Correct 43 ms 83236 KB Output is correct
37 Correct 753 ms 83428 KB Output is correct
38 Correct 819 ms 83428 KB Output is correct
39 Correct 26 ms 83096 KB Output is correct
40 Execution timed out 1000 ms 83428 KB Execution timed out
41 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 83096 KB Output is correct
2 Correct 0 ms 83096 KB Output is correct
3 Correct 0 ms 83096 KB Output is correct
4 Correct 0 ms 83096 KB Output is correct
5 Correct 0 ms 83096 KB Output is correct
6 Correct 0 ms 83096 KB Output is correct
7 Correct 0 ms 83096 KB Output is correct
8 Correct 0 ms 83096 KB Output is correct
9 Correct 0 ms 83096 KB Output is correct
10 Correct 0 ms 83096 KB Output is correct
11 Correct 0 ms 83096 KB Output is correct
12 Correct 0 ms 83096 KB Output is correct
13 Correct 0 ms 83096 KB Output is correct
14 Correct 0 ms 83096 KB Output is correct
15 Correct 3 ms 83096 KB Output is correct
16 Correct 6 ms 83096 KB Output is correct
17 Correct 0 ms 83096 KB Output is correct
18 Correct 0 ms 83096 KB Output is correct
19 Correct 0 ms 83096 KB Output is correct
20 Correct 0 ms 83096 KB Output is correct
21 Correct 13 ms 83096 KB Output is correct
22 Correct 23 ms 83096 KB Output is correct
23 Correct 9 ms 83096 KB Output is correct
24 Correct 36 ms 83236 KB Output is correct
25 Correct 59 ms 83236 KB Output is correct
26 Correct 69 ms 83236 KB Output is correct
27 Correct 46 ms 83096 KB Output is correct
28 Correct 29 ms 83096 KB Output is correct
29 Correct 33 ms 83236 KB Output is correct
30 Correct 46 ms 83236 KB Output is correct
31 Correct 76 ms 83236 KB Output is correct
32 Correct 46 ms 83236 KB Output is correct
33 Correct 0 ms 83096 KB Output is correct
34 Correct 3 ms 83096 KB Output is correct
35 Correct 29 ms 83096 KB Output is correct
36 Correct 43 ms 83236 KB Output is correct
37 Correct 753 ms 83428 KB Output is correct
38 Correct 819 ms 83428 KB Output is correct
39 Correct 26 ms 83096 KB Output is correct
40 Execution timed out 1000 ms 83428 KB Execution timed out
41 Halted 0 ms 0 KB -