답안 #84631 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
84631	2018-11-16T08:00:43 Z	muradeyn	Bootfall (IZhO17_bootfall)	C++14	28 / 100	1000 ms	1840 KB

bootfall

/* 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 dp[250005] , f;

int 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];
    dp[0] = true;
    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];
        memset(dp,0,sizeof(dp));
        dp[0] = true;
        for (int i = 0;i<n;i++) {
            if (i == no - 1)continue;
            for (int j = sum;j >= a[i];j--)
                dp[j] |= dp[j - a[i]];
        }
        for (int i = 1;i<=sum;i++) {
            if (dp[i] && mp1[abs(i - (sum - i))] != no) {
                //cout<<i<<" "<<abs(i - (sum - i))<<endl;
                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;
    }
    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

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	632 KB	Output is correct
2	Correct	2 ms	636 KB	Output is correct
3	Correct	2 ms	636 KB	Output is correct
4	Correct	2 ms	636 KB	Output is correct
5	Correct	4 ms	728 KB	Output is correct
6	Correct	2 ms	788 KB	Output is correct
7	Correct	2 ms	788 KB	Output is correct
8	Correct	4 ms	916 KB	Output is correct
9	Correct	11 ms	916 KB	Output is correct

Subtask #2
7.0 / 7.0

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

Subtask #3
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	632 KB	Output is correct
2	Correct	2 ms	636 KB	Output is correct
3	Correct	2 ms	636 KB	Output is correct
4	Correct	2 ms	636 KB	Output is correct
5	Correct	4 ms	728 KB	Output is correct
6	Correct	2 ms	788 KB	Output is correct
7	Correct	2 ms	788 KB	Output is correct
8	Correct	4 ms	916 KB	Output is correct
9	Correct	11 ms	916 KB	Output is correct
10	Correct	3 ms	916 KB	Output is correct
11	Correct	4 ms	988 KB	Output is correct
12	Correct	2 ms	992 KB	Output is correct
13	Correct	3 ms	992 KB	Output is correct
14	Correct	4 ms	992 KB	Output is correct
15	Correct	3 ms	992 KB	Output is correct
16	Correct	4 ms	992 KB	Output is correct
17	Correct	3 ms	992 KB	Output is correct
18	Correct	3 ms	992 KB	Output is correct
19	Correct	3 ms	992 KB	Output is correct
20	Correct	4 ms	992 KB	Output is correct
21	Correct	51 ms	1020 KB	Output is correct
22	Correct	63 ms	1020 KB	Output is correct
23	Correct	26 ms	1092 KB	Output is correct
24	Correct	114 ms	1180 KB	Output is correct
25	Correct	189 ms	1324 KB	Output is correct
26	Correct	216 ms	1452 KB	Output is correct
27	Correct	151 ms	1452 KB	Output is correct
28	Correct	145 ms	1452 KB	Output is correct
29	Correct	191 ms	1452 KB	Output is correct
30	Correct	10 ms	1452 KB	Output is correct
31	Correct	194 ms	1452 KB	Output is correct
32	Correct	122 ms	1452 KB	Output is correct
33	Correct	95 ms	1452 KB	Output is correct
34	Correct	86 ms	1452 KB	Output is correct
35	Correct	157 ms	1452 KB	Output is correct
36	Correct	120 ms	1452 KB	Output is correct

Subtask #4
0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	632 KB	Output is correct
2	Correct	2 ms	636 KB	Output is correct
3	Correct	2 ms	636 KB	Output is correct
4	Correct	2 ms	636 KB	Output is correct
5	Correct	4 ms	728 KB	Output is correct
6	Correct	2 ms	788 KB	Output is correct
7	Correct	2 ms	788 KB	Output is correct
8	Correct	4 ms	916 KB	Output is correct
9	Correct	11 ms	916 KB	Output is correct
10	Correct	3 ms	916 KB	Output is correct
11	Correct	4 ms	988 KB	Output is correct
12	Correct	2 ms	992 KB	Output is correct
13	Correct	3 ms	992 KB	Output is correct
14	Correct	4 ms	992 KB	Output is correct
15	Correct	3 ms	992 KB	Output is correct
16	Correct	4 ms	992 KB	Output is correct
17	Correct	3 ms	992 KB	Output is correct
18	Correct	3 ms	992 KB	Output is correct
19	Correct	3 ms	992 KB	Output is correct
20	Correct	4 ms	992 KB	Output is correct
21	Correct	51 ms	1020 KB	Output is correct
22	Correct	63 ms	1020 KB	Output is correct
23	Correct	26 ms	1092 KB	Output is correct
24	Correct	114 ms	1180 KB	Output is correct
25	Correct	189 ms	1324 KB	Output is correct
26	Correct	216 ms	1452 KB	Output is correct
27	Correct	151 ms	1452 KB	Output is correct
28	Correct	145 ms	1452 KB	Output is correct
29	Correct	191 ms	1452 KB	Output is correct
30	Correct	10 ms	1452 KB	Output is correct
31	Correct	194 ms	1452 KB	Output is correct
32	Correct	122 ms	1452 KB	Output is correct
33	Correct	95 ms	1452 KB	Output is correct
34	Correct	86 ms	1452 KB	Output is correct
35	Correct	157 ms	1452 KB	Output is correct
36	Correct	120 ms	1452 KB	Output is correct
37	Execution timed out	1076 ms	1840 KB	Time limit exceeded
38	Halted	0 ms	0 KB	-

Subtask #5
0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	632 KB	Output is correct
2	Correct	2 ms	636 KB	Output is correct
3	Correct	2 ms	636 KB	Output is correct
4	Correct	2 ms	636 KB	Output is correct
5	Correct	4 ms	728 KB	Output is correct
6	Correct	2 ms	788 KB	Output is correct
7	Correct	2 ms	788 KB	Output is correct
8	Correct	4 ms	916 KB	Output is correct
9	Correct	11 ms	916 KB	Output is correct
10	Correct	3 ms	916 KB	Output is correct
11	Correct	4 ms	988 KB	Output is correct
12	Correct	2 ms	992 KB	Output is correct
13	Correct	3 ms	992 KB	Output is correct
14	Correct	4 ms	992 KB	Output is correct
15	Correct	3 ms	992 KB	Output is correct
16	Correct	4 ms	992 KB	Output is correct
17	Correct	3 ms	992 KB	Output is correct
18	Correct	3 ms	992 KB	Output is correct
19	Correct	3 ms	992 KB	Output is correct
20	Correct	4 ms	992 KB	Output is correct
21	Correct	51 ms	1020 KB	Output is correct
22	Correct	63 ms	1020 KB	Output is correct
23	Correct	26 ms	1092 KB	Output is correct
24	Correct	114 ms	1180 KB	Output is correct
25	Correct	189 ms	1324 KB	Output is correct
26	Correct	216 ms	1452 KB	Output is correct
27	Correct	151 ms	1452 KB	Output is correct
28	Correct	145 ms	1452 KB	Output is correct
29	Correct	191 ms	1452 KB	Output is correct
30	Correct	10 ms	1452 KB	Output is correct
31	Correct	194 ms	1452 KB	Output is correct
32	Correct	122 ms	1452 KB	Output is correct
33	Correct	95 ms	1452 KB	Output is correct
34	Correct	86 ms	1452 KB	Output is correct
35	Correct	157 ms	1452 KB	Output is correct
36	Correct	120 ms	1452 KB	Output is correct
37	Execution timed out	1076 ms	1840 KB	Time limit exceeded
38	Halted	0 ms	0 KB	-

Subtask #6
0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	632 KB	Output is correct
2	Correct	2 ms	636 KB	Output is correct
3	Correct	2 ms	636 KB	Output is correct
4	Correct	2 ms	636 KB	Output is correct
5	Correct	4 ms	728 KB	Output is correct
6	Correct	2 ms	788 KB	Output is correct
7	Correct	2 ms	788 KB	Output is correct
8	Correct	4 ms	916 KB	Output is correct
9	Correct	11 ms	916 KB	Output is correct
10	Correct	3 ms	916 KB	Output is correct
11	Correct	4 ms	988 KB	Output is correct
12	Correct	2 ms	992 KB	Output is correct
13	Correct	3 ms	992 KB	Output is correct
14	Correct	4 ms	992 KB	Output is correct
15	Correct	3 ms	992 KB	Output is correct
16	Correct	4 ms	992 KB	Output is correct
17	Correct	3 ms	992 KB	Output is correct
18	Correct	3 ms	992 KB	Output is correct
19	Correct	3 ms	992 KB	Output is correct
20	Correct	4 ms	992 KB	Output is correct
21	Correct	51 ms	1020 KB	Output is correct
22	Correct	63 ms	1020 KB	Output is correct
23	Correct	26 ms	1092 KB	Output is correct
24	Correct	114 ms	1180 KB	Output is correct
25	Correct	189 ms	1324 KB	Output is correct
26	Correct	216 ms	1452 KB	Output is correct
27	Correct	151 ms	1452 KB	Output is correct
28	Correct	145 ms	1452 KB	Output is correct
29	Correct	191 ms	1452 KB	Output is correct
30	Correct	10 ms	1452 KB	Output is correct
31	Correct	194 ms	1452 KB	Output is correct
32	Correct	122 ms	1452 KB	Output is correct
33	Correct	95 ms	1452 KB	Output is correct
34	Correct	86 ms	1452 KB	Output is correct
35	Correct	157 ms	1452 KB	Output is correct
36	Correct	120 ms	1452 KB	Output is correct
37	Execution timed out	1076 ms	1840 KB	Time limit exceeded
38	Halted	0 ms	0 KB	-

답안 #84631

Compilation message

Subtask #1 6.0 / 6.0

Subtask #2 7.0 / 7.0

Subtask #3 15.0 / 15.0

Subtask #4 0 / 16.0

Subtask #5 0 / 21.0

Subtask #6 0 / 35.0

Subtask #1
6.0 / 6.0

Subtask #2
7.0 / 7.0

Subtask #3
15.0 / 15.0

Subtask #4
0 / 16.0

Subtask #5
0 / 21.0

Subtask #6
0 / 35.0