oj.uz

답안 #340384

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
340384 2020-12-27T13:39:39 Z balanda Bootfall (IZhO17_bootfall) C++17
28 / 100
 1000 ms 4460 KB 
/*
             _   _                    _           _                 _         __   _____ _____ _
            | | | |               _  | |         | |               | |       /  | |____ |  ___(_)
  __ _ _   _| |_| |__   ___  _ __(_) | |__   __ _| | __ _ _ __   __| | __ _  `| |     / /___ \ _  __ _
 / _` | | | | __| '_ \ / _ \| '__|   | '_ \ / _` | |/ _` | '_ \ / _` |/ _` |  | |     \ \   \ \ |/ _` |
| (_| | |_| | |_| | | | (_) | |   _  | |_) | (_| | | (_| | | | | (_| | (_| | _| |_.___/ /\__/ / | (_| |
 \__,_|\__,_|\__|_| |_|\___/|_|  (_) |_.__/ \__,_|_|\__,_|_| |_|\__,_|\__,_| \___/\____/\____/|_|\__, |
                                                                                                    | |
                                                                                                    |_|
  __ _  __ _   _ __ ___   __ ___   _________  ___
 / _` |/ _` | | '_ ` _ \ / _` \ \ / /_  / _ \/ __|
| (_| | (_| | | | | | | | (_| |\ V / / /  __/\__ \
 \__, |\__, | |_| |_| |_|\__,_| \_/ /___\___||___/
    | |   | |
    |_|   |_|
 * */
#include <bits/stdc++.h>

using namespace std;
#define endl '\n'
#define int long long

template<class T>
istream& operator>>(istream &in, vector<T> &v){
    for(auto &to: v) in >> to;
    return in;
}

template<class T>
ostream& operator<<(ostream &out, const vector<T> &v){
    for(auto &to: v) out << v << ' ';
    return out;
}


template<class U, class V>
istream& operator>>(istream &in, pair<U, V> &v){
    in >> v.first >> v.second;
    return in;
}

template<class U, class V>
ostream& operator<<(ostream &out, const pair<U, V> &v){
    out << v.first << ' ' << v.second;
    return out;
}

#ifdef DEBUG
#define dbg(x) cout << "debug:" << __LINE__ << ' ' << #x << "=" << x
#else
#define dbg(x) 42
#endif

int solve(){
    int n;
    cin >> n;
    vector<int> v(n);
    cin >> v;
    int sm = 0;
    for(int i = 0; i < n; i++)
        sm += v[i];
    vector<bitset<72902> > dpp(n + 1);
    vector<bitset<72902> > dps(n + 1);
    dpp[0][0] = 1;
    dps[n][0] = 1;
    for(int i = 1; i <= n; i++){
       dpp[i] = dpp[i - 1];
       dpp[i] |= (dpp[i - 1] << v[i - 1]);
    }
    for(int i = n - 1; i >= 0; i--){
        dps[i] = dps[i + 1];
        dps[i] |= (dps[i + 1] << v[i]);
    }
    if(!dpp[n][sm / 2]){
        cout << 0;
        return 0;
    }
    set<int> possible;
    for(int j = 1; j <= sm + 5; j++) {
        if(j % 2 != v[0] % 2) continue;
        possible.insert(j);
    }
    for(int i = 0; i < n; i++){
        bitset<72902> crr;
        for(int j = 0; j <= sm; j++){
            if(dpp[i][j])
                crr |= (dps[i + 1] << j);
        }
        vector<int> bad;
        for(auto to: possible){
            int full = (sm - v[i] + to);
            if(full % 2) bad.push_back(to);
            else if(!(crr[full / 2] && crr[full / 2 - to])){
                bad.push_back(to);
            }
        }
        for(auto to: bad) possible.erase(to);
    }
    cout << possible.size() << endl;
    for(auto to: possible){
        cout << to << ' ';
    }
    return 0;
}
signed main() {
#ifdef DEBUG
    freopen("input.txt", "r", stdin);
//        freopen("output.txt", "w", stdout);
#endif
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
//    cin >> t;
    while(t  --> 0){
        assert(solve() == 0);
        cout << endl;
    }
    return 0;
}

