oj.uz

Submission #317358

# Submission time Handle Problem Language Result Execution time Memory
317358 2020-10-29T15:28:27 Z vivaan_gupta Bank (IZhO14_bank) C++14
100 / 100
 624 ms 89464 KB 
#include <bits/stdc++.h>
using namespace std;
 
using ll = long long;
using ld = long double;
using db = double; 
using str = string; // yay python!

using pi = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;

using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>; 
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>; 
using vpd = vector<pd>;

#define tcT template<class T
// ^ lol this makes everything look weird but I'll try it
tcT> using V = vector<T>; 
tcT, size_t SZ> using AR = array<T,SZ>; 

// pairs
#define mp make_pair
#define f first
#define s second

// vectors
#define sz(x) (int)(x).size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend() 
#define sor(x) sort(all(x)) 
#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 

// loops
#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; // not too close to LLONG_MAX
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; // for every grid problem!!
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 

// helper funcs
constexpr int pct(int x) { return __builtin_popcount(x); } // # of bits set
constexpr int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down

tcT> bool ckmin(T& a, const T& b) {
	return b < a ? a = b, 1 : 0; } // set a = min(a,b)
tcT> bool ckmax(T& a, const T& b) {
	return a < b ? a = b, 1 : 0; }

#define tcTU tcT, class U
tcTU> T fstTrue(T lo, T hi, U f) {
	hi ++; assert(lo <= hi); // assuming f is increasing
	while (lo < hi) { // find first index such that f is true 
		T mid = lo+(hi-lo)/2;
		f(mid) ? hi = mid : lo = mid+1; 
	} 
	return lo;
}
tcTU> T lstTrue(T lo, T hi, U f) {
	lo --; assert(lo <= hi); // assuming f is decreasing
	while (lo < hi) { // find first index such that f is true 
		T mid = lo+(hi-lo+1)/2;
		f(mid) ? lo = mid : hi = mid-1;
	} 
	return lo;
}
tcT> void remDup(vector<T>& v) { // sort and remove duplicates
	sort(all(v)); v.erase(unique(all(v)),end(v)); }
tcTU> void erase(T& t, const U& u) { // don't erase
	auto it = t.find(u); assert(it != end(t));
	t.erase(u); } // element that doesn't exist from (multi)set

// INPUT
#define tcTUU tcT, class ...U
tcT> void re(complex<T>& c);
tcTU> void re(pair<T,U>& p);
tcT> void re(vector<T>& v);
tcT, size_t SZ> void re(AR<T,SZ>& a);

tcT> 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); }
tcTUU> void re(T& t, U&... u) { re(t); re(u...); }

tcT> void re(complex<T>& c) { T a,b; re(a,b); c = {a,b}; }
tcTU> void re(pair<T,U>& p) { re(p.f,p.s); }
tcT> void re(vector<T>& x) { trav(a,x) re(a); }
tcT, size_t SZ> void re(AR<T,SZ>& x) { trav(a,x) re(a); }

// TO_STRING
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
str ts(bool b) { 
	#ifdef LOCAL
		return b ? "true" : "false"; 
	#else 
		return ts((int)b);
	#endif
}
tcT> str ts(complex<T> 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; }
tcTU> str ts(pair<T,U> p);
tcT> str ts(T v) { // containers with begin(), end()
	#ifdef LOCAL
		bool fst = 1; str res = "{";
		for (const auto& x: v) {
			if (!fst) res += ", ";
			fst = 0; res += ts(x);
		}
		res += "}"; return res;
	#else
		bool fst = 1; str res = "";
		for (const auto& x: v) {
			if (!fst) res += " ";
			fst = 0; res += ts(x);
		}
		return res;

	#endif
}
tcTU> str ts(pair<T,U> p) {
	#ifdef LOCAL
		return "("+ts(p.f)+", "+ts(p.s)+")"; 
	#else
		return ts(p.f)+" "+ts(p.s);
	#endif
}

// OUTPUT
tcT> void pr(T x) { cout << ts(x); }
tcTUU> void pr(const T& t, const U&... u) { 
	pr(t); pr(u...); }
void ps() { pr("\n"); } // print w/ spaces
tcTUU> void ps(const T& t, const U&... u) { 
	pr(t); if (sizeof...(u)) pr(" "); ps(u...); }

// DEBUG
void DBG() { cerr << "]" << endl; }
tcTUU> void DBG(const T& t, const U&... u) {
	cerr << ts(t); if (sizeof...(u)) cerr << ", ";
	DBG(u...); }
#ifdef LOCAL // compile with -DLOCAL, chk -> fake assert
	#define dbg(...) cerr << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
	#define chk(...) if (!(__VA_ARGS__)) cerr << "Line(" << __LINE__ << ") -> function(" \
		 << __FUNCTION__  << ") -> CHK FAILED: (" << #__VA_ARGS__ << ")" << "\n", exit(0);
#else
	#define dbg(...) 0
	#define chk(...) 0
#endif

