oj.uz

답안 #333619

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
333619 2020-12-07T08:41:52 Z talant117408 Bootfall (IZhO17_bootfall) C++17
100 / 100
 301 ms 3560 KB 
/*
    Code written by Talant I.D.
*/
  
#include <bits/stdc++.h>
  
using namespace std;
  
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
  
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) int((v).size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define OK cout << "OK" << endl;
  
inline bool isvowel(char ch){
    ch = tolower(ch);
    return (ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u');
}
  
inline bool isprime(int n){
    if(n < 2 || (n%2 == 0 && n != 2)) return false;
    for(int i = 3; i*i <= n; i++)
        if(n%i == 0) return false;
    return true;
}
 
class Union{
    private:
        vector <int> saizu, link;
    public:
        Union(int n){
            saizu.assign(n, 1); link.resize(n); 
            iota(all(link), 0);
        }
        int find(int n){
            if(link[n] == n) return n;
            return link[n] = find(link[n]);
        }
        int same(int a, int b){
            return find(a) == find(b);
        }
        void unite(int a, int b){
            if(same(a, b)) return;
             
            a = find(a); b = find(b);
            if(saizu[a] < saizu[b]) swap(a, b);
             
            saizu[a] += saizu[b];
            link[b] = a;
        }
        int getsize(int a){
            return saizu[find(a)];
        }
};
 
const int mod = 1e9+7;
 
ll mode(ll a){
    a %= mod;
    if(a < 0) a += mod;
    return a;
}
 
ll subt(ll a, ll b){
    return mode(mode(a)-mode(b));
}
 
ll add(ll a, ll b){
    return mode(mode(a)+mode(b));
}
 
ll mult(ll a, ll b){
    return mode(mode(a)*mode(b));
}
 
ll binpow(ll a, ll b){
    ll res = 1;
    while(b){
        if(b&1) res = mult(res, a);
        a = mult(a, a);
        b >>= 1;
    }
    return res;
}

const int N = 250007;
int used[N*2], dp[N];

int main(){
    do_not_disturb
    
    int n, i, j, k;
    cin >> n;
    int sum = 0;
    
    vector <int> v(n+1);
    for(i = 1; i <= n; i++){
        cin >> v[i];
        sum += v[i];
    }
    sort(all(v));
    
    dp[0] = 1;
    for(i = 1; i <= n; i++){
        for(j = sum; j; j--){
            if(v[i] > j) break;
            dp[j] += dp[j-v[i]];
        }
    }
    
    if(sum&1 || !dp[sum/2]){
        cout << 0 << endl;
        return 0;
    }
    
    for(k = 1; k <= n; k++){
        for(j = v[k]; j <= sum; j++){
            dp[j] -= dp[j-v[k]];
        }
        for(j = (sum-v[k])/2; j <= sum-v[k]; j++){
            if(dp[j] && j*2 > sum-v[k]){
                used[j*2-sum+v[k]]++;
            }
        }
        for(j = sum; j >= v[k]; j--){
            dp[j] += dp[j-v[k]];
        }
    }
    
    vector <int> ans;
    for(i = 1; i <= sum; i++){
        if(used[i] == n) ans.pb(i);
    }
    cout << sz(ans) << endl;
    for(auto to : ans) cout << to << ' ';
    
    return 0;
}

Subtask #1
6.0 / 6.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 2 ms 492 KB Output is correct
25 Correct 3 ms 492 KB Output is correct
26 Correct 3 ms 492 KB Output is correct
27 Correct 3 ms 492 KB Output is correct
28 Correct 3 ms 492 KB Output is correct
29 Correct 3 ms 492 KB Output is correct
30 Correct 2 ms 364 KB Output is correct
31 Correct 3 ms 492 KB Output is correct
32 Correct 2 ms 492 KB Output is correct
33 Correct 3 ms 492 KB Output is correct
34 Correct 3 ms 492 KB Output is correct
35 Correct 3 ms 364 KB Output is correct
36 Correct 2 ms 492 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 2 ms 492 KB Output is correct
25 Correct 3 ms 492 KB Output is correct
26 Correct 3 ms 492 KB Output is correct
27 Correct 3 ms 492 KB Output is correct
28 Correct 3 ms 492 KB Output is correct
29 Correct 3 ms 492 KB Output is correct
30 Correct 2 ms 364 KB Output is correct
31 Correct 3 ms 492 KB Output is correct
32 Correct 2 ms 492 KB Output is correct
33 Correct 3 ms 492 KB Output is correct
34 Correct 3 ms 492 KB Output is correct
35 Correct 3 ms 364 KB Output is correct
36 Correct 2 ms 492 KB Output is correct
37 Correct 11 ms 620 KB Output is correct
38 Correct 11 ms 620 KB Output is correct
39 Correct 37 ms 876 KB Output is correct
40 Correct 22 ms 876 KB Output is correct
41 Correct 45 ms 876 KB Output is correct
42 Correct 20 ms 748 KB Output is correct
43 Correct 34 ms 1132 KB Output is correct
44 Correct 35 ms 1172 KB Output is correct
45 Correct 37 ms 1132 KB Output is correct
46 Correct 20 ms 620 KB Output is correct
47 Correct 21 ms 876 KB Output is correct
48 Correct 38 ms 1132 KB Output is correct
49 Correct 36 ms 876 KB Output is correct
50 Correct 26 ms 876 KB Output is correct
51 Correct 6 ms 492 KB Output is correct
52 Correct 47 ms 1260 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 2 ms 492 KB Output is correct
25 Correct 3 ms 492 KB Output is correct
26 Correct 3 ms 492 KB Output is correct
27 Correct 3 ms 492 KB Output is correct
28 Correct 3 ms 492 KB Output is correct
29 Correct 3 ms 492 KB Output is correct
30 Correct 2 ms 364 KB Output is correct
31 Correct 3 ms 492 KB Output is correct
32 Correct 2 ms 492 KB Output is correct
33 Correct 3 ms 492 KB Output is correct
34 Correct 3 ms 492 KB Output is correct
35 Correct 3 ms 364 KB Output is correct
36 Correct 2 ms 492 KB Output is correct
37 Correct 11 ms 620 KB Output is correct
38 Correct 11 ms 620 KB Output is correct
39 Correct 37 ms 876 KB Output is correct
40 Correct 22 ms 876 KB Output is correct
41 Correct 45 ms 876 KB Output is correct
42 Correct 20 ms 748 KB Output is correct
43 Correct 34 ms 1132 KB Output is correct
44 Correct 35 ms 1172 KB Output is correct
45 Correct 37 ms 1132 KB Output is correct
46 Correct 20 ms 620 KB Output is correct
47 Correct 21 ms 876 KB Output is correct
48 Correct 38 ms 1132 KB Output is correct
49 Correct 36 ms 876 KB Output is correct
50 Correct 26 ms 876 KB Output is correct
51 Correct 6 ms 492 KB Output is correct
52 Correct 47 ms 1260 KB Output is correct
53 Correct 35 ms 1004 KB Output is correct
54 Correct 48 ms 1132 KB Output is correct
55 Correct 101 ms 2032 KB Output is correct
56 Correct 43 ms 1132 KB Output is correct
57 Correct 102 ms 1924 KB Output is correct
58 Correct 53 ms 1260 KB Output is correct
59 Correct 65 ms 1392 KB Output is correct
60 Correct 15 ms 620 KB Output is correct
61 Correct 75 ms 1520 KB Output is correct
62 Correct 75 ms 1776 KB Output is correct
63 Correct 81 ms 1776 KB Output is correct
64 Correct 79 ms 1776 KB Output is correct
65 Correct 41 ms 748 KB Output is correct
66 Correct 38 ms 876 KB Output is correct

Subtask #6
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 2 ms 492 KB Output is correct
25 Correct 3 ms 492 KB Output is correct
26 Correct 3 ms 492 KB Output is correct
27 Correct 3 ms 492 KB Output is correct
28 Correct 3 ms 492 KB Output is correct
29 Correct 3 ms 492 KB Output is correct
30 Correct 2 ms 364 KB Output is correct
31 Correct 3 ms 492 KB Output is correct
32 Correct 2 ms 492 KB Output is correct
33 Correct 3 ms 492 KB Output is correct
34 Correct 3 ms 492 KB Output is correct
35 Correct 3 ms 364 KB Output is correct
36 Correct 2 ms 492 KB Output is correct
37 Correct 11 ms 620 KB Output is correct
38 Correct 11 ms 620 KB Output is correct
39 Correct 37 ms 876 KB Output is correct
40 Correct 22 ms 876 KB Output is correct
41 Correct 45 ms 876 KB Output is correct
42 Correct 20 ms 748 KB Output is correct
43 Correct 34 ms 1132 KB Output is correct
44 Correct 35 ms 1172 KB Output is correct
45 Correct 37 ms 1132 KB Output is correct
46 Correct 20 ms 620 KB Output is correct
47 Correct 21 ms 876 KB Output is correct
48 Correct 38 ms 1132 KB Output is correct
49 Correct 36 ms 876 KB Output is correct
50 Correct 26 ms 876 KB Output is correct
51 Correct 6 ms 492 KB Output is correct
52 Correct 47 ms 1260 KB Output is correct
53 Correct 35 ms 1004 KB Output is correct
54 Correct 48 ms 1132 KB Output is correct
55 Correct 101 ms 2032 KB Output is correct
56 Correct 43 ms 1132 KB Output is correct
57 Correct 102 ms 1924 KB Output is correct
58 Correct 53 ms 1260 KB Output is correct
59 Correct 65 ms 1392 KB Output is correct
60 Correct 15 ms 620 KB Output is correct
61 Correct 75 ms 1520 KB Output is correct
62 Correct 75 ms 1776 KB Output is correct
63 Correct 81 ms 1776 KB Output is correct
64 Correct 79 ms 1776 KB Output is correct
65 Correct 41 ms 748 KB Output is correct
66 Correct 38 ms 876 KB Output is correct
67 Correct 78 ms 1520 KB Output is correct
68 Correct 42 ms 1004 KB Output is correct
69 Correct 301 ms 3304 KB Output is correct
70 Correct 156 ms 2284 KB Output is correct
71 Correct 148 ms 2156 KB Output is correct
72 Correct 146 ms 1388 KB Output is correct
73 Correct 145 ms 1388 KB Output is correct
74 Correct 268 ms 3560 KB Output is correct
75 Correct 211 ms 2792 KB Output is correct
76 Correct 294 ms 3536 KB Output is correct
77 Correct 283 ms 3540 KB Output is correct