Submission #1189701

#	Time	Username	Problem	Language	Result	Execution time	Memory
1189701		atillama	Bank (IZhO14_bank)	C++20	0 / 100	0 ms	328 KiB

bank

#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_multiset;

#define int long long
#define double long double
#define pb push_back
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define debug(x) cout << #x << " = " << x << '\n';
#define vdebug(a) cout << #a << " = "; for(auto x : a) cout << x << " "; cout << '\n';

const double eps = 1e-9;
const int mod = 1e9 + 7;
const int N = 2e5 + 5;
const int INF = 1e18;

signed main(){
    fastio;
    int n, m;
    cin >> n >> m;
    vector<int> a(n);
    vector<int> b(m);
    for(int i = 0; i < n; i++){
        cin >> a[i];
    }
    for(int i = 0; i < m; i++){
        cin >> b[i];
    }
    sort(b.begin(), b.end());
    bool bl = false;
    int cur = b[0];
    int l = 0, r = 0;
    while(r < m){
        if(cur < a[0]){
            r++;
            if(r == n){
                continue;
            }
            cur += b[r];
        }else if(cur == a[0]){
            bl = true;
            break;
        }else{
            cur -= b[l];
            l++;
            if(l < r){
                r++;
                if(r == n){
                    continue;
                    cur += b[r];
                }
            }
        }
    }
    cout << (bl ? "YES" : "NO") << '\n';
}

/*
    freopen("x.in", "r", stdin);
    freopen("x.out", "w", stdout);
*/

//atilla

• Subtask 1: 0 / 19
• Subtask 2: 0 / 25
• Subtask 3: 0 / 27
• Subtask 4: 0 / 29