oj.uz

Submission #84668

# Submission time Handle Problem Language Result Execution time Memory
84668 2018-11-16T12:52:28 Z muradeyn Bootfall (IZhO17_bootfall) C++14
28 / 100
 1000 ms 2236 KB 
/* Murad Eynizade */

#include <bits/stdc++.h>
#define intt long long
#define FAST_READ ios_base::sync_with_stdio(0);cin.tie(0);
#define SIZE 100001
#define INF INT_MAX
#define F first
#define S second
#define in(a) scanf("%d",&a);
#define outn(a) printf("%d\n",&a);
#define outs(a) printf("%d ",&a);
#define MOD 1000000007

using namespace std;

bool f = false;

int dp[250005],sum , mx;

map<int,int>mp,mp1;

map<int,int>::iterator it;

int main()
{
    FAST_READ;
    int n;
    cin>>n;
    int a[n];
    for (int i = 0;i<n;i++)cin>>a[i] , sum += a[i];
    sort(a,a+n);
    dp[0] = 1;
    for (int i = 0;i<n;i++)
        for (int j = sum;j >= a[i];j--)
            dp[j] += dp[j - a[i]];
    if (sum % 2) {
        cout<<0<<endl;
        return 0;
    }
    for (int i = 1;i<sum;i++)  {
        if (dp[i] && i == sum / 2) {
            f = true;
            break;
        }
    }
    if (!f) {
        cout<<0<<endl;
        return 0;
    }
    for (int no = 1;no<=n;no++) {
        mx = -1;
        int oldsum = sum;
        sum -= a[no - 1];
        if (no == 1 || a[no - 1] != a[no - 2]) {
            for (int i = a[no - 1];i<=oldsum;i++)
                dp[i] -= dp[i - a[no - 1]];
        }
        for (int i = 1;i<=sum;i++) {
            if (dp[i] && mp1[abs(i - (sum - i))] != no) {
                mp1[abs(i - (sum - i))] = no;
                mp[abs(i - (sum - i))]++;
                mx = max(mx,mp[abs(i - (sum - i))]);
            }
        }
        if (mx < no) {
            cout<<0<<endl;
            return 0;
        }
        sum = oldsum;
        if (no == n || a[no - 1] != a[no]) {
            for (int i = sum;i>=a[no - 1];i--)
                dp[i] += dp[i - a[no - 1]];
        }
    }
    vector<int>ans;
    for (it = mp.begin();it != mp.end();it++)
        if ((*it).second == n) ans.push_back((*it).first);
    int sz = ans.size();
    if (sz == 0)cout<<0<<endl;
    else {
        cout<<sz<<endl;
        for (int i = 0;i<sz;i++) cout<<ans[i]<<" ";
        cout<<endl;
    }
    return 0;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 508 KB Output is correct
3 Correct 3 ms 516 KB Output is correct
4 Correct 2 ms 516 KB Output is correct
5 Correct 3 ms 516 KB Output is correct
6 Correct 2 ms 516 KB Output is correct
7 Correct 2 ms 516 KB Output is correct
8 Correct 3 ms 516 KB Output is correct
9 Correct 2 ms 516 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 508 KB Output is correct
3 Correct 3 ms 516 KB Output is correct
4 Correct 2 ms 516 KB Output is correct
5 Correct 3 ms 516 KB Output is correct
6 Correct 2 ms 516 KB Output is correct
7 Correct 2 ms 516 KB Output is correct
8 Correct 3 ms 516 KB Output is correct
9 Correct 2 ms 516 KB Output is correct
10 Correct 2 ms 516 KB Output is correct
11 Correct 3 ms 516 KB Output is correct
12 Correct 2 ms 520 KB Output is correct
13 Correct 2 ms 580 KB Output is correct
14 Correct 3 ms 580 KB Output is correct
15 Correct 3 ms 580 KB Output is correct
16 Correct 3 ms 580 KB Output is correct
17 Correct 2 ms 648 KB Output is correct
18 Correct 3 ms 648 KB Output is correct
19 Correct 4 ms 648 KB Output is correct
20 Correct 2 ms 648 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 508 KB Output is correct
3 Correct 3 ms 516 KB Output is correct
4 Correct 2 ms 516 KB Output is correct
5 Correct 3 ms 516 KB Output is correct
6 Correct 2 ms 516 KB Output is correct
7 Correct 2 ms 516 KB Output is correct
8 Correct 3 ms 516 KB Output is correct
9 Correct 2 ms 516 KB Output is correct
10 Correct 2 ms 516 KB Output is correct
11 Correct 3 ms 516 KB Output is correct
12 Correct 2 ms 520 KB Output is correct
13 Correct 2 ms 580 KB Output is correct
14 Correct 3 ms 580 KB Output is correct
15 Correct 3 ms 580 KB Output is correct
16 Correct 3 ms 580 KB Output is correct
17 Correct 2 ms 648 KB Output is correct
18 Correct 3 ms 648 KB Output is correct
19 Correct 4 ms 648 KB Output is correct
20 Correct 2 ms 648 KB Output is correct
21 Correct 36 ms 724 KB Output is correct
22 Correct 43 ms 780 KB Output is correct
23 Correct 21 ms 780 KB Output is correct
24 Correct 74 ms 912 KB Output is correct
25 Correct 118 ms 1068 KB Output is correct
26 Correct 134 ms 1068 KB Output is correct
27 Correct 69 ms 1068 KB Output is correct
28 Correct 62 ms 1068 KB Output is correct
29 Correct 85 ms 1068 KB Output is correct
30 Correct 6 ms 1296 KB Output is correct
31 Correct 128 ms 1296 KB Output is correct
32 Correct 81 ms 1296 KB Output is correct
33 Correct 4 ms 1296 KB Output is correct
34 Correct 4 ms 1296 KB Output is correct
35 Correct 71 ms 1296 KB Output is correct
36 Correct 80 ms 1296 KB Output is correct

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 508 KB Output is correct
3 Correct 3 ms 516 KB Output is correct
4 Correct 2 ms 516 KB Output is correct
5 Correct 3 ms 516 KB Output is correct
6 Correct 2 ms 516 KB Output is correct
7 Correct 2 ms 516 KB Output is correct
8 Correct 3 ms 516 KB Output is correct
9 Correct 2 ms 516 KB Output is correct
10 Correct 2 ms 516 KB Output is correct
11 Correct 3 ms 516 KB Output is correct
12 Correct 2 ms 520 KB Output is correct
13 Correct 2 ms 580 KB Output is correct
14 Correct 3 ms 580 KB Output is correct
15 Correct 3 ms 580 KB Output is correct
16 Correct 3 ms 580 KB Output is correct
17 Correct 2 ms 648 KB Output is correct
18 Correct 3 ms 648 KB Output is correct
19 Correct 4 ms 648 KB Output is correct
20 Correct 2 ms 648 KB Output is correct
21 Correct 36 ms 724 KB Output is correct
22 Correct 43 ms 780 KB Output is correct
23 Correct 21 ms 780 KB Output is correct
24 Correct 74 ms 912 KB Output is correct
25 Correct 118 ms 1068 KB Output is correct
26 Correct 134 ms 1068 KB Output is correct
27 Correct 69 ms 1068 KB Output is correct
28 Correct 62 ms 1068 KB Output is correct
29 Correct 85 ms 1068 KB Output is correct
30 Correct 6 ms 1296 KB Output is correct
31 Correct 128 ms 1296 KB Output is correct
32 Correct 81 ms 1296 KB Output is correct
33 Correct 4 ms 1296 KB Output is correct
34 Correct 4 ms 1296 KB Output is correct
35 Correct 71 ms 1296 KB Output is correct
36 Correct 80 ms 1296 KB Output is correct
37 Correct 749 ms 1852 KB Output is correct
38 Correct 767 ms 1976 KB Output is correct
39 Correct 36 ms 1976 KB Output is correct
40 Execution timed out 1087 ms 2236 KB Time limit exceeded
41 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 508 KB Output is correct
3 Correct 3 ms 516 KB Output is correct
4 Correct 2 ms 516 KB Output is correct
5 Correct 3 ms 516 KB Output is correct
6 Correct 2 ms 516 KB Output is correct
7 Correct 2 ms 516 KB Output is correct
8 Correct 3 ms 516 KB Output is correct
9 Correct 2 ms 516 KB Output is correct
10 Correct 2 ms 516 KB Output is correct
11 Correct 3 ms 516 KB Output is correct
12 Correct 2 ms 520 KB Output is correct
13 Correct 2 ms 580 KB Output is correct
14 Correct 3 ms 580 KB Output is correct
15 Correct 3 ms 580 KB Output is correct
16 Correct 3 ms 580 KB Output is correct
17 Correct 2 ms 648 KB Output is correct
18 Correct 3 ms 648 KB Output is correct
19 Correct 4 ms 648 KB Output is correct
20 Correct 2 ms 648 KB Output is correct
21 Correct 36 ms 724 KB Output is correct
22 Correct 43 ms 780 KB Output is correct
23 Correct 21 ms 780 KB Output is correct
24 Correct 74 ms 912 KB Output is correct
25 Correct 118 ms 1068 KB Output is correct
26 Correct 134 ms 1068 KB Output is correct
27 Correct 69 ms 1068 KB Output is correct
28 Correct 62 ms 1068 KB Output is correct
29 Correct 85 ms 1068 KB Output is correct
30 Correct 6 ms 1296 KB Output is correct
31 Correct 128 ms 1296 KB Output is correct
32 Correct 81 ms 1296 KB Output is correct
33 Correct 4 ms 1296 KB Output is correct
34 Correct 4 ms 1296 KB Output is correct
35 Correct 71 ms 1296 KB Output is correct
36 Correct 80 ms 1296 KB Output is correct
37 Correct 749 ms 1852 KB Output is correct
38 Correct 767 ms 1976 KB Output is correct
39 Correct 36 ms 1976 KB Output is correct
40 Execution timed out 1087 ms 2236 KB Time limit exceeded
41 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 508 KB Output is correct
3 Correct 3 ms 516 KB Output is correct
4 Correct 2 ms 516 KB Output is correct
5 Correct 3 ms 516 KB Output is correct
6 Correct 2 ms 516 KB Output is correct
7 Correct 2 ms 516 KB Output is correct
8 Correct 3 ms 516 KB Output is correct
9 Correct 2 ms 516 KB Output is correct
10 Correct 2 ms 516 KB Output is correct
11 Correct 3 ms 516 KB Output is correct
12 Correct 2 ms 520 KB Output is correct
13 Correct 2 ms 580 KB Output is correct
14 Correct 3 ms 580 KB Output is correct
15 Correct 3 ms 580 KB Output is correct
16 Correct 3 ms 580 KB Output is correct
17 Correct 2 ms 648 KB Output is correct
18 Correct 3 ms 648 KB Output is correct
19 Correct 4 ms 648 KB Output is correct
20 Correct 2 ms 648 KB Output is correct
21 Correct 36 ms 724 KB Output is correct
22 Correct 43 ms 780 KB Output is correct
23 Correct 21 ms 780 KB Output is correct
24 Correct 74 ms 912 KB Output is correct
25 Correct 118 ms 1068 KB Output is correct
26 Correct 134 ms 1068 KB Output is correct
27 Correct 69 ms 1068 KB Output is correct
28 Correct 62 ms 1068 KB Output is correct
29 Correct 85 ms 1068 KB Output is correct
30 Correct 6 ms 1296 KB Output is correct
31 Correct 128 ms 1296 KB Output is correct
32 Correct 81 ms 1296 KB Output is correct
33 Correct 4 ms 1296 KB Output is correct
34 Correct 4 ms 1296 KB Output is correct
35 Correct 71 ms 1296 KB Output is correct
36 Correct 80 ms 1296 KB Output is correct
37 Correct 749 ms 1852 KB Output is correct
38 Correct 767 ms 1976 KB Output is correct
39 Correct 36 ms 1976 KB Output is correct
40 Execution timed out 1087 ms 2236 KB Time limit exceeded
41 Halted 0 ms 0 KB -