oj.uz

Submission #671860

# Submission time Handle Problem Language Result Execution time Memory
671860 2022-12-14T05:32:58 Z ReLice Bank (IZhO14_bank) C++14
71 / 100
 1000 ms 11604 KB 
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
#define ld long double
#define int long long
#define pb push_back
#define sz size()
#define fr first
#define sc second
//#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
void fre(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
void start(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}
const int N=1e4;
const int mod=1e9+7;
const int inf=1e7;
vector <vector <ll>> dp(N);
vector <ll> v,v2;
ll n,m;
bool check(ll id,ll a){
    if(id==n) return true;
    if(dp[v[id]].sz==0) return false;
    for(auto i : dp[v[id]]){
        if((a^i)!=(a+i))continue;
        if(check(id+1,a^i)){
            return true;
        }
    }
    return false;
}
void solve(){
    ll i,j,b,mx=-1,l,r,k,ans=1,lst;
    cin>>n>>m;
    for(i=0;i<n;i++){
        cin>>b;
        v.pb(b);
    }
    for(i=0;i<m;i++){
        cin>>b;
        v2.pb(b);
    }
    ll c=1;
    dp[0].pb(0);
    for(auto i : v2){
        for(j=1000;j>=0;j--){
            if(dp[j].sz>0){
                for(auto i1 : dp[j]){
                    if(j+i<1002) dp[j+i].pb(i1+c);
                }
            }
        }
        c*=2;
    }
    if(check(0,0)){
        cout<<"YES"<<endl;
    }
    else cout<<"NO"<<endl;

}
signed main(){
    //fre("divide");
    start();
    ll t=1;
    //cin>>t;
    while(t--) solve();
}

Compilation message

bank.cpp: In function 'void solve()':
bank.cpp:36:14: warning: unused variable 'mx' [-Wunused-variable]
   36 |     ll i,j,b,mx=-1,l,r,k,ans=1,lst;
      |              ^~
bank.cpp:36:20: warning: unused variable 'l' [-Wunused-variable]
   36 |     ll i,j,b,mx=-1,l,r,k,ans=1,lst;
      |                    ^
bank.cpp:36:22: warning: unused variable 'r' [-Wunused-variable]
   36 |     ll i,j,b,mx=-1,l,r,k,ans=1,lst;
      |                      ^
bank.cpp:36:24: warning: unused variable 'k' [-Wunused-variable]
   36 |     ll i,j,b,mx=-1,l,r,k,ans=1,lst;
      |                        ^
bank.cpp:36:26: warning: unused variable 'ans' [-Wunused-variable]
   36 |     ll i,j,b,mx=-1,l,r,k,ans=1,lst;
      |                          ^~~
bank.cpp:36:32: warning: unused variable 'lst' [-Wunused-variable]
   36 |     ll i,j,b,mx=-1,l,r,k,ans=1,lst;
      |                                ^~~
bank.cpp: In function 'void fre(std::string)':
bank.cpp:12:27: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 | void fre(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
      |                    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bank.cpp:12:64: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 | void fre(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
      |                                                         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 1 ms 852 KB Output is correct
5 Correct 10 ms 11604 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 0 ms 596 KB Output is correct
8 Correct 9 ms 10580 KB Output is correct
9 Correct 10 ms 11352 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 1 ms 852 KB Output is correct
5 Correct 10 ms 11604 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 0 ms 596 KB Output is correct
8 Correct 9 ms 10580 KB Output is correct
9 Correct 10 ms 11352 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 0 ms 468 KB Output is correct
23 Correct 1 ms 724 KB Output is correct
24 Correct 1 ms 724 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 596 KB Output is correct
27 Correct 1 ms 596 KB Output is correct
28 Correct 0 ms 468 KB Output is correct
29 Correct 0 ms 468 KB Output is correct
30 Correct 1 ms 724 KB Output is correct
31 Correct 9 ms 9172 KB Output is correct
32 Correct 10 ms 10880 KB Output is correct
33 Correct 2 ms 1748 KB Output is correct
34 Correct 1 ms 468 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 1 ms 468 KB Output is correct
37 Correct 1 ms 724 KB Output is correct
38 Correct 2 ms 724 KB Output is correct
39 Correct 12 ms 10300 KB Output is correct
40 Correct 3 ms 3284 KB Output is correct
41 Correct 1 ms 1364 KB Output is correct
42 Correct 79 ms 10652 KB Output is correct
43 Correct 3 ms 3668 KB Output is correct
44 Correct 1 ms 468 KB Output is correct
45 Correct 10 ms 11348 KB Output is correct
46 Correct 5 ms 5716 KB Output is correct
47 Correct 1 ms 492 KB Output is correct
48 Correct 10 ms 11092 KB Output is correct
49 Correct 9 ms 11092 KB Output is correct
50 Correct 11 ms 10772 KB Output is correct
51 Correct 15 ms 11348 KB Output is correct
52 Correct 10 ms 9800 KB Output is correct
53 Correct 11 ms 9852 KB Output is correct
54 Correct 12 ms 10772 KB Output is correct
55 Correct 11 ms 10732 KB Output is correct
56 Correct 12 ms 11068 KB Output is correct
57 Execution timed out 1096 ms 11156 KB Time limit exceeded
58 Halted 0 ms 0 KB -