oj.uz

Submission #986055

# Submission time Handle Problem Language Result Execution time Memory
986055 2024-05-19T17:02:26 Z vahagng Bank (IZhO14_bank) C++17
100 / 100
 699 ms 15208 KB 
//----------vahagng----------//
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;

// template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// Defines

#define ll long long
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define pii pair<int, int>
#define ppb pop_back
#define pb push_back
#define mii map<int, int>
#define mll map<long long, long long>
#define no_ans cout << -1 << '\n';
#define YES cout << "YES\n";
#define NO cout << "NO\n";
#define ok cout << "OK\n";

// Constants 

const int N = 21, M = 105;
const ll inf = 1e18, mod = 1e9+7;

// Functions

void SetIO(string str = "") {
    if (str != "") {
        freopen((str + ".in").c_str(), "r", stdin);
        freopen((str + ".out").c_str(), "w", stdout);
    } else {
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    }
}
 
void FastIO() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
}

ll add(ll a, ll b)
{
    return (a + b)%mod;
}

ll mult(ll a, ll b)
{
    return (a%mod * b%mod)%mod;
}

ll sub(ll a, ll b)
{
    return (a - b + 2*mod)%mod;
}

long long binpower(long long a, long long n) {
	if(n == 0) {
		return 1;
	}
 
	if(n == 1) {
		return a;
	}
 
	if(n % 2 == 1) {
		long long curr = binpower(a, n / 2);
		curr = mult(curr, curr);
		curr = mult(a, curr);
		return curr;
	} else {
		long long curr = binpower(a, n / 2);
		return mult(curr, curr);
	}
}

ll power(int a, int b)
{
    ll res = 1;
    while(b--)
    {
        res*=a;
    }
    return res;
}

// const int N = 2e5 + 10;
// pair<int,int>max_dist;
// vector<int>adj[N];
// int dists[N];

// void dfs(int node, int parent, int dist) 
// {
//     dists[node] = max(dists[node], dist);
// 	if(dist > max_dist.first) 
//     {
// 		max_dist = {dist, node};
// 	}
 
// 	for(auto i: adj[node]) 
//     {
// 		if(i == parent) continue;
// 		dfs(i, node, dist + 1);
// 	}
// }
 
// pair<int, int> get_farthest_distance(int node) 
// {
// 	max_dist = {-1, -1};
// 	dfs(node, -1, 0);
// 	return max_dist;
// }

void precision(int x)
{
	cout.setf(ios::fixed | ios::showpoint);
	cout.precision(x);
	return;
}

ll countSubstring(const string str, const string sub)
{
	if (sub.length() == 0) return 0;
	ll count = 0;
	for(int i = 0; i < str.size() - sub.size() + 1; i++) 
    {
        int okk = 1;
        for(int j = i; j < i + sub.size(); j++) 
        {
            if(str[j] != sub[j - i]) 
            {
                okk = 0;
                break;
            }
        }
        count += okk;
    }
    return count;
}

ll ceil_division(ll a, ll b)
{
    return (a + b - 1) / b;
}

ll max_subarray_sum(vector<ll>& v, int n)
{
    ll a = INT64_MIN, b = 0;
    for(int i = 0; i < n; i++)
    {
        b += v[i];
        if(b > a)
        {
            a = b;
        }
        if(b<0)
        {
            b = a;
        }
    }
    return a;
}

// Solution

ll n, m;
ll dp[1<<21];
vector<ll>v, b;
vector<int>posible[1001];

void solve() 
{
    cin >> n >> m;
    v.resize(n);
    b.resize(m);
    for(auto& i : v) cin >> i;
    for(auto& i : b) cin >> i;
    for(int mask = 1; mask < (1<<m); mask++)
    {
        int cur = 0;
        for(int j = 0; j < m; j++)
        {
            if(mask & (1<<j))
            {
                cur+=b[j];
            }
        }
        if(cur <= 1000) posible[cur].push_back(mask);
    }
    for(int i = 0; i < (1<<m); i++) dp[i] = -1;
    dp[0] = 0;
    for(int i = 0; i < n; i++)
    {
        for(int mask = (1<<m) - 1; mask >= 0; mask--)
        {
            if(dp[mask] == -1) continue;
            for(auto j : posible[v[i]])
            {
                if(!(j&mask))
                {
                    dp[j|mask] = dp[mask] + 1;
                    if(dp[j|mask] == n)
                    {
                        cout << "YES\n";
                        return;
                    }
                }
            }
        }
    }
    cout << "NO\n";
}

void precalc()
{

}

int main()
{
    // SetIO("pairup");
    FastIO();
    precalc();
    int test_case = 1;
    // cin >> test_case;
    while (test_case--) 
    {
        solve();
    }
    return 0;
}

Compilation message

bank.cpp: In function 'long long int countSubstring(std::string, std::string)':
bank.cpp:131:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  131 |  for(int i = 0; i < str.size() - sub.size() + 1; i++)
      |                 ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bank.cpp:134:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  134 |         for(int j = i; j < i + sub.size(); j++)
      |                        ~~^~~~~~~~~~~~~~~~
bank.cpp: In function 'void SetIO(std::string)':
bank.cpp:34:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 |         freopen((str + ".in").c_str(), "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bank.cpp:35:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |         freopen((str + ".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bank.cpp:37:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |         freopen("input.txt", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
bank.cpp:38:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |         freopen("output.txt", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 2652 KB Output is correct
5 Correct 54 ms 15208 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 54 ms 14184 KB Output is correct
9 Correct 53 ms 14672 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 2652 KB Output is correct
5 Correct 54 ms 15208 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 54 ms 14184 KB Output is correct
9 Correct 53 ms 14672 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 2 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 856 KB Output is correct
29 Correct 1 ms 484 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 53 ms 14032 KB Output is correct
32 Correct 93 ms 14540 KB Output is correct
33 Correct 53 ms 9428 KB Output is correct
34 Correct 56 ms 8664 KB Output is correct
35 Correct 56 ms 8676 KB Output is correct
36 Correct 63 ms 8784 KB Output is correct
37 Correct 52 ms 9044 KB Output is correct
38 Correct 51 ms 8788 KB Output is correct
39 Correct 63 ms 13732 KB Output is correct
40 Correct 58 ms 10320 KB Output is correct
41 Correct 62 ms 9296 KB Output is correct
42 Correct 93 ms 14272 KB Output is correct
43 Correct 57 ms 10604 KB Output is correct
44 Correct 58 ms 8784 KB Output is correct
45 Correct 55 ms 14932 KB Output is correct
46 Correct 55 ms 11856 KB Output is correct
47 Correct 59 ms 8928 KB Output is correct
48 Correct 53 ms 14420 KB Output is correct
49 Correct 53 ms 14508 KB Output is correct
50 Correct 354 ms 13596 KB Output is correct
51 Correct 699 ms 14716 KB Output is correct
52 Correct 358 ms 13812 KB Output is correct
53 Correct 691 ms 13720 KB Output is correct
54 Correct 425 ms 13592 KB Output is correct
55 Correct 352 ms 13624 KB Output is correct
56 Correct 517 ms 13900 KB Output is correct
57 Correct 598 ms 13900 KB Output is correct
58 Correct 519 ms 13896 KB Output is correct