oj.uz

Submission #242098

# Submission time Handle Problem Language Result Execution time Memory
242098 2020-06-26T19:09:25 Z rqi Bank (IZhO14_bank) C++14
100 / 100
 304 ms 20216 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
}

int a[25];
int b[25];
vi subs[20005];
array<int, 1<<20> dp;
array<int, 1<<20> ndp;
int sums[1<<20];

int main() {
    setIO();
    int N, M;
    cin >> N >> M;
    for(int i = 1; i <= N; i++){
        cin >> a[i];
    }
    for(int i = 0; i < M; i++){
        cin >> b[i];
    }

    for(int i = 0; i < (1<<M); i++){
        dp[i] = ndp[i] = 0;
        int sum = 0;
        for(int j = 0; j < M; j++){
            if(((i>>j)&1) == 0) continue;
            sum+=b[j];
        }
        sums[i] = sum;
        assert(sum < 20005);
        subs[sum].pb(i);
    }

    dp[0] = 1;
    int cursum = 0;
    bool works = 0;
    for(int i = 1; i <= N; i++){
        works = 0;
        cursum+=a[i];
        assert(cursum < 20005);
        for(int j = 0; j < (1<<M); j++){
            if(sums[j] > cursum) continue;
            if(sums[j] < cursum-a[i]) continue;
            for(int k = 0; k < M; k++){
                if(((j>>k)&1) == 0) continue;
                ckmax(dp[j], dp[j-(1<<k)]);
            }
        }
        for(auto u: subs[cursum]){
            if(dp[u] > 0){
                ndp[u] = 1;
                works = 1;
            }
        }
        swap(ndp, dp);
        for(int j = 0; j < (1<<M); j++){
            ndp[j] = 0;
        }
    }

    if(works == 1) ps("YES");
    else ps("NO");

    // 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

bank.cpp: In function 'void setIn(std::__cxx11::string)':
bank.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); }
                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
bank.cpp: In function 'void setOut(std::__cxx11::string)':
bank.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
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 9088 KB Output is correct
2 Correct 12 ms 9088 KB Output is correct
3 Correct 12 ms 9088 KB Output is correct
4 Correct 15 ms 9344 KB Output is correct
5 Correct 111 ms 19320 KB Output is correct
6 Correct 12 ms 9088 KB Output is correct
7 Correct 12 ms 9088 KB Output is correct
8 Correct 127 ms 18808 KB Output is correct
9 Correct 163 ms 19064 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 9088 KB Output is correct
2 Correct 13 ms 9088 KB Output is correct
3 Correct 12 ms 9088 KB Output is correct
4 Correct 33 ms 9080 KB Output is correct
5 Correct 17 ms 9088 KB Output is correct
6 Correct 15 ms 9088 KB Output is correct
7 Correct 13 ms 9088 KB Output is correct
8 Correct 14 ms 9088 KB Output is correct
9 Correct 14 ms 9088 KB Output is correct
10 Correct 15 ms 9088 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 9216 KB Output is correct
2 Correct 15 ms 9216 KB Output is correct
3 Correct 23 ms 9344 KB Output is correct
4 Correct 28 ms 9216 KB Output is correct
5 Correct 51 ms 9208 KB Output is correct
6 Correct 17 ms 9216 KB Output is correct
7 Correct 17 ms 9216 KB Output is correct
8 Correct 16 ms 9216 KB Output is correct
9 Correct 20 ms 9344 KB Output is correct
10 Correct 22 ms 9216 KB Output is correct
11 Correct 26 ms 9216 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 9088 KB Output is correct
2 Correct 12 ms 9088 KB Output is correct
3 Correct 12 ms 9088 KB Output is correct
4 Correct 15 ms 9344 KB Output is correct
5 Correct 111 ms 19320 KB Output is correct
6 Correct 12 ms 9088 KB Output is correct
7 Correct 12 ms 9088 KB Output is correct
8 Correct 127 ms 18808 KB Output is correct
9 Correct 163 ms 19064 KB Output is correct
10 Correct 15 ms 9088 KB Output is correct
11 Correct 13 ms 9088 KB Output is correct
12 Correct 12 ms 9088 KB Output is correct
13 Correct 33 ms 9080 KB Output is correct
14 Correct 17 ms 9088 KB Output is correct
15 Correct 15 ms 9088 KB Output is correct
16 Correct 13 ms 9088 KB Output is correct
17 Correct 14 ms 9088 KB Output is correct
18 Correct 14 ms 9088 KB Output is correct
19 Correct 15 ms 9088 KB Output is correct
20 Correct 33 ms 9216 KB Output is correct
21 Correct 15 ms 9216 KB Output is correct
22 Correct 23 ms 9344 KB Output is correct
23 Correct 28 ms 9216 KB Output is correct
24 Correct 51 ms 9208 KB Output is correct
25 Correct 17 ms 9216 KB Output is correct
26 Correct 17 ms 9216 KB Output is correct
27 Correct 16 ms 9216 KB Output is correct
28 Correct 20 ms 9344 KB Output is correct
29 Correct 22 ms 9216 KB Output is correct
30 Correct 26 ms 9216 KB Output is correct
31 Correct 186 ms 19588 KB Output is correct
32 Correct 168 ms 19064 KB Output is correct
33 Correct 200 ms 18936 KB Output is correct
34 Correct 200 ms 19192 KB Output is correct
35 Correct 216 ms 20064 KB Output is correct
36 Correct 234 ms 19576 KB Output is correct
37 Correct 178 ms 20088 KB Output is correct
38 Correct 110 ms 19904 KB Output is correct
39 Correct 140 ms 18128 KB Output is correct
40 Correct 165 ms 19836 KB Output is correct
41 Correct 235 ms 19320 KB Output is correct
42 Correct 211 ms 18424 KB Output is correct
43 Correct 198 ms 20216 KB Output is correct
44 Correct 217 ms 20088 KB Output is correct
45 Correct 151 ms 19192 KB Output is correct
46 Correct 190 ms 20088 KB Output is correct
47 Correct 216 ms 19448 KB Output is correct
48 Correct 194 ms 18936 KB Output is correct
49 Correct 94 ms 18936 KB Output is correct
50 Correct 304 ms 17984 KB Output is correct
51 Correct 192 ms 18808 KB Output is correct
52 Correct 194 ms 18000 KB Output is correct
53 Correct 223 ms 18036 KB Output is correct
54 Correct 285 ms 18080 KB Output is correct
55 Correct 300 ms 18084 KB Output is correct
56 Correct 293 ms 18632 KB Output is correct
57 Correct 293 ms 18628 KB Output is correct
58 Correct 299 ms 18628 KB Output is correct