Submission #20533

# Submission time Handle Problem Language Result Execution time Memory
20533 2017-02-12T08:03:19 Z 안녕하세요 투어리스트입니다 진짜에요(#49, Namnamseo) 복불복 (OJUZ11_luck) C++14
34 / 100
233 ms 322192 KB
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pp;
void read(int& x){ scanf("%d",&x); }
template<typename T,typename... Args>
void read(T& a,Args&... b){ read(a); read(b...); }
#define all(x) (x).begin(),(x).end()
#define pb push_back

int n, k;
int a[1010];
int b[1010];
const ll M=1'000'000'007;

void in(){
	read(n, k);
    for(int i=1; i<=n; ++i) read(a[i]); sort(a+1, a+n+1, greater<int>());
    for(int i=1; i<=n; ++i) read(b[i]); sort(b+1, b+n+1);
}

void naive(){
	int ind[1010];
    for(int i=1; i<=n; ++i) ind[i]=i;
	int ans=0;
	int c[1010];
	do {
		for(int i=1; i<=n; ++i) c[i]=a[i]+b[ind[i]];
		bool flg=1;
		int max_rnk = 0;
		for(int i=1; i<=k; ++i){
			int rnk = count_if(c+1, c+n+1, [&](int x){ return x > c[i]; })+1;
			max_rnk = max(max_rnk, rnk);
			if(rnk > k)
				flg=0;
		}
		for(int i=k+1; i<=n; ++i){
			int rnk = count_if(c+1, c+n+1, [&](int x){ return x > c[i]; })+1;
			if(rnk < max_rnk)
				flg=0;
		}
		ans += flg;
	} while(next_permutation(ind+1, ind+n+1));
	printf("%d\n", ans);
}

int dp[1<<15][2001];
bool chk[1<<15][2001];

int work(int mask, int lmin){
	if(mask+1 == (1<<n))
		return 1;
	int& ret=dp[mask][lmin];
	if(chk[mask][lmin]) return ret;
	chk[mask][lmin]=1;
	int p=__builtin_popcount(mask);
	if(p < k){
		for(int i=0; i<n; ++i) if((1&(mask>>i))==0) {
			ret += work(mask|(1<<i), min(lmin, a[p+1]+b[i+1]));
			ret %= M;
		}
	} else {
		for(int i=0; i<n; ++i) if((1&(mask>>i))==0) {
			if(a[p+1]+b[i+1] <= lmin)
				ret += work(mask|(1<<i), lmin);
			ret %= M;
		}
	}
	return ret;
}

void nksmall(){
	printf("%d\n", work(0, 2000));
}

void solve(){
}

int main()
{
#ifdef NAMSEO
	freopen("in", "r", stdin);
#endif
    in();
    if(n<=8) naive();
    else if(n<=15) nksmall();
    else solve();
    return 0;
}

Compilation message

luck.cpp: In function 'void read(int&)':
luck.cpp:5:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 void read(int& x){ scanf("%d",&x); }
                                  ^
# Verdict Execution time Memory Grader output
1 Correct 3 ms 322192 KB Output is correct
2 Correct 3 ms 322192 KB Output is correct
3 Correct 3 ms 322192 KB Output is correct
4 Correct 3 ms 322192 KB Output is correct
5 Correct 3 ms 322192 KB Output is correct
6 Correct 3 ms 322192 KB Output is correct
7 Correct 3 ms 322192 KB Output is correct
8 Correct 3 ms 322192 KB Output is correct
9 Correct 3 ms 322192 KB Output is correct
10 Correct 3 ms 322192 KB Output is correct
11 Correct 3 ms 322192 KB Output is correct
12 Correct 0 ms 322192 KB Output is correct
13 Correct 0 ms 322192 KB Output is correct
14 Correct 0 ms 322192 KB Output is correct
15 Correct 0 ms 322192 KB Output is correct
16 Correct 0 ms 322192 KB Output is correct
17 Correct 0 ms 322192 KB Output is correct
18 Correct 0 ms 322192 KB Output is correct
19 Correct 0 ms 322192 KB Output is correct
20 Correct 0 ms 322192 KB Output is correct
21 Correct 3 ms 322192 KB Output is correct
22 Correct 3 ms 322192 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 322192 KB Output isn't correct
2 Incorrect 0 ms 322192 KB Output isn't correct
3 Incorrect 0 ms 322192 KB Output isn't correct
4 Incorrect 0 ms 322192 KB Output isn't correct
5 Incorrect 0 ms 322192 KB Output isn't correct
6 Incorrect 0 ms 322192 KB Output isn't correct
7 Incorrect 0 ms 322192 KB Output isn't correct
8 Incorrect 0 ms 322192 KB Output isn't correct
9 Incorrect 0 ms 322192 KB Output isn't correct
10 Correct 0 ms 322192 KB Output is correct
11 Correct 0 ms 322192 KB Output is correct
12 Correct 0 ms 322192 KB Output is correct
13 Correct 0 ms 322192 KB Output is correct
14 Incorrect 0 ms 322192 KB Output isn't correct
15 Incorrect 0 ms 322192 KB Output isn't correct
16 Incorrect 0 ms 322192 KB Output isn't correct
17 Incorrect 0 ms 322192 KB Output isn't correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 322192 KB Output is correct
2 Correct 3 ms 322192 KB Output is correct
3 Correct 3 ms 322192 KB Output is correct
4 Correct 3 ms 322192 KB Output is correct
5 Correct 3 ms 322192 KB Output is correct
6 Correct 3 ms 322192 KB Output is correct
7 Correct 3 ms 322192 KB Output is correct
8 Correct 3 ms 322192 KB Output is correct
9 Correct 3 ms 322192 KB Output is correct
10 Correct 3 ms 322192 KB Output is correct
11 Correct 3 ms 322192 KB Output is correct
12 Correct 0 ms 322192 KB Output is correct
13 Correct 0 ms 322192 KB Output is correct
14 Correct 0 ms 322192 KB Output is correct
15 Correct 0 ms 322192 KB Output is correct
16 Correct 0 ms 322192 KB Output is correct
17 Correct 0 ms 322192 KB Output is correct
18 Correct 0 ms 322192 KB Output is correct
19 Correct 0 ms 322192 KB Output is correct
20 Correct 0 ms 322192 KB Output is correct
21 Correct 3 ms 322192 KB Output is correct
22 Correct 3 ms 322192 KB Output is correct
23 Correct 129 ms 322192 KB Output is correct
24 Correct 93 ms 322192 KB Output is correct
25 Correct 226 ms 322192 KB Output is correct
26 Correct 69 ms 322192 KB Output is correct
27 Correct 113 ms 322192 KB Output is correct
28 Correct 103 ms 322192 KB Output is correct
29 Correct 233 ms 322192 KB Output is correct
30 Correct 206 ms 322192 KB Output is correct
31 Correct 126 ms 322192 KB Output is correct
32 Correct 66 ms 322192 KB Output is correct
33 Correct 86 ms 322192 KB Output is correct
34 Correct 166 ms 322192 KB Output is correct
35 Correct 99 ms 322192 KB Output is correct
36 Correct 46 ms 322192 KB Output is correct
37 Correct 96 ms 322192 KB Output is correct
38 Correct 53 ms 322192 KB Output is correct
39 Correct 0 ms 322192 KB Output is correct
40 Correct 59 ms 322192 KB Output is correct
41 Correct 9 ms 322192 KB Output is correct
42 Correct 0 ms 322192 KB Output is correct
43 Correct 3 ms 322192 KB Output is correct
44 Correct 73 ms 322192 KB Output is correct
45 Correct 96 ms 322192 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 322192 KB Output is correct
2 Correct 3 ms 322192 KB Output is correct
3 Correct 3 ms 322192 KB Output is correct
4 Correct 3 ms 322192 KB Output is correct
5 Correct 3 ms 322192 KB Output is correct
6 Correct 3 ms 322192 KB Output is correct
7 Correct 3 ms 322192 KB Output is correct
8 Correct 3 ms 322192 KB Output is correct
9 Correct 3 ms 322192 KB Output is correct
10 Correct 3 ms 322192 KB Output is correct
11 Correct 3 ms 322192 KB Output is correct
12 Correct 0 ms 322192 KB Output is correct
13 Correct 0 ms 322192 KB Output is correct
14 Correct 0 ms 322192 KB Output is correct
15 Correct 0 ms 322192 KB Output is correct
16 Correct 0 ms 322192 KB Output is correct
17 Correct 0 ms 322192 KB Output is correct
18 Correct 0 ms 322192 KB Output is correct
19 Correct 0 ms 322192 KB Output is correct
20 Correct 0 ms 322192 KB Output is correct
21 Correct 3 ms 322192 KB Output is correct
22 Correct 3 ms 322192 KB Output is correct
23 Incorrect 0 ms 322192 KB Output isn't correct
24 Incorrect 0 ms 322192 KB Output isn't correct
25 Incorrect 0 ms 322192 KB Output isn't correct
26 Incorrect 0 ms 322192 KB Output isn't correct
27 Incorrect 0 ms 322192 KB Output isn't correct
28 Incorrect 0 ms 322192 KB Output isn't correct
29 Incorrect 0 ms 322192 KB Output isn't correct
30 Incorrect 0 ms 322192 KB Output isn't correct
31 Incorrect 0 ms 322192 KB Output isn't correct
32 Correct 0 ms 322192 KB Output is correct
33 Correct 0 ms 322192 KB Output is correct
34 Correct 0 ms 322192 KB Output is correct
35 Correct 0 ms 322192 KB Output is correct
36 Incorrect 0 ms 322192 KB Output isn't correct
37 Incorrect 0 ms 322192 KB Output isn't correct
38 Incorrect 0 ms 322192 KB Output isn't correct
39 Incorrect 0 ms 322192 KB Output isn't correct
40 Incorrect 0 ms 322192 KB Output isn't correct
41 Incorrect 0 ms 322192 KB Output isn't correct
42 Incorrect 0 ms 322192 KB Output isn't correct
43 Incorrect 0 ms 322192 KB Output isn't correct
44 Incorrect 0 ms 322192 KB Output isn't correct
45 Incorrect 0 ms 322192 KB Output isn't correct
46 Incorrect 0 ms 322192 KB Output isn't correct
47 Incorrect 0 ms 322192 KB Output isn't correct
48 Incorrect 0 ms 322192 KB Output isn't correct
49 Incorrect 0 ms 322192 KB Output isn't correct
50 Incorrect 0 ms 322192 KB Output isn't correct
51 Incorrect 0 ms 322192 KB Output isn't correct
52 Incorrect 0 ms 322192 KB Output isn't correct
53 Incorrect 0 ms 322192 KB Output isn't correct
54 Incorrect 0 ms 322192 KB Output isn't correct
55 Incorrect 0 ms 322192 KB Output isn't correct
56 Incorrect 0 ms 322192 KB Output isn't correct
57 Incorrect 0 ms 322192 KB Output isn't correct
58 Incorrect 0 ms 322192 KB Output isn't correct
59 Incorrect 0 ms 322192 KB Output isn't correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 322192 KB Output is correct
2 Correct 3 ms 322192 KB Output is correct
3 Correct 3 ms 322192 KB Output is correct
4 Correct 3 ms 322192 KB Output is correct
5 Correct 3 ms 322192 KB Output is correct
6 Correct 3 ms 322192 KB Output is correct
7 Correct 3 ms 322192 KB Output is correct
8 Correct 3 ms 322192 KB Output is correct
9 Correct 3 ms 322192 KB Output is correct
10 Correct 3 ms 322192 KB Output is correct
11 Correct 3 ms 322192 KB Output is correct
12 Correct 0 ms 322192 KB Output is correct
13 Correct 0 ms 322192 KB Output is correct
14 Correct 0 ms 322192 KB Output is correct
15 Correct 0 ms 322192 KB Output is correct
16 Correct 0 ms 322192 KB Output is correct
17 Correct 0 ms 322192 KB Output is correct
18 Correct 0 ms 322192 KB Output is correct
19 Correct 0 ms 322192 KB Output is correct
20 Correct 0 ms 322192 KB Output is correct
21 Correct 3 ms 322192 KB Output is correct
22 Correct 3 ms 322192 KB Output is correct
23 Incorrect 0 ms 322192 KB Output isn't correct
24 Incorrect 0 ms 322192 KB Output isn't correct
25 Incorrect 0 ms 322192 KB Output isn't correct
26 Incorrect 0 ms 322192 KB Output isn't correct
27 Incorrect 0 ms 322192 KB Output isn't correct
28 Incorrect 0 ms 322192 KB Output isn't correct
29 Incorrect 0 ms 322192 KB Output isn't correct
30 Incorrect 0 ms 322192 KB Output isn't correct
31 Incorrect 0 ms 322192 KB Output isn't correct
32 Correct 0 ms 322192 KB Output is correct
33 Correct 0 ms 322192 KB Output is correct
34 Correct 0 ms 322192 KB Output is correct
35 Correct 0 ms 322192 KB Output is correct
36 Incorrect 0 ms 322192 KB Output isn't correct
37 Incorrect 0 ms 322192 KB Output isn't correct
38 Incorrect 0 ms 322192 KB Output isn't correct
39 Incorrect 0 ms 322192 KB Output isn't correct
40 Correct 129 ms 322192 KB Output is correct
41 Correct 93 ms 322192 KB Output is correct
42 Correct 226 ms 322192 KB Output is correct
43 Correct 69 ms 322192 KB Output is correct
44 Correct 113 ms 322192 KB Output is correct
45 Correct 103 ms 322192 KB Output is correct
46 Correct 233 ms 322192 KB Output is correct
47 Correct 206 ms 322192 KB Output is correct
48 Correct 126 ms 322192 KB Output is correct
49 Correct 66 ms 322192 KB Output is correct
50 Correct 86 ms 322192 KB Output is correct
51 Correct 166 ms 322192 KB Output is correct
52 Correct 99 ms 322192 KB Output is correct
53 Correct 46 ms 322192 KB Output is correct
54 Correct 96 ms 322192 KB Output is correct
55 Correct 53 ms 322192 KB Output is correct
56 Correct 0 ms 322192 KB Output is correct
57 Correct 59 ms 322192 KB Output is correct
58 Correct 9 ms 322192 KB Output is correct
59 Correct 0 ms 322192 KB Output is correct
60 Correct 3 ms 322192 KB Output is correct
61 Correct 73 ms 322192 KB Output is correct
62 Correct 96 ms 322192 KB Output is correct
63 Incorrect 0 ms 322192 KB Output isn't correct
64 Incorrect 0 ms 322192 KB Output isn't correct
65 Incorrect 0 ms 322192 KB Output isn't correct
66 Incorrect 0 ms 322192 KB Output isn't correct
67 Incorrect 0 ms 322192 KB Output isn't correct
68 Incorrect 0 ms 322192 KB Output isn't correct
69 Incorrect 0 ms 322192 KB Output isn't correct
70 Incorrect 0 ms 322192 KB Output isn't correct
71 Incorrect 0 ms 322192 KB Output isn't correct
72 Incorrect 0 ms 322192 KB Output isn't correct
73 Incorrect 0 ms 322192 KB Output isn't correct
74 Incorrect 0 ms 322192 KB Output isn't correct
75 Incorrect 0 ms 322192 KB Output isn't correct
76 Incorrect 0 ms 322192 KB Output isn't correct
77 Incorrect 0 ms 322192 KB Output isn't correct
78 Incorrect 0 ms 322192 KB Output isn't correct
79 Incorrect 0 ms 322192 KB Output isn't correct
80 Incorrect 0 ms 322192 KB Output isn't correct
81 Incorrect 0 ms 322192 KB Output isn't correct
82 Incorrect 0 ms 322192 KB Output isn't correct
83 Incorrect 0 ms 322192 KB Output isn't correct
84 Incorrect 0 ms 322192 KB Output isn't correct
85 Incorrect 0 ms 322192 KB Output isn't correct
86 Incorrect 0 ms 322192 KB Output isn't correct
87 Incorrect 0 ms 322192 KB Output isn't correct
88 Incorrect 0 ms 322192 KB Output isn't correct
89 Incorrect 0 ms 322192 KB Output isn't correct
90 Incorrect 0 ms 322192 KB Output isn't correct
91 Incorrect 0 ms 322192 KB Output isn't correct
92 Incorrect 0 ms 322192 KB Output isn't correct
93 Incorrect 0 ms 322192 KB Output isn't correct
94 Incorrect 0 ms 322192 KB Output isn't correct
95 Incorrect 0 ms 322192 KB Output isn't correct
96 Incorrect 0 ms 322192 KB Output isn't correct
97 Incorrect 0 ms 322192 KB Output isn't correct
98 Incorrect 0 ms 322192 KB Output isn't correct
99 Incorrect 0 ms 322192 KB Output isn't correct
100 Incorrect 0 ms 322192 KB Output isn't correct
101 Incorrect 0 ms 322192 KB Output isn't correct
102 Incorrect 0 ms 322192 KB Output isn't correct
103 Incorrect 0 ms 322192 KB Output isn't correct
104 Incorrect 0 ms 322192 KB Output isn't correct
105 Incorrect 0 ms 322192 KB Output isn't correct
106 Incorrect 0 ms 322192 KB Output isn't correct
107 Incorrect 0 ms 322192 KB Output isn't correct