답안 #664112

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
664112	2022-11-27T06:22:17 Z	Astrayt	Bootfall (IZhO17_bootfall)	C++17	28 / 100	1000 ms	61376 KB

bootfall

//君の手を握ってしまったら
//孤独を知らないこの街には
//もう二度と帰ってくることはできないのでしょう
//君が手を差し伸べた 光で影が生まれる
//歌って聞かせて この話の続き
//連れて行って見たことない星まで
//さユリ - 花の塔
#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 + 1, 0);
        dp[1].assign(sum + 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; ++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

#	결과	실행 시간	메모리	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	0 ms	212 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	0 ms	340 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

#	결과	실행 시간	메모리	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	0 ms	212 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	0 ms	340 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	1 ms	340 KB	Output is correct
13	Correct	1 ms	468 KB	Output is correct
14	Correct	2 ms	468 KB	Output is correct
15	Correct	1 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	1 ms	340 KB	Output is correct

Subtask #3
15.0 / 15.0

#	결과	실행 시간	메모리	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	0 ms	212 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	0 ms	340 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	1 ms	340 KB	Output is correct
13	Correct	1 ms	468 KB	Output is correct
14	Correct	2 ms	468 KB	Output is correct
15	Correct	1 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	1 ms	340 KB	Output is correct
21	Correct	53 ms	5080 KB	Output is correct
22	Correct	101 ms	6344 KB	Output is correct
23	Correct	27 ms	3020 KB	Output is correct
24	Correct	140 ms	10548 KB	Output is correct
25	Correct	238 ms	16244 KB	Output is correct
26	Correct	276 ms	18552 KB	Output is correct
27	Correct	215 ms	10112 KB	Output is correct
28	Correct	215 ms	9044 KB	Output is correct
29	Correct	242 ms	11292 KB	Output is correct
30	Correct	140 ms	12948 KB	Output is correct
31	Correct	251 ms	17700 KB	Output is correct
32	Correct	163 ms	11616 KB	Output is correct
33	Correct	172 ms	716 KB	Output is correct
34	Correct	161 ms	588 KB	Output is correct
35	Correct	211 ms	9800 KB	Output is correct
36	Correct	150 ms	11448 KB	Output is correct

Subtask #4
0 / 16.0

#	결과	실행 시간	메모리	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	0 ms	212 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	0 ms	340 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	1 ms	340 KB	Output is correct
13	Correct	1 ms	468 KB	Output is correct
14	Correct	2 ms	468 KB	Output is correct
15	Correct	1 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	1 ms	340 KB	Output is correct
21	Correct	53 ms	5080 KB	Output is correct
22	Correct	101 ms	6344 KB	Output is correct
23	Correct	27 ms	3020 KB	Output is correct
24	Correct	140 ms	10548 KB	Output is correct
25	Correct	238 ms	16244 KB	Output is correct
26	Correct	276 ms	18552 KB	Output is correct
27	Correct	215 ms	10112 KB	Output is correct
28	Correct	215 ms	9044 KB	Output is correct
29	Correct	242 ms	11292 KB	Output is correct
30	Correct	140 ms	12948 KB	Output is correct
31	Correct	251 ms	17700 KB	Output is correct
32	Correct	163 ms	11616 KB	Output is correct
33	Correct	172 ms	716 KB	Output is correct
34	Correct	161 ms	588 KB	Output is correct
35	Correct	211 ms	9800 KB	Output is correct
36	Correct	150 ms	11448 KB	Output is correct
37	Execution timed out	1095 ms	61376 KB	Time limit exceeded
38	Halted	0 ms	0 KB	-

Subtask #5
0 / 21.0

#	결과	실행 시간	메모리	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	0 ms	212 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	0 ms	340 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	1 ms	340 KB	Output is correct
13	Correct	1 ms	468 KB	Output is correct
14	Correct	2 ms	468 KB	Output is correct
15	Correct	1 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	1 ms	340 KB	Output is correct
21	Correct	53 ms	5080 KB	Output is correct
22	Correct	101 ms	6344 KB	Output is correct
23	Correct	27 ms	3020 KB	Output is correct
24	Correct	140 ms	10548 KB	Output is correct
25	Correct	238 ms	16244 KB	Output is correct
26	Correct	276 ms	18552 KB	Output is correct
27	Correct	215 ms	10112 KB	Output is correct
28	Correct	215 ms	9044 KB	Output is correct
29	Correct	242 ms	11292 KB	Output is correct
30	Correct	140 ms	12948 KB	Output is correct
31	Correct	251 ms	17700 KB	Output is correct
32	Correct	163 ms	11616 KB	Output is correct
33	Correct	172 ms	716 KB	Output is correct
34	Correct	161 ms	588 KB	Output is correct
35	Correct	211 ms	9800 KB	Output is correct
36	Correct	150 ms	11448 KB	Output is correct
37	Execution timed out	1095 ms	61376 KB	Time limit exceeded
38	Halted	0 ms	0 KB	-

Subtask #6
0 / 35.0

#	결과	실행 시간	메모리	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	0 ms	212 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	0 ms	340 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	1 ms	340 KB	Output is correct
13	Correct	1 ms	468 KB	Output is correct
14	Correct	2 ms	468 KB	Output is correct
15	Correct	1 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	1 ms	340 KB	Output is correct
21	Correct	53 ms	5080 KB	Output is correct
22	Correct	101 ms	6344 KB	Output is correct
23	Correct	27 ms	3020 KB	Output is correct
24	Correct	140 ms	10548 KB	Output is correct
25	Correct	238 ms	16244 KB	Output is correct
26	Correct	276 ms	18552 KB	Output is correct
27	Correct	215 ms	10112 KB	Output is correct
28	Correct	215 ms	9044 KB	Output is correct
29	Correct	242 ms	11292 KB	Output is correct
30	Correct	140 ms	12948 KB	Output is correct
31	Correct	251 ms	17700 KB	Output is correct
32	Correct	163 ms	11616 KB	Output is correct
33	Correct	172 ms	716 KB	Output is correct
34	Correct	161 ms	588 KB	Output is correct
35	Correct	211 ms	9800 KB	Output is correct
36	Correct	150 ms	11448 KB	Output is correct
37	Execution timed out	1095 ms	61376 KB	Time limit exceeded
38	Halted	0 ms	0 KB	-

답안 #664112

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