Submission #498054

#	Time	Username	Problem	Language	Result	Execution time	Memory
498054		tmn2005	은행 (IZhO14_bank)	C++17	0 / 100	24 ms	23800 KiB

bank

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;

#define ar array
#define fr first
#define sc second

#define vec vector
#define ret return

#define ins insert
#define mk make_pair
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_back

#define int long long

#define pii pair<int,int>

#define all(s) s.begin(), s.end()
#define allr(s) s.rbegin(), s.rend()

#define NeedForSpeed ios::sync_with_stdio(0),cin.tie(0);
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
const int N=1e6+12,INF=1e9,mod = 1e9+7;
bool iswowel(char n){ n = toupper(n); if(n == 'A' || n == 'O' || n == 'U' || n == 'E' || n == 'I') return true; else return false;}
int n,m,k,x,y,l,r,o,ans,res,ok,mx,mn = INF;
int a[N],b[N],dp[N],c;
vec<int>g[N];

main(){
	NeedForSpeed
    cin>>n>>m;
    for(int i=1; i<=n; i++){
    	cin>>b[i];
    	dp[b[i]] = 1;
    	k += b[i];
	}
    for(int i=0; i<m; i++)cin>>a[i];
    
    for(int i=1; i<=n; i++){
    	for(int j=0; j<(1<<m); j++){
    		int s = 0;
    		for(int l=0; l<m; l++){
    			if((1<<l) & j ){
    				s += a[l];
				}
			}
			if(s == b[i]){
				g[b[i]].pb(j);
			}
		}
	}
	dp[0] = 1;
	for(int i=(1<<m); i>=0; i--){
		for(int j=0; j<m; j++){
			if(dp[i] && (i|b[j]) == 0){
				dp[(i|b[j])] = max(dp[(i|b[j])], dp[i] + 1);
			}
		}
	}
    for(int i=1; i<=k; i++){
    	cout<<i<<" "<<dp[i]<<endl;
	}




	return 0;
}

Compilation message (stderr)

bank.cpp:35:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   35 | main(){
      | ^~~~

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