oj.uz

Submission #248576

# Submission time Handle Problem Language Result Execution time Memory
248576 2020-07-12T18:47:47 Z rqi Bootfall (IZhO17_bootfall) C++14
100 / 100
 925 ms 3804 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef double db; 
typedef string str; 
 
typedef pair<int,int> pi;
typedef pair<ll,ll> pl; 
typedef pair<db,db> pd; 
 
typedef vector<int> vi; 
typedef vector<ll> vl; 
typedef vector<db> vd; 
typedef vector<str> vs; 
typedef vector<pi> vpi;
typedef vector<pl> vpl; 
typedef vector<pd> vpd; 
 
#define mp make_pair
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend() 
#define rsz resize
#define ins insert 
#define ft front() 
#define bk back()
#define pf push_front 
#define pb push_back
#define eb emplace_back 
#define lb lower_bound 
#define ub upper_bound 
 
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)
 
const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5; 
const ll INF = 1e18; 
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; 
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 
 
template<class T> bool ckmin(T& a, const T& b) { 
    return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { 
    return a < b ? a = b, 1 : 0; } 
int pct(int x) { return __builtin_popcount(x); } 
int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
int cdiv(int a, int b) { return a/b+!(a<0||a%b == 0); } // division of a by b rounded up, assumes b > 0 
int fstTrue(function<bool(int)> f, int lo, int hi) {
    hi ++; assert(lo <= hi); // assuming f is increasing
    while (lo < hi) { // find first index such that f is true 
        int mid = (lo+hi)/2; 
        f(mid) ? hi = mid : lo = mid+1; 
    } 
    return lo;
}
 
// INPUT
template<class A> void re(complex<A>& c);
template<class A, class B> void re(pair<A,B>& p);
template<class A> void re(vector<A>& v);
template<class A, size_t SZ> void re(array<A,SZ>& a);
 
template<class T> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }
 
template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; }
template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); }
template<class A> void re(vector<A>& x) { trav(a,x) re(a); }
template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); }
 
// TO_STRING
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(bool b) { return b ? "true" : "false"; }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
template<class A> str ts(complex<A> c) { 
    stringstream ss; ss << c; return ss.str(); }
str ts(vector<bool> v) { 
    str res = "{"; F0R(i,sz(v)) res += char('0'+v[i]);
    res += "}"; return res; }
template<size_t SZ> str ts(bitset<SZ> b) {
    str res = ""; F0R(i,SZ) res += char('0'+b[i]);
    return res; }
template<class A, class B> str ts(pair<A,B> p);
template<class T> str ts(T v) { // containers with begin(), end()
    bool fst = 1; str res = "{";
    for (const auto& x: v) {
        if (!fst) res += ", ";
        fst = 0; res += ts(x);
    }
    res += "}"; return res;
}
template<class A, class B> str ts(pair<A,B> p) {
    return "("+ts(p.f)+", "+ts(p.s)+")"; }
 
// OUTPUT
template<class A> void pr(A x) { cout << ts(x); }
template<class H, class... T> void pr(const H& h, const T&... t) { 
    pr(h); pr(t...); }
void ps() { pr("\n"); } // print w/ spaces
template<class H, class... T> void ps(const H& h, const T&... t) { 
    pr(h); if (sizeof...(t)) pr(" "); ps(t...); }
 
// DEBUG
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
    cerr << ts(h); if (sizeof...(t)) cerr << ", ";
    DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif
 
// FILE I/O
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); }
void setIO(string s = "") {
    unsyncIO();
    // cin.exceptions(cin.failbit); 
    // throws exception when do smth illegal
    // ex. try to read letter into int
    if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}


const int mx1 = 500;
const int mx2 = 250000;
 
const int MOD1 = 999999733;
const int MOD2 = 1000000181;

// typedef pi T;
// const T ID = mp(0, 0);
// const T ONE = mp(1, 1);
// void ad(T &a, T &b){
//     a.f = (ll(a.f)+ll(b.f)) % MOD1;
//     a.s = (ll(a.s)+ll(b.s)) % MOD2;
// }
// void sub(T &a, T &b){
//     a.f = (ll(a.f)-ll(b.f)+MOD1) % MOD1;
//     a.s = (ll(a.s)-ll(b.s)+MOD2) % MOD2;
// }

