oj.uz

Submission #333553

# Submission time Handle Problem Language Result Execution time Memory
333553 2020-12-07T03:48:08 Z talant117408 Bootfall (IZhO17_bootfall) C++17
28 / 100
 1000 ms 492 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;
}

int main(){
    do_not_disturb
    
    int n, i, j, k;
    cin >> n;
    int sum = 0;
    
    vector <int> v(n);
    for(auto &to : v) cin >> to;
    for(auto to : v) sum += to;
    
    if(sum&1){
        cout << 0 << endl;
        return 0;
    }
    
    vector <int> used(sum*2+14);
    vector <bool> dp(sum+7);
    dp[0] = 1;
    
    sort(all(v));
    
    for(i = 0; i < n; i++){
        for(j = sum; j; j--){
            if(v[i] > j) break;
            if(dp[j-v[i]]) dp[j] = 1;
        }
    }
    
    if(!dp[sum/2]){
        cout << 0 << endl;
        return 0;
    }
    
    for(k = 0; k < n; k++){
        for(j = sum-v[k]; j; j--){
            dp[j] = 0;
        }
        for(i = 0; i < n; i++){
            if(i == k) continue;
            for(j = sum-v[k]; j; j--){
                if(v[i] > j) break;
                if(dp[j-v[i]]) dp[j] = 1;
            }
        }
        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]]++;
            }
        }
    }
    
    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

# Verdict Execution time Memory 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 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory 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 364 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 2 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 36 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory 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 364 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 2 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 36 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 20 ms 364 KB Output is correct
22 Correct 31 ms 364 KB Output is correct
23 Correct 10 ms 364 KB Output is correct
24 Correct 62 ms 364 KB Output is correct
25 Correct 110 ms 492 KB Output is correct
26 Correct 129 ms 492 KB Output is correct
27 Correct 104 ms 492 KB Output is correct
28 Correct 113 ms 492 KB Output is correct
29 Correct 115 ms 364 KB Output is correct
30 Correct 82 ms 364 KB Output is correct
31 Correct 123 ms 492 KB Output is correct
32 Correct 74 ms 384 KB Output is correct
33 Correct 112 ms 364 KB Output is correct
34 Correct 106 ms 364 KB Output is correct
35 Correct 113 ms 492 KB Output is correct
36 Correct 70 ms 364 KB Output is correct

Subtask #4
0 / 16.0

# Verdict Execution time Memory 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 364 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 2 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 36 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 20 ms 364 KB Output is correct
22 Correct 31 ms 364 KB Output is correct
23 Correct 10 ms 364 KB Output is correct
24 Correct 62 ms 364 KB Output is correct
25 Correct 110 ms 492 KB Output is correct
26 Correct 129 ms 492 KB Output is correct
27 Correct 104 ms 492 KB Output is correct
28 Correct 113 ms 492 KB Output is correct
29 Correct 115 ms 364 KB Output is correct
30 Correct 82 ms 364 KB Output is correct
31 Correct 123 ms 492 KB Output is correct
32 Correct 74 ms 384 KB Output is correct
33 Correct 112 ms 364 KB Output is correct
34 Correct 106 ms 364 KB Output is correct
35 Correct 113 ms 492 KB Output is correct
36 Correct 70 ms 364 KB Output is correct
37 Execution timed out 1091 ms 492 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory 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 364 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 2 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 36 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 20 ms 364 KB Output is correct
22 Correct 31 ms 364 KB Output is correct
23 Correct 10 ms 364 KB Output is correct
24 Correct 62 ms 364 KB Output is correct
25 Correct 110 ms 492 KB Output is correct
26 Correct 129 ms 492 KB Output is correct
27 Correct 104 ms 492 KB Output is correct
28 Correct 113 ms 492 KB Output is correct
29 Correct 115 ms 364 KB Output is correct
30 Correct 82 ms 364 KB Output is correct
31 Correct 123 ms 492 KB Output is correct
32 Correct 74 ms 384 KB Output is correct
33 Correct 112 ms 364 KB Output is correct
34 Correct 106 ms 364 KB Output is correct
35 Correct 113 ms 492 KB Output is correct
36 Correct 70 ms 364 KB Output is correct
37 Execution timed out 1091 ms 492 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory 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 364 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 2 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 36 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 20 ms 364 KB Output is correct
22 Correct 31 ms 364 KB Output is correct
23 Correct 10 ms 364 KB Output is correct
24 Correct 62 ms 364 KB Output is correct
25 Correct 110 ms 492 KB Output is correct
26 Correct 129 ms 492 KB Output is correct
27 Correct 104 ms 492 KB Output is correct
28 Correct 113 ms 492 KB Output is correct
29 Correct 115 ms 364 KB Output is correct
30 Correct 82 ms 364 KB Output is correct
31 Correct 123 ms 492 KB Output is correct
32 Correct 74 ms 384 KB Output is correct
33 Correct 112 ms 364 KB Output is correct
34 Correct 106 ms 364 KB Output is correct
35 Correct 113 ms 492 KB Output is correct
36 Correct 70 ms 364 KB Output is correct
37 Execution timed out 1091 ms 492 KB Time limit exceeded
38 Halted 0 ms 0 KB -