답안 #167599

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
167599	2019-12-09T04:51:38 Z	Rakhmand	Bootfall (IZhO17_bootfall)	C++14	13 / 100	1000 ms	2388 KB

bootfall

//
//  ROIGold.cpp
//  Main calisma
//
//  Created by Rakhman on 05/02/2019.
//  Copyright © 2019 Rakhman. All rights reserved.
//
 
#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cassert>
#include <iterator>
 
#define ios ios_base::sync_with_stdio(0), cout.tie(0), cin.tie(0);
#define S second
#define F first
#define pb push_back
#define nl '\n'
#define NL cout << '\n';
#define EX exit(0)
#define all(s) s.begin(), s.end()
#define no_answer return cout << 0, 0;
#define FOR(i, start, finish, k) for(int i = start; i <= finish; i += k)
 
const int MXN = 4e5 + 200;
const long long MNN = 4e2 + 200;
const long long MOD = 1e9 + 7;
const long long INF = 1e18;
const int OO = 1e9 + 500;
 
typedef long long llong;
typedef unsigned long long ullong;
 
using namespace std;
 
int n, k, a[MXN], cnt;
bitset<73000> pr, su[510], no[501];
int sum = 0;
vector<int> v;

int main () {
    ios;
    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
        sum += a[i];
        cnt += a[i] % 2;
    }
    if(sum % 2 == 1) {
        no_answer;
    }
    if(cnt != 0 && cnt != n){
        no_answer;
    }
    su[n + 1][0] = 1;
    for(int i = n; i >= 1; i--){
        su[i] = su[i + 1];
        su[i] |= su[i] << a[i];
    }
    if(su[1][sum / 2] == 0){
        no_answer;
    }
    pr[0] = 1;
    for(int i = 1; i <= n; i++){
        if(i <= n / 2){
            no[i] = su[i + 1];
            for(int j = 1; j <= i - 1; j++){
                no[i] |= no[i] << a[j];
            }
        }else{
            no[i] = pr;
            for(int j = i + 1; j <= n; j ++){
                no[i] |= no[i] << a[j];
            }
        }
        pr |= pr << a[i];
    }
    for(int i = a[1] % 2; i <= sum; i += 2){
        bool ok = 1;
        for(int j = 1; j <= n; j++){
            bitset<73000> lol = no[j];
            lol |= lol << i;
            if(lol[(sum + i - a[j]) / 2] == 0){
                ok = 0;
                break;
            }
        }
        if(ok == 1) v.pb(i);
    }
    cout << v.size() << nl;
    for(int i = 0; i < v.size(); i++){
        cout << v[i] << ' ';
    }
}

Compilation message

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

Subtask #1
6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	504 KB	Output is correct
2	Correct	2 ms	504 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	3 ms	504 KB	Output is correct
5	Correct	10 ms	636 KB	Output is correct
6	Correct	3 ms	508 KB	Output is correct
7	Correct	3 ms	508 KB	Output is correct
8	Correct	12 ms	632 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct

Subtask #2
7.0 / 7.0

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

Subtask #3
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	504 KB	Output is correct
2	Correct	2 ms	504 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	3 ms	504 KB	Output is correct
5	Correct	10 ms	636 KB	Output is correct
6	Correct	3 ms	508 KB	Output is correct
7	Correct	3 ms	508 KB	Output is correct
8	Correct	12 ms	632 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	6 ms	888 KB	Output is correct
11	Correct	16 ms	888 KB	Output is correct
12	Correct	4 ms	888 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	17 ms	888 KB	Output is correct
15	Correct	13 ms	888 KB	Output is correct
16	Correct	15 ms	888 KB	Output is correct
17	Correct	8 ms	760 KB	Output is correct
18	Correct	12 ms	760 KB	Output is correct
19	Correct	11 ms	888 KB	Output is correct
20	Correct	6 ms	888 KB	Output is correct
21	Correct	346 ms	1656 KB	Output is correct
22	Correct	438 ms	1900 KB	Output is correct
23	Correct	193 ms	1272 KB	Output is correct
24	Correct	748 ms	2252 KB	Output is correct
25	Correct	955 ms	2180 KB	Output is correct
26	Execution timed out	1075 ms	2388 KB	Time limit exceeded
27	Halted	0 ms	0 KB	-

