oj.uz

답안 #665554

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
665554 2022-11-27T11:59:09 Z Astrayt Bootfall (IZhO17_bootfall) C++17
28 / 100
 1000 ms 206736 KB 
//君の手を握ってしまったら
//孤独を知らないこの街には
//もう二度と帰ってくることはできないのでしょう
//君が手を差し伸べた 光で影が生まれる
//歌って聞かせて この話の続き
//連れて行って見たことない星まで
//さユリ - 花の塔
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#define int ll
#define starburst ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define pii pair<int,int>
#define pb push_back
#define ff first
#define ss second
#define mp make_pair
#define maxn 200005
#define mod 1000000007
 
void solve(){
    int n, sum = 0; cin >> n;
    vector<int> v(n);
    for(auto &x:v) cin >> x, sum += x;
    sort(v.begin(), v.end());
    bitset<250005> dp;
    dp[0] = 1;
    for(int i = 0; i < n; ++i)
        dp |= (dp << v[i]);
    if(sum % 2 == 1 || dp[sum / 2] == 0){
        cout << "0\n";
        return;
    }
    set<int> tans[n], ans;
    for(int k = 0; k < n; k += 20){
        int nxt = min(k + 20, n);
        bitset<250005> cur;
        cur[0] = 1;
        for(int i = 0; i < k; ++i){
            cur |= (cur << v[i]);
        }
        for(int i = nxt; i < n; ++i){
            cur |= (cur << v[i]);
        }
        for(int j = k; j < nxt; ++j){
            bitset<250005> b = cur;
            for(int i = k; i < nxt; ++i){
                if(j == i) continue;
                b |= (b << v[i]);
            }
            for(int val = sum - v[j]; val >= 0; --val){
                if(b[val]) {
                    int t = val - (sum - val - v[j]);
                    if(t <= 0) break;
                    tans[j].insert(t), ans.insert(t);
                }
            }
        }
    }
    for(int i = 0; i < n; ++i){
        set<int> tmp;
        for(auto x:ans) if(tans[i].find(x) != tans[i].end()) tmp.insert(x);
        ans = tmp;
    }
    cout << ans.size() << '\n';
    for(auto x:ans) cout << x << ' ';
}
 
signed main(){
    starburst
    int t = 1; //cin >> t;
    while(t--) solve();
}

