oj.uz

Submission #664171

# Submission time Handle Problem Language Result Execution time Memory
664171 2022-11-27T06:35:53 Z Astrayt Bootfall (IZhO17_bootfall) C++17
28 / 100
 1000 ms 54436 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());
    vector<vector<int>> dp(2, vector<int>(sum + 1, 0));
    dp[0][0] = 1;
    for(int i = 0; i < n; ++i){
        dp[1].assign(sum + 1, 0);
        for(int j = 0; j <= sum; ++j){
            dp[1][j] |= dp[0][j];
            if(j >= v[i]) dp[1][j] |= dp[0][j - v[i]];
        }
        dp[0] = dp[1];
    }
    if(sum % 2 == 1 || dp[1][sum / 2] == 0){
        cout << "0\n";
        return;
    }
    set<int> tans[n], ans;
    for(int k = 0; k < n; ++k){
        dp[0].assign(sum - v[k] + 1, 0);
        dp[1].assign(sum - v[k] + 1, 0);
        dp[0][0] = 1;
        for(int i = 0; i < n; ++i){
            if(i == k) continue;
            dp[1].assign(sum + 1, 0);
            for(int j = 0; j <= sum - v[k]; ++j){
                dp[1][j] |= dp[0][j];
                if(j >= v[i]) dp[1][j] |= dp[0][j - v[i]];
            }
            dp[0] = dp[1];
        }
        for(int val = sum - v[k]; val >= 0; --val){
            if(dp[1][val]) {
                int t = val - (sum - val - v[k]);
                if(t <= 0) break;
                tans[k].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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 1 ms 340 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 2 ms 340 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 56 ms 5108 KB Output is correct
22 Correct 70 ms 6340 KB Output is correct
23 Correct 28 ms 3044 KB Output is correct
24 Correct 162 ms 10544 KB Output is correct
25 Correct 251 ms 16260 KB Output is correct
26 Correct 300 ms 18480 KB Output is correct
27 Correct 233 ms 9972 KB Output is correct
28 Correct 265 ms 9032 KB Output is correct
29 Correct 245 ms 11280 KB Output is correct
30 Correct 139 ms 12892 KB Output is correct
31 Correct 295 ms 17684 KB Output is correct
32 Correct 173 ms 11476 KB Output is correct
33 Correct 189 ms 544 KB Output is correct
34 Correct 180 ms 540 KB Output is correct
35 Correct 213 ms 9676 KB Output is correct
36 Correct 176 ms 11372 KB Output is correct

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 56 ms 5108 KB Output is correct
22 Correct 70 ms 6340 KB Output is correct
23 Correct 28 ms 3044 KB Output is correct
24 Correct 162 ms 10544 KB Output is correct
25 Correct 251 ms 16260 KB Output is correct
26 Correct 300 ms 18480 KB Output is correct
27 Correct 233 ms 9972 KB Output is correct
28 Correct 265 ms 9032 KB Output is correct
29 Correct 245 ms 11280 KB Output is correct
30 Correct 139 ms 12892 KB Output is correct
31 Correct 295 ms 17684 KB Output is correct
32 Correct 173 ms 11476 KB Output is correct
33 Correct 189 ms 544 KB Output is correct
34 Correct 180 ms 540 KB Output is correct
35 Correct 213 ms 9676 KB Output is correct
36 Correct 176 ms 11372 KB Output is correct
37 Execution timed out 1090 ms 54436 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 56 ms 5108 KB Output is correct
22 Correct 70 ms 6340 KB Output is correct
23 Correct 28 ms 3044 KB Output is correct
24 Correct 162 ms 10544 KB Output is correct
25 Correct 251 ms 16260 KB Output is correct
26 Correct 300 ms 18480 KB Output is correct
27 Correct 233 ms 9972 KB Output is correct
28 Correct 265 ms 9032 KB Output is correct
29 Correct 245 ms 11280 KB Output is correct
30 Correct 139 ms 12892 KB Output is correct
31 Correct 295 ms 17684 KB Output is correct
32 Correct 173 ms 11476 KB Output is correct
33 Correct 189 ms 544 KB Output is correct
34 Correct 180 ms 540 KB Output is correct
35 Correct 213 ms 9676 KB Output is correct
36 Correct 176 ms 11372 KB Output is correct
37 Execution timed out 1090 ms 54436 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 56 ms 5108 KB Output is correct
22 Correct 70 ms 6340 KB Output is correct
23 Correct 28 ms 3044 KB Output is correct
24 Correct 162 ms 10544 KB Output is correct
25 Correct 251 ms 16260 KB Output is correct
26 Correct 300 ms 18480 KB Output is correct
27 Correct 233 ms 9972 KB Output is correct
28 Correct 265 ms 9032 KB Output is correct
29 Correct 245 ms 11280 KB Output is correct
30 Correct 139 ms 12892 KB Output is correct
31 Correct 295 ms 17684 KB Output is correct
32 Correct 173 ms 11476 KB Output is correct
33 Correct 189 ms 544 KB Output is correct
34 Correct 180 ms 540 KB Output is correct
35 Correct 213 ms 9676 KB Output is correct
36 Correct 176 ms 11372 KB Output is correct
37 Execution timed out 1090 ms 54436 KB Time limit exceeded
38 Halted 0 ms 0 KB -