oj.uz

답안 #248574

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
248574 2020-07-12T18:43:49 Z rqi Bootfall (IZhO17_bootfall) C++14
65 / 100
 1000 ms 2256 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];
    }
 
    bitset<mx2+5> orig;
    orig[0] = 1;
    for(int i = 1; i <= N; i++){
        orig = (orig)|(orig<<a[i]);
    }
 
    if(sum % 2 == 1 || orig[sum/2] == 0){
        ps(0);
        return 0;
    }
    
    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]]);
        }
    }
 
    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++){
            works[j] = 0;
            if(j-a[i] >= 0) sub(tot[j], tot[j-a[i]]);
        }
        
        for(int j = 0; j <= mx2; j++){
            int x = j*2-sum+a[i];
            if(tot[j] != ID && x >= 0 && x <= mx2){
                works[x] = 1;
            }
        }

        ans&=works;

        for(int j = mx2; j >= 0; j--){
            if(a[i] > j) continue;
            ad(tot[j], tot[j-a[i]]);
        }
    }
 
    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

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 1408 KB Output is correct
2 Correct 16 ms 1408 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 11 ms 1408 KB Output is correct
5 Correct 28 ms 1512 KB Output is correct
6 Correct 19 ms 1408 KB Output is correct
7 Correct 15 ms 1408 KB Output is correct
8 Correct 28 ms 1408 KB Output is correct
9 Correct 23 ms 1536 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 1408 KB Output is correct
2 Correct 16 ms 1408 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 11 ms 1408 KB Output is correct
5 Correct 28 ms 1512 KB Output is correct
6 Correct 19 ms 1408 KB Output is correct
7 Correct 15 ms 1408 KB Output is correct
8 Correct 28 ms 1408 KB Output is correct
9 Correct 23 ms 1536 KB Output is correct
10 Correct 71 ms 1408 KB Output is correct
11 Correct 70 ms 1408 KB Output is correct
12 Correct 66 ms 1516 KB Output is correct
13 Correct 60 ms 1408 KB Output is correct
14 Correct 65 ms 1408 KB Output is correct
15 Correct 71 ms 1516 KB Output is correct
16 Correct 72 ms 1408 KB Output is correct
17 Correct 43 ms 1408 KB Output is correct
18 Correct 55 ms 1408 KB Output is correct
19 Correct 81 ms 1528 KB Output is correct
20 Correct 67 ms 1408 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 1408 KB Output is correct
2 Correct 16 ms 1408 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 11 ms 1408 KB Output is correct
5 Correct 28 ms 1512 KB Output is correct
6 Correct 19 ms 1408 KB Output is correct
7 Correct 15 ms 1408 KB Output is correct
8 Correct 28 ms 1408 KB Output is correct
9 Correct 23 ms 1536 KB Output is correct
10 Correct 71 ms 1408 KB Output is correct
11 Correct 70 ms 1408 KB Output is correct
12 Correct 66 ms 1516 KB Output is correct
13 Correct 60 ms 1408 KB Output is correct
14 Correct 65 ms 1408 KB Output is correct
15 Correct 71 ms 1516 KB Output is correct
16 Correct 72 ms 1408 KB Output is correct
17 Correct 43 ms 1408 KB Output is correct
18 Correct 55 ms 1408 KB Output is correct
19 Correct 81 ms 1528 KB Output is correct
20 Correct 67 ms 1408 KB Output is correct
21 Correct 141 ms 1484 KB Output is correct
22 Correct 171 ms 1516 KB Output is correct
23 Correct 112 ms 1528 KB Output is correct
24 Correct 206 ms 1528 KB Output is correct
25 Correct 230 ms 1488 KB Output is correct
26 Correct 225 ms 1516 KB Output is correct
27 Correct 213 ms 1528 KB Output is correct
28 Correct 215 ms 1528 KB Output is correct
29 Correct 215 ms 1528 KB Output is correct
30 Correct 225 ms 1408 KB Output is correct
31 Correct 224 ms 1528 KB Output is correct
32 Correct 219 ms 1532 KB Output is correct
33 Correct 209 ms 1408 KB Output is correct
34 Correct 211 ms 1408 KB Output is correct
35 Correct 213 ms 1508 KB Output is correct
36 Correct 215 ms 1528 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 1408 KB Output is correct
2 Correct 16 ms 1408 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 11 ms 1408 KB Output is correct
5 Correct 28 ms 1512 KB Output is correct
6 Correct 19 ms 1408 KB Output is correct
7 Correct 15 ms 1408 KB Output is correct
8 Correct 28 ms 1408 KB Output is correct
9 Correct 23 ms 1536 KB Output is correct
10 Correct 71 ms 1408 KB Output is correct
11 Correct 70 ms 1408 KB Output is correct
12 Correct 66 ms 1516 KB Output is correct
13 Correct 60 ms 1408 KB Output is correct
14 Correct 65 ms 1408 KB Output is correct
15 Correct 71 ms 1516 KB Output is correct
16 Correct 72 ms 1408 KB Output is correct
17 Correct 43 ms 1408 KB Output is correct
18 Correct 55 ms 1408 KB Output is correct
19 Correct 81 ms 1528 KB Output is correct
20 Correct 67 ms 1408 KB Output is correct
21 Correct 141 ms 1484 KB Output is correct
22 Correct 171 ms 1516 KB Output is correct
23 Correct 112 ms 1528 KB Output is correct
24 Correct 206 ms 1528 KB Output is correct
25 Correct 230 ms 1488 KB Output is correct
26 Correct 225 ms 1516 KB Output is correct
27 Correct 213 ms 1528 KB Output is correct
28 Correct 215 ms 1528 KB Output is correct
29 Correct 215 ms 1528 KB Output is correct
30 Correct 225 ms 1408 KB Output is correct
31 Correct 224 ms 1528 KB Output is correct
32 Correct 219 ms 1532 KB Output is correct
33 Correct 209 ms 1408 KB Output is correct
34 Correct 211 ms 1408 KB Output is correct
35 Correct 213 ms 1508 KB Output is correct
36 Correct 215 ms 1528 KB Output is correct
37 Correct 422 ms 1656 KB Output is correct
38 Correct 423 ms 1656 KB Output is correct
39 Correct 525 ms 1528 KB Output is correct
40 Correct 590 ms 1656 KB Output is correct
41 Correct 581 ms 1488 KB Output is correct
42 Correct 545 ms 1660 KB Output is correct
43 Correct 529 ms 1900 KB Output is correct
44 Correct 536 ms 1872 KB Output is correct
45 Correct 551 ms 1912 KB Output is correct
46 Correct 588 ms 1512 KB Output is correct
47 Correct 533 ms 1784 KB Output is correct
48 Correct 541 ms 1788 KB Output is correct
49 Correct 533 ms 1532 KB Output is correct
50 Correct 544 ms 1784 KB Output is correct
51 Correct 4 ms 512 KB Output is correct
52 Correct 595 ms 2000 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 1408 KB Output is correct
2 Correct 16 ms 1408 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 11 ms 1408 KB Output is correct
5 Correct 28 ms 1512 KB Output is correct
6 Correct 19 ms 1408 KB Output is correct
7 Correct 15 ms 1408 KB Output is correct
8 Correct 28 ms 1408 KB Output is correct
9 Correct 23 ms 1536 KB Output is correct
10 Correct 71 ms 1408 KB Output is correct
11 Correct 70 ms 1408 KB Output is correct
12 Correct 66 ms 1516 KB Output is correct
13 Correct 60 ms 1408 KB Output is correct
14 Correct 65 ms 1408 KB Output is correct
15 Correct 71 ms 1516 KB Output is correct
16 Correct 72 ms 1408 KB Output is correct
17 Correct 43 ms 1408 KB Output is correct
18 Correct 55 ms 1408 KB Output is correct
19 Correct 81 ms 1528 KB Output is correct
20 Correct 67 ms 1408 KB Output is correct
21 Correct 141 ms 1484 KB Output is correct
22 Correct 171 ms 1516 KB Output is correct
23 Correct 112 ms 1528 KB Output is correct
24 Correct 206 ms 1528 KB Output is correct
25 Correct 230 ms 1488 KB Output is correct
26 Correct 225 ms 1516 KB Output is correct
27 Correct 213 ms 1528 KB Output is correct
28 Correct 215 ms 1528 KB Output is correct
29 Correct 215 ms 1528 KB Output is correct
30 Correct 225 ms 1408 KB Output is correct
31 Correct 224 ms 1528 KB Output is correct
32 Correct 219 ms 1532 KB Output is correct
33 Correct 209 ms 1408 KB Output is correct
34 Correct 211 ms 1408 KB Output is correct
35 Correct 213 ms 1508 KB Output is correct
36 Correct 215 ms 1528 KB Output is correct
37 Correct 422 ms 1656 KB Output is correct
38 Correct 423 ms 1656 KB Output is correct
39 Correct 525 ms 1528 KB Output is correct
40 Correct 590 ms 1656 KB Output is correct
41 Correct 581 ms 1488 KB Output is correct
42 Correct 545 ms 1660 KB Output is correct
43 Correct 529 ms 1900 KB Output is correct
44 Correct 536 ms 1872 KB Output is correct
45 Correct 551 ms 1912 KB Output is correct
46 Correct 588 ms 1512 KB Output is correct
47 Correct 533 ms 1784 KB Output is correct
48 Correct 541 ms 1788 KB Output is correct
49 Correct 533 ms 1532 KB Output is correct
50 Correct 544 ms 1784 KB Output is correct
51 Correct 4 ms 512 KB Output is correct
52 Correct 595 ms 2000 KB Output is correct
53 Correct 659 ms 1768 KB Output is correct
54 Correct 756 ms 1788 KB Output is correct
55 Correct 763 ms 2156 KB Output is correct
56 Correct 682 ms 1992 KB Output is correct
57 Correct 784 ms 2256 KB Output is correct
58 Correct 776 ms 1892 KB Output is correct
59 Correct 771 ms 2040 KB Output is correct
60 Correct 8 ms 512 KB Output is correct
61 Correct 768 ms 2040 KB Output is correct
62 Correct 701 ms 2040 KB Output is correct
63 Correct 701 ms 2168 KB Output is correct
64 Correct 686 ms 2028 KB Output is correct
65 Correct 666 ms 1528 KB Output is correct
66 Correct 653 ms 1656 KB Output is correct

