oj.uz

답안 #167009

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
167009 2019-12-05T08:08:57 Z Dovran 은행 (IZhO14_bank) C++11
44 / 100
 27 ms 23928 KB 
#include <bits/stdc++.h>
#define N 1000009
#define pii pair <int, int>
#define ff first
#define ss second
#define pb push_back
#define pp pop_back
#define ll long long

using namespace std;

int n, m, v[N], c[N], b[N], mxx;
int vis[N];
vector<int>e[N];
bool asd;
vector<int>bt;
map<vector<int>, int>vss;

void pr(int x, int y);

void f(int x){
	if(x==n+1){
		cout<<"YES\n";
		asd=1;
		return;
	}
	b[0]=1;
	for(int i=1; i<=m; i++){
		if(vis[c[i]]>0){
			for(int j=v[x]; j>=0; j--){
				if(b[j]==1)
					e[j+c[i]].pb(c[i]), b[j+c[i]]=1;
			}
		}
	}
	pr(v[x], x);
	for(int i=1; i<=mxx+v[x]; i++)
		e[i].clear(), b[i]=0;
}

void pr(int x, int y){
	if(x==0){
		vector<int>asd=bt;
		sort(asd.begin(), asd.end());
		if(vss[asd]==0)
			f(y+1), vss[bt]=1;
		return;
	}
	for(auto i:e[x]){
		if(vis[i] > 0)
			vis[i]--, bt.pb(i), pr(x-i, y), bt.pp(), vis[i]++;
		if(asd==1)
			break;
	}
}

int main(){
	cin>>n>>m;
	for(int i=1; i<=n; i++)
		cin>>v[i];

	for(int i=1; i<=m; i++)
		cin>>c[i], vis[c[i]]++, mxx=max(mxx, c[i]);
	f(1);
	if(asd==0)
		cout<<"NO\n";
}
/*
1 5
8
4 2 5 1 3
*/

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 23800 KB Output is correct
2 Correct 27 ms 23800 KB Output is correct
3 Correct 26 ms 23800 KB Output is correct
4 Correct 25 ms 23928 KB Output is correct
5 Correct 24 ms 23800 KB Output is correct
6 Correct 26 ms 23772 KB Output is correct
7 Correct 24 ms 23804 KB Output is correct
8 Correct 25 ms 23928 KB Output is correct
9 Correct 25 ms 23900 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 23800 KB Output is correct
2 Correct 25 ms 23800 KB Output is correct
3 Correct 25 ms 23928 KB Output is correct
4 Correct 25 ms 23800 KB Output is correct
5 Correct 25 ms 23772 KB Output is correct
6 Correct 24 ms 23800 KB Output is correct
7 Correct 25 ms 23800 KB Output is correct
8 Correct 27 ms 23800 KB Output is correct
9 Correct 26 ms 23852 KB Output is correct
10 Correct 25 ms 23928 KB Output is correct

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 26 ms 23928 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 23800 KB Output is correct
2 Correct 27 ms 23800 KB Output is correct
3 Correct 26 ms 23800 KB Output is correct
4 Correct 25 ms 23928 KB Output is correct
5 Correct 24 ms 23800 KB Output is correct
6 Correct 26 ms 23772 KB Output is correct
7 Correct 24 ms 23804 KB Output is correct
8 Correct 25 ms 23928 KB Output is correct
9 Correct 25 ms 23900 KB Output is correct
10 Correct 25 ms 23800 KB Output is correct
11 Correct 25 ms 23800 KB Output is correct
12 Correct 25 ms 23928 KB Output is correct
13 Correct 25 ms 23800 KB Output is correct
14 Correct 25 ms 23772 KB Output is correct
15 Correct 24 ms 23800 KB Output is correct
16 Correct 25 ms 23800 KB Output is correct
17 Correct 27 ms 23800 KB Output is correct
18 Correct 26 ms 23852 KB Output is correct
19 Correct 25 ms 23928 KB Output is correct
20 Incorrect 26 ms 23928 KB Output isn't correct
21 Halted 0 ms 0 KB -