typedef int T;
const T ID = 0;
const T ONE = 1;
void ad(T &a, T &b){
    a = (ll(a)+ll(b)) % MOD1;
}
void sub(T &a, T &b){
    a = (ll(a)-ll(b)+MOD1) % MOD1;
}

 
T tot[mx2+5];
T exc[mx2+5];
int a[mx1+5];
bitset<mx2+5> ans; //possible answers
 

 
int main() {
    setIO();
    int N;
    cin >> N;
    int sum = 0;
    for(int i = 1; i <= N; i++){
        cin >> a[i];
        sum+=a[i];
    }
 
    
    tot[0] = ONE;
    for(int i = 1; i <= N; i++){
        for(int j = mx2; j >= 0; j--){
            if(a[i] > j) continue;
            ad(tot[j], tot[j-a[i]]);
        }
    }
 
    if(sum % 2 == 1 || tot[sum/2] == ID){
        ps(0);
        return 0;
    }
    
    tot[0] = ONE;
 
    
 
    for(int i = 0; i <= mx2; i++){
        ans[i] = 1;
    }
 
    bitset<mx2+5> works;
    for(int i = 1; i <= N; i++){
        for(int j = 0; j <= mx2; j++){
            exc[j] = tot[j];
        }
        for(int j = 0; j <= mx2; j++){
            works[j] = 0;
            if(j-a[i] >= 0) sub(exc[j], exc[j-a[i]]);
        }
        
        for(int j = 0; j <= mx2; j++){
            int x = j*2-sum+a[i];
            if(exc[j] != ID && x >= 0 && x <= mx2){
                works[x] = 1;
            }
        }
        ans&=works;
    }
 
    vi anses;
    for(int i = 1; i <= mx2; i++){
        if(ans[i] == 1) anses.pb(i);
    }
 
    ps(sz(anses));
    for(auto u: anses){
        cout << u << " ";
    }
    cout << "\n";
 
 
 
 
    // you should actually read the stuff at the bottom
}
 
/* stuff you should look for
    * int overflow, array bounds
    * special cases (n=1?)
    * do smth instead of nothing and stay organized
    * WRITE STUFF DOWN
*/

Compilation message