Subtask #6
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 1408 KB Output is correct
2 Correct 16 ms 1408 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 11 ms 1408 KB Output is correct
5 Correct 28 ms 1512 KB Output is correct
6 Correct 19 ms 1408 KB Output is correct
7 Correct 15 ms 1408 KB Output is correct
8 Correct 28 ms 1408 KB Output is correct
9 Correct 23 ms 1536 KB Output is correct
10 Correct 71 ms 1408 KB Output is correct
11 Correct 70 ms 1408 KB Output is correct
12 Correct 66 ms 1516 KB Output is correct
13 Correct 60 ms 1408 KB Output is correct
14 Correct 65 ms 1408 KB Output is correct
15 Correct 71 ms 1516 KB Output is correct
16 Correct 72 ms 1408 KB Output is correct
17 Correct 43 ms 1408 KB Output is correct
18 Correct 55 ms 1408 KB Output is correct
19 Correct 81 ms 1528 KB Output is correct
20 Correct 67 ms 1408 KB Output is correct
21 Correct 141 ms 1484 KB Output is correct
22 Correct 171 ms 1516 KB Output is correct
23 Correct 112 ms 1528 KB Output is correct
24 Correct 206 ms 1528 KB Output is correct
25 Correct 230 ms 1488 KB Output is correct
26 Correct 225 ms 1516 KB Output is correct
27 Correct 213 ms 1528 KB Output is correct
28 Correct 215 ms 1528 KB Output is correct
29 Correct 215 ms 1528 KB Output is correct
30 Correct 225 ms 1408 KB Output is correct
31 Correct 224 ms 1528 KB Output is correct
32 Correct 219 ms 1532 KB Output is correct
33 Correct 209 ms 1408 KB Output is correct
34 Correct 211 ms 1408 KB Output is correct
35 Correct 213 ms 1508 KB Output is correct
36 Correct 215 ms 1528 KB Output is correct
37 Correct 422 ms 1656 KB Output is correct
38 Correct 423 ms 1656 KB Output is correct
39 Correct 525 ms 1528 KB Output is correct
40 Correct 590 ms 1656 KB Output is correct
41 Correct 581 ms 1488 KB Output is correct
42 Correct 545 ms 1660 KB Output is correct
43 Correct 529 ms 1900 KB Output is correct
44 Correct 536 ms 1872 KB Output is correct
45 Correct 551 ms 1912 KB Output is correct
46 Correct 588 ms 1512 KB Output is correct
47 Correct 533 ms 1784 KB Output is correct
48 Correct 541 ms 1788 KB Output is correct
49 Correct 533 ms 1532 KB Output is correct
50 Correct 544 ms 1784 KB Output is correct
51 Correct 4 ms 512 KB Output is correct
52 Correct 595 ms 2000 KB Output is correct
53 Correct 659 ms 1768 KB Output is correct
54 Correct 756 ms 1788 KB Output is correct
55 Correct 763 ms 2156 KB Output is correct
56 Correct 682 ms 1992 KB Output is correct
57 Correct 784 ms 2256 KB Output is correct
58 Correct 776 ms 1892 KB Output is correct
59 Correct 771 ms 2040 KB Output is correct
60 Correct 8 ms 512 KB Output is correct
61 Correct 768 ms 2040 KB Output is correct
62 Correct 701 ms 2040 KB Output is correct
63 Correct 701 ms 2168 KB Output is correct
64 Correct 686 ms 2028 KB Output is correct
65 Correct 666 ms 1528 KB Output is correct
66 Correct 653 ms 1656 KB Output is correct
67 Correct 863 ms 2120 KB Output is correct
68 Correct 7 ms 512 KB Output is correct
69 Execution timed out 1093 ms 1492 KB Time limit exceeded
70 Halted 0 ms 0 KB -