oj.uz

답안 #68553

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
68553 2018-08-17T09:50:23 Z quoriess 은행 (IZhO14_bank) C++14
71 / 100
 1000 ms 249600 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];
    	vector<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.push_back(j.to_ulong());
    	}
    	for (int i = 1; i < n; i++)
    	{
			vector<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.push_back(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;
    }

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 372 KB Output is correct
3 Correct 2 ms 448 KB Output is correct
4 Correct 4 ms 468 KB Output is correct
5 Correct 74 ms 1536 KB Output is correct
6 Correct 2 ms 1536 KB Output is correct
7 Correct 2 ms 1536 KB Output is correct
8 Correct 73 ms 1824 KB Output is correct
9 Correct 73 ms 1824 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1824 KB Output is correct
2 Correct 2 ms 1824 KB Output is correct
3 Correct 2 ms 1824 KB Output is correct
4 Correct 2 ms 1824 KB Output is correct
5 Correct 2 ms 1824 KB Output is correct
6 Correct 2 ms 1824 KB Output is correct
7 Correct 2 ms 1824 KB Output is correct
8 Correct 2 ms 1824 KB Output is correct
9 Correct 2 ms 1824 KB Output is correct
10 Correct 2 ms 1824 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1824 KB Output is correct
2 Correct 3 ms 1824 KB Output is correct
3 Correct 3 ms 1824 KB Output is correct
4 Correct 3 ms 1824 KB Output is correct
5 Correct 3 ms 1824 KB Output is correct
6 Correct 3 ms 1824 KB Output is correct
7 Correct 3 ms 1824 KB Output is correct
8 Correct 3 ms 1824 KB Output is correct
9 Correct 3 ms 1824 KB Output is correct
10 Correct 3 ms 1824 KB Output is correct
11 Correct 3 ms 1824 KB Output is correct

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 372 KB Output is correct
3 Correct 2 ms 448 KB Output is correct
4 Correct 4 ms 468 KB Output is correct
5 Correct 74 ms 1536 KB Output is correct
6 Correct 2 ms 1536 KB Output is correct
7 Correct 2 ms 1536 KB Output is correct
8 Correct 73 ms 1824 KB Output is correct
9 Correct 73 ms 1824 KB Output is correct
10 Correct 2 ms 1824 KB Output is correct
11 Correct 2 ms 1824 KB Output is correct
12 Correct 2 ms 1824 KB Output is correct
13 Correct 2 ms 1824 KB Output is correct
14 Correct 2 ms 1824 KB Output is correct
15 Correct 2 ms 1824 KB Output is correct
16 Correct 2 ms 1824 KB Output is correct
17 Correct 2 ms 1824 KB Output is correct
18 Correct 2 ms 1824 KB Output is correct
19 Correct 2 ms 1824 KB Output is correct
20 Correct 3 ms 1824 KB Output is correct
21 Correct 3 ms 1824 KB Output is correct
22 Correct 3 ms 1824 KB Output is correct
23 Correct 3 ms 1824 KB Output is correct
24 Correct 3 ms 1824 KB Output is correct
25 Correct 3 ms 1824 KB Output is correct
26 Correct 3 ms 1824 KB Output is correct
27 Correct 3 ms 1824 KB Output is correct
28 Correct 3 ms 1824 KB Output is correct
29 Correct 3 ms 1824 KB Output is correct
30 Correct 3 ms 1824 KB Output is correct
31 Correct 78 ms 2664 KB Output is correct
32 Correct 736 ms 8280 KB Output is correct
33 Correct 85 ms 8280 KB Output is correct
34 Correct 90 ms 10848 KB Output is correct
35 Correct 90 ms 11872 KB Output is correct
36 Correct 107 ms 21088 KB Output is correct
37 Correct 76 ms 21088 KB Output is correct
38 Correct 79 ms 21088 KB Output is correct
39 Execution timed out 1076 ms 249600 KB Time limit exceeded
40 Halted 0 ms 0 KB -