Subtask #4
0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	504 KB	Output is correct
2	Correct	2 ms	504 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	3 ms	504 KB	Output is correct
5	Correct	10 ms	636 KB	Output is correct
6	Correct	3 ms	508 KB	Output is correct
7	Correct	3 ms	508 KB	Output is correct
8	Correct	12 ms	632 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	6 ms	888 KB	Output is correct
11	Correct	16 ms	888 KB	Output is correct
12	Correct	4 ms	888 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	17 ms	888 KB	Output is correct
15	Correct	13 ms	888 KB	Output is correct
16	Correct	15 ms	888 KB	Output is correct
17	Correct	8 ms	760 KB	Output is correct
18	Correct	12 ms	760 KB	Output is correct
19	Correct	11 ms	888 KB	Output is correct
20	Correct	6 ms	888 KB	Output is correct
21	Correct	346 ms	1656 KB	Output is correct
22	Correct	438 ms	1900 KB	Output is correct
23	Correct	193 ms	1272 KB	Output is correct
24	Correct	748 ms	2252 KB	Output is correct
25	Correct	955 ms	2180 KB	Output is correct
26	Execution timed out	1075 ms	2388 KB	Time limit exceeded
27	Halted	0 ms	0 KB	-

Subtask #5
0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	504 KB	Output is correct
2	Correct	2 ms	504 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	3 ms	504 KB	Output is correct
5	Correct	10 ms	636 KB	Output is correct
6	Correct	3 ms	508 KB	Output is correct
7	Correct	3 ms	508 KB	Output is correct
8	Correct	12 ms	632 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	6 ms	888 KB	Output is correct
11	Correct	16 ms	888 KB	Output is correct
12	Correct	4 ms	888 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	17 ms	888 KB	Output is correct
15	Correct	13 ms	888 KB	Output is correct
16	Correct	15 ms	888 KB	Output is correct
17	Correct	8 ms	760 KB	Output is correct
18	Correct	12 ms	760 KB	Output is correct
19	Correct	11 ms	888 KB	Output is correct
20	Correct	6 ms	888 KB	Output is correct
21	Correct	346 ms	1656 KB	Output is correct
22	Correct	438 ms	1900 KB	Output is correct
23	Correct	193 ms	1272 KB	Output is correct
24	Correct	748 ms	2252 KB	Output is correct
25	Correct	955 ms	2180 KB	Output is correct
26	Execution timed out	1075 ms	2388 KB	Time limit exceeded
27	Halted	0 ms	0 KB	-

Subtask #6
0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	504 KB	Output is correct
2	Correct	2 ms	504 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	3 ms	504 KB	Output is correct
5	Correct	10 ms	636 KB	Output is correct
6	Correct	3 ms	508 KB	Output is correct
7	Correct	3 ms	508 KB	Output is correct
8	Correct	12 ms	632 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	6 ms	888 KB	Output is correct
11	Correct	16 ms	888 KB	Output is correct
12	Correct	4 ms	888 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	17 ms	888 KB	Output is correct
15	Correct	13 ms	888 KB	Output is correct
16	Correct	15 ms	888 KB	Output is correct
17	Correct	8 ms	760 KB	Output is correct
18	Correct	12 ms	760 KB	Output is correct
19	Correct	11 ms	888 KB	Output is correct
20	Correct	6 ms	888 KB	Output is correct
21	Correct	346 ms	1656 KB	Output is correct
22	Correct	438 ms	1900 KB	Output is correct
23	Correct	193 ms	1272 KB	Output is correct
24	Correct	748 ms	2252 KB	Output is correct
25	Correct	955 ms	2180 KB	Output is correct
26	Execution timed out	1075 ms	2388 KB	Time limit exceeded
27	Halted	0 ms	0 KB	-

답안 #167599

Compilation message

Subtask #1 6.0 / 6.0

Subtask #2 7.0 / 7.0

Subtask #3 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
0 / 15.0

Subtask #4
0 / 16.0

Subtask #5
0 / 21.0

Subtask #6
0 / 35.0