Subtask #1
6.0 / 6.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 4 ms 596 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 6 ms 468 KB Output is correct
11 Correct 6 ms 596 KB Output is correct
12 Correct 5 ms 596 KB Output is correct
13 Correct 5 ms 596 KB Output is correct
14 Correct 5 ms 596 KB Output is correct
15 Correct 6 ms 596 KB Output is correct
16 Correct 7 ms 596 KB Output is correct
17 Correct 3 ms 468 KB Output is correct
18 Correct 5 ms 596 KB Output is correct
19 Correct 5 ms 516 KB Output is correct
20 Correct 5 ms 468 KB Output is correct
21 Correct 42 ms 5252 KB Output is correct
22 Correct 51 ms 6468 KB Output is correct
23 Correct 27 ms 3244 KB Output is correct
24 Correct 87 ms 10632 KB Output is correct
25 Correct 143 ms 16216 KB Output is correct
26 Correct 142 ms 18552 KB Output is correct
27 Correct 85 ms 10056 KB Output is correct
28 Correct 77 ms 9076 KB Output is correct
29 Correct 84 ms 11364 KB Output is correct
30 Correct 77 ms 13024 KB Output is correct
31 Correct 143 ms 17816 KB Output is correct
32 Correct 105 ms 11692 KB Output is correct
33 Correct 24 ms 596 KB Output is correct
34 Correct 22 ms 672 KB Output is correct
35 Correct 58 ms 9716 KB Output is correct
36 Correct 96 ms 11532 KB Output is correct

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 4 ms 596 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 6 ms 468 KB Output is correct
11 Correct 6 ms 596 KB Output is correct
12 Correct 5 ms 596 KB Output is correct
13 Correct 5 ms 596 KB Output is correct
14 Correct 5 ms 596 KB Output is correct
15 Correct 6 ms 596 KB Output is correct
16 Correct 7 ms 596 KB Output is correct
17 Correct 3 ms 468 KB Output is correct
18 Correct 5 ms 596 KB Output is correct
19 Correct 5 ms 516 KB Output is correct
20 Correct 5 ms 468 KB Output is correct
21 Correct 42 ms 5252 KB Output is correct
22 Correct 51 ms 6468 KB Output is correct
23 Correct 27 ms 3244 KB Output is correct
24 Correct 87 ms 10632 KB Output is correct
25 Correct 143 ms 16216 KB Output is correct
26 Correct 142 ms 18552 KB Output is correct
27 Correct 85 ms 10056 KB Output is correct
28 Correct 77 ms 9076 KB Output is correct
29 Correct 84 ms 11364 KB Output is correct
30 Correct 77 ms 13024 KB Output is correct
31 Correct 143 ms 17816 KB Output is correct
32 Correct 105 ms 11692 KB Output is correct
33 Correct 24 ms 596 KB Output is correct
34 Correct 22 ms 672 KB Output is correct
35 Correct 58 ms 9716 KB Output is correct
36 Correct 96 ms 11532 KB Output is correct
37 Correct 848 ms 91364 KB Output is correct
38 Correct 837 ms 93684 KB Output is correct
39 Correct 91 ms 1916 KB Output is correct
40 Execution timed out 1106 ms 206736 KB Time limit exceeded
41 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 4 ms 596 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 6 ms 468 KB Output is correct
11 Correct 6 ms 596 KB Output is correct
12 Correct 5 ms 596 KB Output is correct
13 Correct 5 ms 596 KB Output is correct
14 Correct 5 ms 596 KB Output is correct
15 Correct 6 ms 596 KB Output is correct
16 Correct 7 ms 596 KB Output is correct
17 Correct 3 ms 468 KB Output is correct
18 Correct 5 ms 596 KB Output is correct
19 Correct 5 ms 516 KB Output is correct
20 Correct 5 ms 468 KB Output is correct
21 Correct 42 ms 5252 KB Output is correct
22 Correct 51 ms 6468 KB Output is correct
23 Correct 27 ms 3244 KB Output is correct
24 Correct 87 ms 10632 KB Output is correct
25 Correct 143 ms 16216 KB Output is correct
26 Correct 142 ms 18552 KB Output is correct
27 Correct 85 ms 10056 KB Output is correct
28 Correct 77 ms 9076 KB Output is correct
29 Correct 84 ms 11364 KB Output is correct
30 Correct 77 ms 13024 KB Output is correct
31 Correct 143 ms 17816 KB Output is correct
32 Correct 105 ms 11692 KB Output is correct
33 Correct 24 ms 596 KB Output is correct
34 Correct 22 ms 672 KB Output is correct
35 Correct 58 ms 9716 KB Output is correct
36 Correct 96 ms 11532 KB Output is correct
37 Correct 848 ms 91364 KB Output is correct
38 Correct 837 ms 93684 KB Output is correct
39 Correct 91 ms 1916 KB Output is correct
40 Execution timed out 1106 ms 206736 KB Time limit exceeded
41 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 4 ms 596 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 6 ms 468 KB Output is correct
11 Correct 6 ms 596 KB Output is correct
12 Correct 5 ms 596 KB Output is correct
13 Correct 5 ms 596 KB Output is correct
14 Correct 5 ms 596 KB Output is correct
15 Correct 6 ms 596 KB Output is correct
16 Correct 7 ms 596 KB Output is correct
17 Correct 3 ms 468 KB Output is correct
18 Correct 5 ms 596 KB Output is correct
19 Correct 5 ms 516 KB Output is correct
20 Correct 5 ms 468 KB Output is correct
21 Correct 42 ms 5252 KB Output is correct
22 Correct 51 ms 6468 KB Output is correct
23 Correct 27 ms 3244 KB Output is correct
24 Correct 87 ms 10632 KB Output is correct
25 Correct 143 ms 16216 KB Output is correct
26 Correct 142 ms 18552 KB Output is correct
27 Correct 85 ms 10056 KB Output is correct
28 Correct 77 ms 9076 KB Output is correct
29 Correct 84 ms 11364 KB Output is correct
30 Correct 77 ms 13024 KB Output is correct
31 Correct 143 ms 17816 KB Output is correct
32 Correct 105 ms 11692 KB Output is correct
33 Correct 24 ms 596 KB Output is correct
34 Correct 22 ms 672 KB Output is correct
35 Correct 58 ms 9716 KB Output is correct
36 Correct 96 ms 11532 KB Output is correct
37 Correct 848 ms 91364 KB Output is correct
38 Correct 837 ms 93684 KB Output is correct
39 Correct 91 ms 1916 KB Output is correct
40 Execution timed out 1106 ms 206736 KB Time limit exceeded
41 Halted 0 ms 0 KB -