bootfall.cpp: In function 'void setIn(std::__cxx11::string)':
bootfall.cpp:128:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
bootfall.cpp: In function 'void setOut(std::__cxx11::string)':
bootfall.cpp:129:32: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 2304 KB Output is correct
2 Correct 12 ms 2304 KB Output is correct
3 Correct 3 ms 1280 KB Output is correct
4 Correct 10 ms 2304 KB Output is correct
5 Correct 23 ms 2304 KB Output is correct
6 Correct 16 ms 2304 KB Output is correct
7 Correct 13 ms 2304 KB Output is correct
8 Correct 23 ms 2396 KB Output is correct
9 Correct 19 ms 2304 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 2304 KB Output is correct
2 Correct 12 ms 2304 KB Output is correct
3 Correct 3 ms 1280 KB Output is correct
4 Correct 10 ms 2304 KB Output is correct
5 Correct 23 ms 2304 KB Output is correct
6 Correct 16 ms 2304 KB Output is correct
7 Correct 13 ms 2304 KB Output is correct
8 Correct 23 ms 2396 KB Output is correct
9 Correct 19 ms 2304 KB Output is correct
10 Correct 53 ms 2304 KB Output is correct
11 Correct 61 ms 2520 KB Output is correct
12 Correct 54 ms 2304 KB Output is correct
13 Correct 52 ms 2304 KB Output is correct
14 Correct 50 ms 2296 KB Output is correct
15 Correct 52 ms 2396 KB Output is correct
16 Correct 57 ms 2304 KB Output is correct
17 Correct 36 ms 2400 KB Output is correct
18 Correct 43 ms 2304 KB Output is correct
19 Correct 46 ms 2304 KB Output is correct
20 Correct 53 ms 2304 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 2304 KB Output is correct
2 Correct 12 ms 2304 KB Output is correct
3 Correct 3 ms 1280 KB Output is correct
4 Correct 10 ms 2304 KB Output is correct
5 Correct 23 ms 2304 KB Output is correct
6 Correct 16 ms 2304 KB Output is correct
7 Correct 13 ms 2304 KB Output is correct
8 Correct 23 ms 2396 KB Output is correct
9 Correct 19 ms 2304 KB Output is correct
10 Correct 53 ms 2304 KB Output is correct
11 Correct 61 ms 2520 KB Output is correct
12 Correct 54 ms 2304 KB Output is correct
13 Correct 52 ms 2304 KB Output is correct
14 Correct 50 ms 2296 KB Output is correct
15 Correct 52 ms 2396 KB Output is correct
16 Correct 57 ms 2304 KB Output is correct
17 Correct 36 ms 2400 KB Output is correct
18 Correct 43 ms 2304 KB Output is correct
19 Correct 46 ms 2304 KB Output is correct
20 Correct 53 ms 2304 KB Output is correct
21 Correct 109 ms 2396 KB Output is correct
22 Correct 149 ms 2424 KB Output is correct
23 Correct 91 ms 2424 KB Output is correct
24 Correct 167 ms 2424 KB Output is correct
25 Correct 160 ms 2424 KB Output is correct
26 Correct 187 ms 2424 KB Output is correct
27 Correct 169 ms 2424 KB Output is correct
28 Correct 168 ms 2424 KB Output is correct
29 Correct 169 ms 2300 KB Output is correct
30 Correct 171 ms 2296 KB Output is correct
31 Correct 171 ms 2400 KB Output is correct
32 Correct 171 ms 2424 KB Output is correct
33 Correct 174 ms 2424 KB Output is correct
34 Correct 169 ms 2296 KB Output is correct
35 Correct 169 ms 2300 KB Output is correct
36 Correct 181 ms 2424 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 2304 KB Output is correct
2 Correct 12 ms 2304 KB Output is correct
3 Correct 3 ms 1280 KB Output is correct
4 Correct 10 ms 2304 KB Output is correct
5 Correct 23 ms 2304 KB Output is correct
6 Correct 16 ms 2304 KB Output is correct
7 Correct 13 ms 2304 KB Output is correct
8 Correct 23 ms 2396 KB Output is correct
9 Correct 19 ms 2304 KB Output is correct
10 Correct 53 ms 2304 KB Output is correct
11 Correct 61 ms 2520 KB Output is correct
12 Correct 54 ms 2304 KB Output is correct
13 Correct 52 ms 2304 KB Output is correct
14 Correct 50 ms 2296 KB Output is correct
15 Correct 52 ms 2396 KB Output is correct
16 Correct 57 ms 2304 KB Output is correct
17 Correct 36 ms 2400 KB Output is correct
18 Correct 43 ms 2304 KB Output is correct
19 Correct 46 ms 2304 KB Output is correct
20 Correct 53 ms 2304 KB Output is correct
21 Correct 109 ms 2396 KB Output is correct
22 Correct 149 ms 2424 KB Output is correct
23 Correct 91 ms 2424 KB Output is correct
24 Correct 167 ms 2424 KB Output is correct
25 Correct 160 ms 2424 KB Output is correct
26 Correct 187 ms 2424 KB Output is correct
27 Correct 169 ms 2424 KB Output is correct
28 Correct 168 ms 2424 KB Output is correct
29 Correct 169 ms 2300 KB Output is correct
30 Correct 171 ms 2296 KB Output is correct
31 Correct 171 ms 2400 KB Output is correct
32 Correct 171 ms 2424 KB Output is correct
33 Correct 174 ms 2424 KB Output is correct
34 Correct 169 ms 2296 KB Output is correct
35 Correct 169 ms 2300 KB Output is correct
36 Correct 181 ms 2424 KB Output is correct
37 Correct 340 ms 2552 KB Output is correct
38 Correct 343 ms 2556 KB Output is correct
39 Correct 418 ms 2404 KB Output is correct
40 Correct 456 ms 2552 KB Output is correct
41 Correct 440 ms 2296 KB Output is correct
42 Correct 420 ms 2680 KB Output is correct
43 Correct 411 ms 2680 KB Output is correct
44 Correct 500 ms 2780 KB Output is correct
45 Correct 436 ms 2680 KB Output is correct
46 Correct 449 ms 2424 KB Output is correct
47 Correct 423 ms 2552 KB Output is correct
48 Correct 419 ms 2680 KB Output is correct
49 Correct 438 ms 2424 KB Output is correct
50 Correct 427 ms 2552 KB Output is correct
51 Correct 146 ms 1280 KB Output is correct
52 Correct 466 ms 2808 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 2304 KB Output is correct
2 Correct 12 ms 2304 KB Output is correct
3 Correct 3 ms 1280 KB Output is correct
4 Correct 10 ms 2304 KB Output is correct
5 Correct 23 ms 2304 KB Output is correct
6 Correct 16 ms 2304 KB Output is correct
7 Correct 13 ms 2304 KB Output is correct
8 Correct 23 ms 2396 KB Output is correct
9 Correct 19 ms 2304 KB Output is correct
10 Correct 53 ms 2304 KB Output is correct
11 Correct 61 ms 2520 KB Output is correct
12 Correct 54 ms 2304 KB Output is correct
13 Correct 52 ms 2304 KB Output is correct
14 Correct 50 ms 2296 KB Output is correct
15 Correct 52 ms 2396 KB Output is correct
16 Correct 57 ms 2304 KB Output is correct
17 Correct 36 ms 2400 KB Output is correct
18 Correct 43 ms 2304 KB Output is correct
19 Correct 46 ms 2304 KB Output is correct
20 Correct 53 ms 2304 KB Output is correct
21 Correct 109 ms 2396 KB Output is correct
22 Correct 149 ms 2424 KB Output is correct
23 Correct 91 ms 2424 KB Output is correct
24 Correct 167 ms 2424 KB Output is correct
25 Correct 160 ms 2424 KB Output is correct
26 Correct 187 ms 2424 KB Output is correct
27 Correct 169 ms 2424 KB Output is correct
28 Correct 168 ms 2424 KB Output is correct
29 Correct 169 ms 2300 KB Output is correct
30 Correct 171 ms 2296 KB Output is correct
31 Correct 171 ms 2400 KB Output is correct
32 Correct 171 ms 2424 KB Output is correct
33 Correct 174 ms 2424 KB Output is correct
34 Correct 169 ms 2296 KB Output is correct
35 Correct 169 ms 2300 KB Output is correct
36 Correct 181 ms 2424 KB Output is correct
37 Correct 340 ms 2552 KB Output is correct
38 Correct 343 ms 2556 KB Output is correct
39 Correct 418 ms 2404 KB Output is correct
40 Correct 456 ms 2552 KB Output is correct
41 Correct 440 ms 2296 KB Output is correct
42 Correct 420 ms 2680 KB Output is correct
43 Correct 411 ms 2680 KB Output is correct
44 Correct 500 ms 2780 KB Output is correct
45 Correct 436 ms 2680 KB Output is correct
46 Correct 449 ms 2424 KB Output is correct
47 Correct 423 ms 2552 KB Output is correct
48 Correct 419 ms 2680 KB Output is correct
49 Correct 438 ms 2424 KB Output is correct
50 Correct 427 ms 2552 KB Output is correct
51 Correct 146 ms 1280 KB Output is correct
52 Correct 466 ms 2808 KB Output is correct
53 Correct 516 ms 2652 KB Output is correct
54 Correct 587 ms 2776 KB Output is correct
55 Correct 614 ms 2936 KB Output is correct
56 Correct 529 ms 2684 KB Output is correct
57 Correct 650 ms 3040 KB Output is correct
58 Correct 616 ms 2784 KB Output is correct
59 Correct 609 ms 2908 KB Output is correct
60 Correct 206 ms 1280 KB Output is correct
61 Correct 622 ms 2936 KB Output is correct
62 Correct 571 ms 2936 KB Output is correct
63 Correct 554 ms 2936 KB Output is correct
64 Correct 549 ms 2936 KB Output is correct
65 Correct 532 ms 2424 KB Output is correct
66 Correct 512 ms 2424 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 2304 KB Output is correct
2 Correct 12 ms 2304 KB Output is correct
3 Correct 3 ms 1280 KB Output is correct
4 Correct 10 ms 2304 KB Output is correct
5 Correct 23 ms 2304 KB Output is correct
6 Correct 16 ms 2304 KB Output is correct
7 Correct 13 ms 2304 KB Output is correct
8 Correct 23 ms 2396 KB Output is correct
9 Correct 19 ms 2304 KB Output is correct
10 Correct 53 ms 2304 KB Output is correct
11 Correct 61 ms 2520 KB Output is correct
12 Correct 54 ms 2304 KB Output is correct
13 Correct 52 ms 2304 KB Output is correct
14 Correct 50 ms 2296 KB Output is correct
15 Correct 52 ms 2396 KB Output is correct
16 Correct 57 ms 2304 KB Output is correct
17 Correct 36 ms 2400 KB Output is correct
18 Correct 43 ms 2304 KB Output is correct
19 Correct 46 ms 2304 KB Output is correct
20 Correct 53 ms 2304 KB Output is correct
21 Correct 109 ms 2396 KB Output is correct
22 Correct 149 ms 2424 KB Output is correct
23 Correct 91 ms 2424 KB Output is correct
24 Correct 167 ms 2424 KB Output is correct
25 Correct 160 ms 2424 KB Output is correct
26 Correct 187 ms 2424 KB Output is correct
27 Correct 169 ms 2424 KB Output is correct
28 Correct 168 ms 2424 KB Output is correct
29 Correct 169 ms 2300 KB Output is correct
30 Correct 171 ms 2296 KB Output is correct
31 Correct 171 ms 2400 KB Output is correct
32 Correct 171 ms 2424 KB Output is correct
33 Correct 174 ms 2424 KB Output is correct
34 Correct 169 ms 2296 KB Output is correct
35 Correct 169 ms 2300 KB Output is correct
36 Correct 181 ms 2424 KB Output is correct
37 Correct 340 ms 2552 KB Output is correct
38 Correct 343 ms 2556 KB Output is correct
39 Correct 418 ms 2404 KB Output is correct
40 Correct 456 ms 2552 KB Output is correct
41 Correct 440 ms 2296 KB Output is correct
42 Correct 420 ms 2680 KB Output is correct
43 Correct 411 ms 2680 KB Output is correct
44 Correct 500 ms 2780 KB Output is correct
45 Correct 436 ms 2680 KB Output is correct
46 Correct 449 ms 2424 KB Output is correct
47 Correct 423 ms 2552 KB Output is correct
48 Correct 419 ms 2680 KB Output is correct
49 Correct 438 ms 2424 KB Output is correct
50 Correct 427 ms 2552 KB Output is correct
51 Correct 146 ms 1280 KB Output is correct
52 Correct 466 ms 2808 KB Output is correct
53 Correct 516 ms 2652 KB Output is correct
54 Correct 587 ms 2776 KB Output is correct
55 Correct 614 ms 2936 KB Output is correct
56 Correct 529 ms 2684 KB Output is correct
57 Correct 650 ms 3040 KB Output is correct
58 Correct 616 ms 2784 KB Output is correct
59 Correct 609 ms 2908 KB Output is correct
60 Correct 206 ms 1280 KB Output is correct
61 Correct 622 ms 2936 KB Output is correct
62 Correct 571 ms 2936 KB Output is correct
63 Correct 554 ms 2936 KB Output is correct
64 Correct 549 ms 2936 KB Output is correct
65 Correct 532 ms 2424 KB Output is correct
66 Correct 512 ms 2424 KB Output is correct
67 Correct 702 ms 2808 KB Output is correct
68 Correct 289 ms 1280 KB Output is correct
69 Correct 901 ms 3572 KB Output is correct
70 Correct 875 ms 3192 KB Output is correct
71 Correct 898 ms 3064 KB Output is correct
72 Correct 886 ms 2296 KB Output is correct
73 Correct 873 ms 2296 KB Output is correct
74 Correct 915 ms 3804 KB Output is correct
75 Correct 905 ms 3444 KB Output is correct
76 Correct 913 ms 3576 KB Output is correct
77 Correct 925 ms 3676 KB Output is correct