// FILE I/O
void setIn(str s) { freopen(s.c_str(),"r",stdin); }
void setOut(str s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { cin.tie(0)->sync_with_stdio(0); }
void setIO(str 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 n,m;
int a[22],b[22];
int dp[22][1LL<<20];
vi sum[20000+5];
int recurse(int i,int mask){
	if(i > n) return 1;
	if(dp[i][mask] != -1) return dp[i][mask];
	int ok =0;
	trav(x,sum[a[i]]){
		if((x&mask) != 0) continue;
		int nxtmask = mask ^ x;	
		ok |= recurse(i+1,nxtmask);
	}
	return dp[i][mask] = ok;
}	
int main() {
	setIO();	
	// you should actually read the stuff at the bottom
	re(n,m);
	FOR(i,1,n+1)re(a[i]);
	FOR(i,1,m+1)re(b[i]);
	FOR(mask,0,1ll<<m){
		int s= 0;
		FOR(i,0,m){
			if(mask&(1ll<<i)){
				s += b[i+1];
			}
		}
		sum[s].pb(mask);
	}
	FOR(i,1,n+1){
		FOR(j,0,1ll<<m){
			dp[i][j]=-1;
		}
	}
	int res = recurse(1,0);
	if(res)ps("YES");
	else ps("NO");
}

/* stuff you should look for
	* read the probem 3 more times in case of WA :)
	* int overflow, array bounds
	* special cases (n=1?)
	* do smth instead of nothing and stay organized
	* WRITE STUFF DOWN
	* DON'T GET STUCK ON ONE APPROACH
*/

Compilation message

bank.cpp: In function 'void setIn(str)':
bank.cpp:182:28: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  182 | void setIn(str s) { freopen(s.c_str(),"r",stdin); }
      |                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
bank.cpp: In function 'void setOut(str)':
bank.cpp:183:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  183 | void setOut(str s) { freopen(s.c_str(),"w",stdout); }
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 1 ms 768 KB Output is correct
3 Correct 1 ms 768 KB Output is correct
4 Correct 3 ms 1280 KB Output is correct
5 Correct 81 ms 11128 KB Output is correct
6 Correct 1 ms 768 KB Output is correct
7 Correct 1 ms 896 KB Output is correct
8 Correct 77 ms 10480 KB Output is correct
9 Correct 77 ms 10872 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 896 KB Output is correct
2 Correct 1 ms 896 KB Output is correct
3 Correct 1 ms 896 KB Output is correct
4 Correct 1 ms 896 KB Output is correct
5 Correct 1 ms 896 KB Output is correct
6 Correct 1 ms 896 KB Output is correct
7 Correct 1 ms 896 KB Output is correct
8 Correct 1 ms 896 KB Output is correct
9 Correct 1 ms 896 KB Output is correct
10 Correct 1 ms 896 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1536 KB Output is correct
2 Correct 3 ms 1152 KB Output is correct
3 Correct 3 ms 1792 KB Output is correct
4 Correct 3 ms 1920 KB Output is correct
5 Correct 3 ms 1664 KB Output is correct
6 Correct 3 ms 1408 KB Output is correct
7 Correct 3 ms 1280 KB Output is correct
8 Correct 3 ms 1152 KB Output is correct
9 Correct 3 ms 1664 KB Output is correct
10 Correct 3 ms 1536 KB Output is correct
11 Correct 3 ms 1920 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 1 ms 768 KB Output is correct
3 Correct 1 ms 768 KB Output is correct
4 Correct 3 ms 1280 KB Output is correct
5 Correct 81 ms 11128 KB Output is correct
6 Correct 1 ms 768 KB Output is correct
7 Correct 1 ms 896 KB Output is correct
8 Correct 77 ms 10480 KB Output is correct
9 Correct 77 ms 10872 KB Output is correct
10 Correct 1 ms 896 KB Output is correct
11 Correct 1 ms 896 KB Output is correct
12 Correct 1 ms 896 KB Output is correct
13 Correct 1 ms 896 KB Output is correct
14 Correct 1 ms 896 KB Output is correct
15 Correct 1 ms 896 KB Output is correct
16 Correct 1 ms 896 KB Output is correct
17 Correct 1 ms 896 KB Output is correct
18 Correct 1 ms 896 KB Output is correct
19 Correct 1 ms 896 KB Output is correct
20 Correct 3 ms 1536 KB Output is correct
21 Correct 3 ms 1152 KB Output is correct
22 Correct 3 ms 1792 KB Output is correct
23 Correct 3 ms 1920 KB Output is correct
24 Correct 3 ms 1664 KB Output is correct
25 Correct 3 ms 1408 KB Output is correct
26 Correct 3 ms 1280 KB Output is correct
27 Correct 3 ms 1152 KB Output is correct
28 Correct 3 ms 1664 KB Output is correct
29 Correct 3 ms 1536 KB Output is correct
30 Correct 3 ms 1920 KB Output is correct
31 Correct 86 ms 15352 KB Output is correct
32 Correct 174 ms 18936 KB Output is correct
33 Correct 98 ms 35320 KB Output is correct
34 Correct 112 ms 47992 KB Output is correct
35 Correct 119 ms 52984 KB Output is correct
36 Correct 139 ms 89464 KB Output is correct
37 Correct 90 ms 15992 KB Output is correct
38 Correct 94 ms 23928 KB Output is correct
39 Correct 111 ms 38604 KB Output is correct
40 Correct 106 ms 48636 KB Output is correct
41 Correct 133 ms 88952 KB Output is correct
42 Correct 94 ms 26616 KB Output is correct
43 Correct 102 ms 40568 KB Output is correct
44 Correct 128 ms 69368 KB Output is correct
45 Correct 85 ms 19192 KB Output is correct
46 Correct 96 ms 32568 KB Output is correct
47 Correct 122 ms 68728 KB Output is correct
48 Correct 79 ms 10616 KB Output is correct
49 Correct 77 ms 10744 KB Output is correct
50 Correct 299 ms 87744 KB Output is correct
51 Correct 104 ms 47484 KB Output is correct
52 Correct 105 ms 46924 KB Output is correct
53 Correct 624 ms 46908 KB Output is correct
54 Correct 336 ms 87876 KB Output is correct
55 Correct 296 ms 87756 KB Output is correct
56 Correct 316 ms 87868 KB Output is correct
57 Correct 336 ms 87876 KB Output is correct
58 Correct 329 ms 83772 KB Output is correct