oj.uz

Submission #444331

# Submission time Handle Problem Language Result Execution time Memory
444331 2021-07-13T15:57:27 Z Bungmint Bank (IZhO14_bank) C++17
100 / 100
 137 ms 8532 KB 
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using vi = vector<int>;
using pi = pair<int, int>;
using vpi = vector<pair<int, int>>;
using pl = pair<ll, ll>;
using vl = vector<ll>;
using vpl = vector<pl>;
using ld = long double;

#define all(v) (v).begin(), (v).end()
#define ar array
#define pb push_back
#define sz(x) (int)(x).size()
#define fi first
#define se second
#define lb lower_bound

template <typename T>
using pqg = priority_queue<T, vector<T>, greater<T>>;
template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p)
{
    return os << '(' << p.first << ", " << p.second << ')';
}
template <typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type>
ostream &operator<<(ostream &os, const T_container &v)
{
    os << '{';
    string sep;
    for (const T &x : v)
        os << sep << x, sep = ", ";
    return os << '}';
}
void dbg_out()
{
    cerr << endl;
}
template <typename Head, typename... Tail>
void dbg_out(Head H, Tail... T)
{
    cerr << ' ' << H;
    dbg_out(T...);
}
#ifdef LOCAL
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

struct custom_hash
{
    static uint64_t splitmix64(uint64_t x)
    {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const
    {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

void setIO(string s)
{
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7; //998244353;
int leftover[1<<20], covered[1<<20], a[20], b[20], n, m;

void solve()
{
	cin >> n >> m;
	for (int i=0;i<n;++i) cin >> a[i];
	for (int i=0;i<m;++i) cin >> b[i];
	memset(leftover, -1, sizeof(leftover)); memset(covered, -1, sizeof(covered));
	leftover[0] = covered[0] = 0;
	for (int mask = 0;mask<(1<<m);++mask){
		for (int last=0;last<m;++last){
			if (((1<<last)&mask)==0) continue;
			int prev = mask&~(1<<last);
			if (covered[prev]==-1) continue;
			int amt = leftover[prev] + b[last];
			int cur = a[covered[prev]];
			if (amt<cur){
				covered[mask] = covered[prev];
				leftover[mask] = amt;
			}else if (amt==cur){
				covered[mask] = covered[prev]+1;
				leftover[mask] = 0;
			}
		}
		if (covered[mask]==n){
			cout << "YES"<<endl;
			return;
		}
	}
	cout << "NO"<<endl;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    // setIO("bank");
    int testcase=1;
    // cin >> testcase;
    while (testcase--)
    {
        solve();
    }
}

Compilation message

bank.cpp: In function 'void setIO(std::string)':
bank.cpp:74:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   74 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bank.cpp:75:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   75 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8396 KB Output is correct
2 Correct 5 ms 8524 KB Output is correct
3 Correct 4 ms 8524 KB Output is correct
4 Correct 4 ms 8396 KB Output is correct
5 Correct 58 ms 8524 KB Output is correct
6 Correct 4 ms 8516 KB Output is correct
7 Correct 4 ms 8524 KB Output is correct
8 Correct 4 ms 8524 KB Output is correct
9 Correct 104 ms 8500 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8524 KB Output is correct
2 Correct 5 ms 8396 KB Output is correct
3 Correct 5 ms 8524 KB Output is correct
4 Correct 6 ms 8524 KB Output is correct
5 Correct 5 ms 8524 KB Output is correct
6 Correct 5 ms 8524 KB Output is correct
7 Correct 6 ms 8532 KB Output is correct
8 Correct 5 ms 8520 KB Output is correct
9 Correct 5 ms 8508 KB Output is correct
10 Correct 5 ms 8500 KB Output is correct
11 Correct 5 ms 8396 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8396 KB Output is correct
2 Correct 5 ms 8524 KB Output is correct
3 Correct 4 ms 8524 KB Output is correct
4 Correct 4 ms 8396 KB Output is correct
5 Correct 58 ms 8524 KB Output is correct
6 Correct 4 ms 8516 KB Output is correct
7 Correct 4 ms 8524 KB Output is correct
8 Correct 4 ms 8524 KB Output is correct
9 Correct 104 ms 8500 KB Output is correct
10 Correct 5 ms 8396 KB Output is correct
11 Correct 4 ms 8396 KB Output is correct
12 Correct 5 ms 8396 KB Output is correct
13 Correct 5 ms 8524 KB Output is correct
14 Correct 4 ms 8524 KB Output is correct
15 Correct 4 ms 8456 KB Output is correct
16 Correct 4 ms 8396 KB Output is correct
17 Correct 5 ms 8524 KB Output is correct
18 Correct 5 ms 8524 KB Output is correct
19 Correct 4 ms 8524 KB Output is correct
20 Correct 5 ms 8524 KB Output is correct
21 Correct 5 ms 8396 KB Output is correct
22 Correct 5 ms 8524 KB Output is correct
23 Correct 6 ms 8524 KB Output is correct
24 Correct 5 ms 8524 KB Output is correct
25 Correct 5 ms 8524 KB Output is correct
26 Correct 6 ms 8532 KB Output is correct
27 Correct 5 ms 8520 KB Output is correct
28 Correct 5 ms 8508 KB Output is correct
29 Correct 5 ms 8500 KB Output is correct
30 Correct 5 ms 8396 KB Output is correct
31 Correct 119 ms 8500 KB Output is correct
32 Correct 124 ms 8396 KB Output is correct
33 Correct 72 ms 8516 KB Output is correct
34 Correct 57 ms 8504 KB Output is correct
35 Correct 68 ms 8396 KB Output is correct
36 Correct 68 ms 8504 KB Output is correct
37 Correct 69 ms 8492 KB Output is correct
38 Correct 58 ms 8396 KB Output is correct
39 Correct 4 ms 8396 KB Output is correct
40 Correct 56 ms 8524 KB Output is correct
41 Correct 57 ms 8520 KB Output is correct
42 Correct 137 ms 8504 KB Output is correct
43 Correct 70 ms 8396 KB Output is correct
44 Correct 58 ms 8500 KB Output is correct
45 Correct 6 ms 8396 KB Output is correct
46 Correct 90 ms 8504 KB Output is correct
47 Correct 59 ms 8504 KB Output is correct
48 Correct 4 ms 8396 KB Output is correct
49 Correct 59 ms 8396 KB Output is correct
50 Correct 108 ms 8396 KB Output is correct
51 Correct 58 ms 8524 KB Output is correct
52 Correct 63 ms 8504 KB Output is correct
53 Correct 127 ms 8500 KB Output is correct
54 Correct 123 ms 8524 KB Output is correct
55 Correct 106 ms 8396 KB Output is correct
56 Correct 104 ms 8416 KB Output is correct
57 Correct 119 ms 8500 KB Output is correct
58 Correct 107 ms 8504 KB Output is correct