Subtask #1
6.0 / 6.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 6 ms 620 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 5 ms 620 KB Output is correct
9 Correct 3 ms 620 KB Output is correct
10 Correct 2 ms 876 KB Output is correct
11 Correct 11 ms 876 KB Output is correct
12 Correct 8 ms 876 KB Output is correct
13 Correct 9 ms 876 KB Output is correct
14 Correct 11 ms 876 KB Output is correct
15 Correct 8 ms 876 KB Output is correct
16 Correct 9 ms 876 KB Output is correct
17 Correct 4 ms 748 KB Output is correct
18 Correct 7 ms 748 KB Output is correct
19 Correct 7 ms 876 KB Output is correct
20 Correct 2 ms 876 KB Output is correct
21 Correct 261 ms 1772 KB Output is correct
22 Correct 342 ms 1832 KB Output is correct
23 Correct 146 ms 1260 KB Output is correct
24 Correct 535 ms 2284 KB Output is correct
25 Correct 605 ms 2412 KB Output is correct
26 Correct 726 ms 2540 KB Output is correct
27 Correct 475 ms 2540 KB Output is correct
28 Correct 368 ms 2540 KB Output is correct
29 Correct 395 ms 2540 KB Output is correct
30 Correct 664 ms 2412 KB Output is correct
31 Correct 919 ms 2412 KB Output is correct
32 Correct 644 ms 2284 KB Output is correct
33 Correct 17 ms 2540 KB Output is correct
34 Correct 18 ms 2540 KB Output is correct
35 Correct 343 ms 2508 KB Output is correct
36 Correct 594 ms 2412 KB Output is correct

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 6 ms 620 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 5 ms 620 KB Output is correct
9 Correct 3 ms 620 KB Output is correct
10 Correct 2 ms 876 KB Output is correct
11 Correct 11 ms 876 KB Output is correct
12 Correct 8 ms 876 KB Output is correct
13 Correct 9 ms 876 KB Output is correct
14 Correct 11 ms 876 KB Output is correct
15 Correct 8 ms 876 KB Output is correct
16 Correct 9 ms 876 KB Output is correct
17 Correct 4 ms 748 KB Output is correct
18 Correct 7 ms 748 KB Output is correct
19 Correct 7 ms 876 KB Output is correct
20 Correct 2 ms 876 KB Output is correct
21 Correct 261 ms 1772 KB Output is correct
22 Correct 342 ms 1832 KB Output is correct
23 Correct 146 ms 1260 KB Output is correct
24 Correct 535 ms 2284 KB Output is correct
25 Correct 605 ms 2412 KB Output is correct
26 Correct 726 ms 2540 KB Output is correct
27 Correct 475 ms 2540 KB Output is correct
28 Correct 368 ms 2540 KB Output is correct
29 Correct 395 ms 2540 KB Output is correct
30 Correct 664 ms 2412 KB Output is correct
31 Correct 919 ms 2412 KB Output is correct
32 Correct 644 ms 2284 KB Output is correct
33 Correct 17 ms 2540 KB Output is correct
34 Correct 18 ms 2540 KB Output is correct
35 Correct 343 ms 2508 KB Output is correct
36 Correct 594 ms 2412 KB Output is correct
37 Execution timed out 1093 ms 4460 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 6 ms 620 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 5 ms 620 KB Output is correct
9 Correct 3 ms 620 KB Output is correct
10 Correct 2 ms 876 KB Output is correct
11 Correct 11 ms 876 KB Output is correct
12 Correct 8 ms 876 KB Output is correct
13 Correct 9 ms 876 KB Output is correct
14 Correct 11 ms 876 KB Output is correct
15 Correct 8 ms 876 KB Output is correct
16 Correct 9 ms 876 KB Output is correct
17 Correct 4 ms 748 KB Output is correct
18 Correct 7 ms 748 KB Output is correct
19 Correct 7 ms 876 KB Output is correct
20 Correct 2 ms 876 KB Output is correct
21 Correct 261 ms 1772 KB Output is correct
22 Correct 342 ms 1832 KB Output is correct
23 Correct 146 ms 1260 KB Output is correct
24 Correct 535 ms 2284 KB Output is correct
25 Correct 605 ms 2412 KB Output is correct
26 Correct 726 ms 2540 KB Output is correct
27 Correct 475 ms 2540 KB Output is correct
28 Correct 368 ms 2540 KB Output is correct
29 Correct 395 ms 2540 KB Output is correct
30 Correct 664 ms 2412 KB Output is correct
31 Correct 919 ms 2412 KB Output is correct
32 Correct 644 ms 2284 KB Output is correct
33 Correct 17 ms 2540 KB Output is correct
34 Correct 18 ms 2540 KB Output is correct
35 Correct 343 ms 2508 KB Output is correct
36 Correct 594 ms 2412 KB Output is correct
37 Execution timed out 1093 ms 4460 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 6 ms 620 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 5 ms 620 KB Output is correct
9 Correct 3 ms 620 KB Output is correct
10 Correct 2 ms 876 KB Output is correct
11 Correct 11 ms 876 KB Output is correct
12 Correct 8 ms 876 KB Output is correct
13 Correct 9 ms 876 KB Output is correct
14 Correct 11 ms 876 KB Output is correct
15 Correct 8 ms 876 KB Output is correct
16 Correct 9 ms 876 KB Output is correct
17 Correct 4 ms 748 KB Output is correct
18 Correct 7 ms 748 KB Output is correct
19 Correct 7 ms 876 KB Output is correct
20 Correct 2 ms 876 KB Output is correct
21 Correct 261 ms 1772 KB Output is correct
22 Correct 342 ms 1832 KB Output is correct
23 Correct 146 ms 1260 KB Output is correct
24 Correct 535 ms 2284 KB Output is correct
25 Correct 605 ms 2412 KB Output is correct
26 Correct 726 ms 2540 KB Output is correct
27 Correct 475 ms 2540 KB Output is correct
28 Correct 368 ms 2540 KB Output is correct
29 Correct 395 ms 2540 KB Output is correct
30 Correct 664 ms 2412 KB Output is correct
31 Correct 919 ms 2412 KB Output is correct
32 Correct 644 ms 2284 KB Output is correct
33 Correct 17 ms 2540 KB Output is correct
34 Correct 18 ms 2540 KB Output is correct
35 Correct 343 ms 2508 KB Output is correct
36 Correct 594 ms 2412 KB Output is correct
37 Execution timed out 1093 ms 4460 KB Time limit exceeded
38 Halted 0 ms 0 KB -