oj.uz

Submission #970727

# Submission time Handle Problem Language Result Execution time Memory
970727 2024-04-27T07:18:33 Z yeediot Bank (IZhO14_bank) C++17
100 / 100
 142 ms 1620 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef local
void setio(){freopen("/Users/iantsai/Library/Mobile Documents/com~apple~CloudDocs/cpp/Empty.md","r",stdin);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
struct line{
    int a,b;
    int operator()(const int x)const{
        return a*x+b;
    }
};
bool check(line l1,line l2,line l3){
    return (l3.b-l2.b)*(l1.a-l2.a)<=(l2.b-l1.b)*(l2.a-l3.a);
}
signed main(){
    setio();
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int n,m;
    cin>>n>>m;
    vector<int>pre(n+1),v(m);
    for(int i=1;i<=n;i++){
        cin>>pre[i];
        pre[i]+=pre[i-1];
    }
    for(int i=0;i<m;i++)
        cin>>v[i];
    sort(all(v),greater<int>());
    bool dp[(1<<m)];
    memset(dp,0,sizeof(dp));
    bool ok=0;
    dp[0]=1;
    for(int i=1;i<(1<<m);i++){
        int sum=0;
        for(int j=0;j<m;j++)
            if(i>>j&1)
                sum+=v[j];
        int p=0;
        for(int j=0;j<m;j++){
            if(i>>j&1){
                if(!dp[i^(1<<j)])
                    continue;
                while(p<=n and pre[p]<=sum-v[j]){
                    p++;
                }
                if(sum<=pre[p]){
                    dp[i]=1;
                    break;
                }
            }
        }
        if(p==n and dp[i] and sum==pre[n]){
            ok=1;
            break;
        }
        debug(p,sum,dp[i]);
    }
    cout<<(ok?"YES\n":"NO\n");
}
 /*
 input:
 
 */

Compilation message

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

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 452 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 136 ms 1368 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 1372 KB Output is correct
9 Correct 70 ms 1620 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 452 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 136 ms 1368 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 1372 KB Output is correct
9 Correct 70 ms 1620 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 456 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 2 ms 464 KB Output is correct
24 Correct 2 ms 348 KB Output is correct
25 Correct 2 ms 348 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 2 ms 348 KB Output is correct
29 Correct 2 ms 348 KB Output is correct
30 Correct 2 ms 348 KB Output is correct
31 Correct 84 ms 1372 KB Output is correct
32 Correct 80 ms 1456 KB Output is correct
33 Correct 133 ms 1368 KB Output is correct
34 Correct 139 ms 1456 KB Output is correct
35 Correct 140 ms 1456 KB Output is correct
36 Correct 134 ms 1372 KB Output is correct
37 Correct 140 ms 1368 KB Output is correct
38 Correct 135 ms 1372 KB Output is correct
39 Correct 1 ms 1372 KB Output is correct
40 Correct 137 ms 1452 KB Output is correct
41 Correct 136 ms 1620 KB Output is correct
42 Correct 118 ms 1460 KB Output is correct
43 Correct 138 ms 1448 KB Output is correct
44 Correct 136 ms 1368 KB Output is correct
45 Correct 1 ms 1372 KB Output is correct
46 Correct 128 ms 1372 KB Output is correct
47 Correct 142 ms 1372 KB Output is correct
48 Correct 1 ms 1368 KB Output is correct
49 Correct 137 ms 1372 KB Output is correct
50 Correct 92 ms 1368 KB Output is correct
51 Correct 141 ms 1368 KB Output is correct
52 Correct 134 ms 1568 KB Output is correct
53 Correct 83 ms 1372 KB Output is correct
54 Correct 89 ms 1456 KB Output is correct
55 Correct 88 ms 1452 KB Output is correct
56 Correct 84 ms 1448 KB Output is correct
57 Correct 82 ms 1372 KB Output is correct
58 Correct 82 ms 1372 KB Output is correct