Submission #68552

# Submission time Handle Problem Language Result Execution time Memory
68552 2018-08-17T09:49:25 Z quoriess Bank (IZhO14_bank) C++14
71 / 100
1000 ms 33952 KB
    #include <bits/stdc++.h>
    using namespace std;
    typedef long long int lli;
    int main(){
    	int n,m;
    	cin>>n>>m;
    	vector<int> salary,banks;
    	for (int i = 0; i < n; i++)
    	{
    		int a;
    		cin>>a;
    		salary.push_back(a);
    	}
    	for (int j = 0; j < m; j++)
    	{
    		int a;
    		cin>>a;
    		banks.push_back(a);
    	}
    /*
    2 4
    3 6
    5 1 2 1
     
    */
    	vector<vector<bitset<20> > > sncler(n,vector<bitset<20> >());
    	for (int i = 0; i < 1<<m; i++)
    	{
    		bitset<20> smd(i);
    		int tplm=0;
    		for (int j = 0; j < m; j++)
    		{
    			if(smd[j])
                    tplm+=banks[j];
    		}
    		for(int j=0;j<n;j++){
    			if(salary[j]==tplm)
                    sncler[j].push_back(smd);
    		}
    	}
    	int mstb=1<<m;
    	bool dp[n][mstb];
    	set<int> bakilacaklar;
    	for(int i=0;i<n;i++){
            for(int j=0;j<mstb;j++)dp[i][j]=0;
    	}
    	for(auto j:sncler[0]){
			dp[0][j.to_ulong()]=1;
			bakilacaklar.insert(j.to_ulong());
    	}
    	for (int i = 1; i < n; i++)
    	{
			set<int> nb;
    		for(auto k:bakilacaklar){
    			for (auto j: sncler[i])
    			{
    				if((k&j.to_ulong())==0){
    					dp[i][k^j.to_ulong()]=dp[i-1][k]||dp[i][k^j.to_ulong()];
    					if(dp[i][k^j.to_ulong()])nb.insert(k^j.to_ulong());
    				}
    			}
    		}
    		bakilacaklar=nb;
    	}
    	bool ans=0;
        for(int i=1;i<mstb;i++)if(dp[n-1][i])ans=true;
        cout << (ans?"YES":"NO")<<"\n";
    	return 0;
    }
# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 3 ms 484 KB Output is correct
5 Correct 75 ms 1352 KB Output is correct
6 Correct 2 ms 1352 KB Output is correct
7 Correct 2 ms 1352 KB Output is correct
8 Correct 73 ms 1864 KB Output is correct
9 Correct 76 ms 1864 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 1864 KB Output is correct
2 Correct 2 ms 1864 KB Output is correct
3 Correct 2 ms 1864 KB Output is correct
4 Correct 2 ms 1864 KB Output is correct
5 Correct 2 ms 1864 KB Output is correct
6 Correct 2 ms 1864 KB Output is correct
7 Correct 2 ms 1864 KB Output is correct
8 Correct 2 ms 1864 KB Output is correct
9 Correct 2 ms 1864 KB Output is correct
10 Correct 2 ms 1864 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 1864 KB Output is correct
2 Correct 3 ms 1864 KB Output is correct
3 Correct 3 ms 1864 KB Output is correct
4 Correct 3 ms 1864 KB Output is correct
5 Correct 3 ms 1864 KB Output is correct
6 Correct 3 ms 1864 KB Output is correct
7 Correct 3 ms 1864 KB Output is correct
8 Correct 3 ms 1864 KB Output is correct
9 Correct 3 ms 1864 KB Output is correct
10 Correct 3 ms 1864 KB Output is correct
11 Correct 3 ms 1864 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 3 ms 484 KB Output is correct
5 Correct 75 ms 1352 KB Output is correct
6 Correct 2 ms 1352 KB Output is correct
7 Correct 2 ms 1352 KB Output is correct
8 Correct 73 ms 1864 KB Output is correct
9 Correct 76 ms 1864 KB Output is correct
10 Correct 2 ms 1864 KB Output is correct
11 Correct 2 ms 1864 KB Output is correct
12 Correct 2 ms 1864 KB Output is correct
13 Correct 2 ms 1864 KB Output is correct
14 Correct 2 ms 1864 KB Output is correct
15 Correct 2 ms 1864 KB Output is correct
16 Correct 2 ms 1864 KB Output is correct
17 Correct 2 ms 1864 KB Output is correct
18 Correct 2 ms 1864 KB Output is correct
19 Correct 2 ms 1864 KB Output is correct
20 Correct 3 ms 1864 KB Output is correct
21 Correct 3 ms 1864 KB Output is correct
22 Correct 3 ms 1864 KB Output is correct
23 Correct 3 ms 1864 KB Output is correct
24 Correct 3 ms 1864 KB Output is correct
25 Correct 3 ms 1864 KB Output is correct
26 Correct 3 ms 1864 KB Output is correct
27 Correct 3 ms 1864 KB Output is correct
28 Correct 3 ms 1864 KB Output is correct
29 Correct 3 ms 1864 KB Output is correct
30 Correct 3 ms 1864 KB Output is correct
31 Correct 76 ms 2600 KB Output is correct
32 Correct 155 ms 4404 KB Output is correct
33 Correct 85 ms 7760 KB Output is correct
34 Correct 90 ms 10860 KB Output is correct
35 Correct 90 ms 11884 KB Output is correct
36 Correct 108 ms 21088 KB Output is correct
37 Correct 75 ms 21088 KB Output is correct
38 Correct 79 ms 21088 KB Output is correct
39 Correct 346 ms 21088 KB Output is correct
40 Correct 90 ms 21088 KB Output is correct
41 Correct 111 ms 21116 KB Output is correct
42 Correct 90 ms 21116 KB Output is correct
43 Correct 86 ms 21116 KB Output is correct
44 Correct 103 ms 21116 KB Output is correct
45 Correct 81 ms 21116 KB Output is correct
46 Correct 85 ms 21116 KB Output is correct
47 Correct 103 ms 21116 KB Output is correct
48 Correct 73 ms 21116 KB Output is correct
49 Correct 75 ms 21116 KB Output is correct
50 Execution timed out 1078 ms 33952 KB Time limit exceeded
51 Halted 0 ms 0 KB -