oj.uz

Submission #20681

# Submission time Handle Problem Language Result Execution time Memory
20681 2017-02-13T13:38:08 Z 우리OJ(#80, cki86201) 복불복 (OJUZ11_luck) C++14
22 / 100
 169 ms 2028 KB 
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <memory.h>
#include <math.h>
#include <assert.h>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <iostream>
#include <functional>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <bitset>

using namespace std;
typedef pair<int, int> Pi;
typedef long long ll;
#define pii Pi
#define pll PL
#define Fi first
#define Se second
#define pb(x) push_back(x)
#define sz(x) ((int)(x).size())
#define rep(i, n) for(int i=0;i<n;i++)
#define all(x) (x).begin(), (x).end()
typedef tuple<int, int, int> t3;
typedef pair<ll, ll> PL;

int n, k;
int A[110], B[110];

const int MOD = 1e9 + 7;

void subtask_1(){
	int p[8] = {}, ans = 0;
	rep(i, n)p[i] = i;
	do{
		int aa = 1e9, bb = 0;
		rep(i, n){
			if(i < k)aa = min(aa, A[i] + B[p[i]]);
			else bb = max(bb, A[i] + B[p[i]]);
		}
		if(aa >= bb)ans++;
	}while(next_permutation(p, p+n));
	printf("%d\n", ans);
}

void subtask_2(){
	ll ans = 0;
	for(int i=0;i<n;i++){
		int aa = A[0] + B[i];
		int v[110] = {};
		for(int j=1;j<n;j++){
			int c = 0;
			for(int k=0;k<n;k++)if(i != k && B[k] + A[j] <= aa)++c;
			for(int k=1;k<=c;k++)v[k]++;
		}
		ll now = 1;
		for(int j=n-1;j;j--){
			now = now * v[j] % MOD;
			for(int k=j;k;k--)v[k]--;
		}
		ans = (ans + now) % MOD;
	}
	printf("%lld\n", ans);
}

void subtask_3_get(int k, int *A, vector <int> &v, vector <Pi> &res, int inv){
	rep(a, k){
		rep(b, k){
			int t = A[a] + v[b];
			vector <int> cv(k+1, 0);
			rep(c, k){
				int cnt = 0;
				rep(d, k)if(inv * (A[c] + v[d]) >= inv * t)cnt++;
				cv[cnt]++;
			}
			ll g = 1;
			for(int c=k, r=0;c;c--){
				g = (cv[c] + r) * g % MOD;
				r += cv[c] - 1;
			}
			res.pb(Pi(t, (int)g));
		}
	}
	sort(all(res));
}

void subtask_3(){
	ll ans = 0;
	for(int i=0;i<1<<n;i++){
		if(__builtin_popcount(i) != k)continue;
		vector <int> v, w;
		rep(j, n){
			if(1<<j & i)v.pb(B[j]);
			else w.pb(B[j]);
		}
		vector <Pi> av, aw;
		subtask_3_get(k, A, v, av, 1);		//min
		subtask_3_get(n-k, A+k, w, aw, -1);	//max
		for(int j=sz(aw)-1;j;j--)aw[j].Se = (aw[j].Se - aw[j-1].Se + MOD) % MOD;
		for(int j=0;j<sz(aw);j++){
			int ww = aw[j].Fi;
			auto it = lower_bound(all(av), Pi(ww, -1));
			if(it != av.end())ans = (ans + (ll)aw[j].Se * (lower_bound(all(av), Pi(ww, -1))->Se)) % MOD;
		}
	}
	printf("%lld\n", ans);
}

void solve(){
	scanf("%d%d", &n, &k);
	rep(i, n)scanf("%d", A+i);
	rep(i, n)scanf("%d", B+i);
	sort(A, A+n); reverse(A, A+n);
	sort(B, B+n); reverse(B, B+n);
	int debug = 0;
	if(n <= 8){
		subtask_1();
		if(!debug)return;
	}
	if(k == 1){
		subtask_2();
		if(!debug)return;
	}
	if(n <= 15){
		subtask_3();
	}
}

int main(){
	int Tc = 1; //scanf("%d", &Tc);
	for(int tc=1;tc<=Tc;tc++){
		//printf("Case #%d: ", tc);
		solve();
	}
	return 0;
}

Compilation message

luck.cpp: In function 'void solve()':
luck.cpp:116:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &k);
                       ^
luck.cpp:117:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  rep(i, n)scanf("%d", A+i);
                           ^
luck.cpp:118:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  rep(i, n)scanf("%d", B+i);
                           ^

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2028 KB Output is correct
2 Correct 0 ms 2028 KB Output is correct
3 Correct 0 ms 2028 KB Output is correct
4 Correct 0 ms 2028 KB Output is correct
5 Correct 0 ms 2028 KB Output is correct
6 Correct 0 ms 2028 KB Output is correct
7 Correct 0 ms 2028 KB Output is correct
8 Correct 0 ms 2028 KB Output is correct
9 Correct 0 ms 2028 KB Output is correct
10 Correct 0 ms 2028 KB Output is correct
11 Correct 0 ms 2028 KB Output is correct
12 Correct 0 ms 2028 KB Output is correct
13 Correct 0 ms 2028 KB Output is correct
14 Correct 0 ms 2028 KB Output is correct
15 Correct 0 ms 2028 KB Output is correct
16 Correct 0 ms 2028 KB Output is correct
17 Correct 0 ms 2028 KB Output is correct
18 Correct 0 ms 2028 KB Output is correct
19 Correct 0 ms 2028 KB Output is correct
20 Correct 0 ms 2028 KB Output is correct
21 Correct 0 ms 2028 KB Output is correct
22 Correct 0 ms 2028 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2028 KB Output is correct
2 Correct 0 ms 2028 KB Output is correct
3 Correct 0 ms 2028 KB Output is correct
4 Correct 0 ms 2028 KB Output is correct
5 Correct 0 ms 2028 KB Output is correct
6 Correct 0 ms 2028 KB Output is correct
7 Correct 0 ms 2028 KB Output is correct
8 Correct 0 ms 2028 KB Output is correct
9 Correct 0 ms 2028 KB Output is correct
10 Correct 0 ms 2028 KB Output is correct
11 Correct 0 ms 2028 KB Output is correct
12 Correct 0 ms 2028 KB Output is correct
13 Correct 0 ms 2028 KB Output is correct
14 Correct 0 ms 2028 KB Output is correct
15 Correct 0 ms 2028 KB Output is correct
16 Correct 0 ms 2028 KB Output is correct
17 Correct 0 ms 2028 KB Output is correct

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2028 KB Output is correct
2 Correct 0 ms 2028 KB Output is correct
3 Correct 0 ms 2028 KB Output is correct
4 Correct 0 ms 2028 KB Output is correct
5 Correct 0 ms 2028 KB Output is correct
6 Correct 0 ms 2028 KB Output is correct
7 Correct 0 ms 2028 KB Output is correct
8 Correct 0 ms 2028 KB Output is correct
9 Correct 0 ms 2028 KB Output is correct
10 Correct 0 ms 2028 KB Output is correct
11 Correct 0 ms 2028 KB Output is correct
12 Correct 0 ms 2028 KB Output is correct
13 Correct 0 ms 2028 KB Output is correct
14 Correct 0 ms 2028 KB Output is correct
15 Correct 0 ms 2028 KB Output is correct
16 Correct 0 ms 2028 KB Output is correct
17 Correct 0 ms 2028 KB Output is correct
18 Correct 0 ms 2028 KB Output is correct
19 Correct 0 ms 2028 KB Output is correct
20 Correct 0 ms 2028 KB Output is correct
21 Correct 0 ms 2028 KB Output is correct
22 Correct 0 ms 2028 KB Output is correct
23 Correct 6 ms 2028 KB Output is correct
24 Correct 163 ms 2028 KB Output is correct
25 Correct 166 ms 2028 KB Output is correct
26 Correct 166 ms 2028 KB Output is correct
27 Correct 169 ms 2028 KB Output is correct
28 Correct 119 ms 2028 KB Output is correct
29 Correct 143 ms 2028 KB Output is correct
30 Runtime error 0 ms 2028 KB Execution killed with signal 11 (could be triggered by violating memory limits)
31 Correct 6 ms 2028 KB Output is correct
32 Correct 103 ms 2028 KB Output is correct
33 Correct 0 ms 2028 KB Output is correct
34 Correct 0 ms 2028 KB Output is correct
35 Correct 0 ms 2028 KB Output is correct
36 Correct 16 ms 2028 KB Output is correct
37 Correct 73 ms 2028 KB Output is correct
38 Correct 63 ms 2028 KB Output is correct
39 Correct 0 ms 2028 KB Output is correct
40 Correct 0 ms 2028 KB Output is correct
41 Correct 6 ms 2028 KB Output is correct
42 Correct 0 ms 2028 KB Output is correct
43 Runtime error 0 ms 2028 KB Execution killed with signal 11 (could be triggered by violating memory limits)
44 Correct 6 ms 2028 KB Output is correct
45 Correct 0 ms 2028 KB Output is correct

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2028 KB Output is correct
2 Correct 0 ms 2028 KB Output is correct
3 Correct 0 ms 2028 KB Output is correct
4 Correct 0 ms 2028 KB Output is correct
5 Correct 0 ms 2028 KB Output is correct
6 Correct 0 ms 2028 KB Output is correct
7 Correct 0 ms 2028 KB Output is correct
8 Correct 0 ms 2028 KB Output is correct
9 Correct 0 ms 2028 KB Output is correct
10 Correct 0 ms 2028 KB Output is correct
11 Correct 0 ms 2028 KB Output is correct
12 Correct 0 ms 2028 KB Output is correct
13 Correct 0 ms 2028 KB Output is correct
14 Correct 0 ms 2028 KB Output is correct
15 Correct 0 ms 2028 KB Output is correct
16 Correct 0 ms 2028 KB Output is correct
17 Correct 0 ms 2028 KB Output is correct
18 Correct 0 ms 2028 KB Output is correct
19 Correct 0 ms 2028 KB Output is correct
20 Correct 0 ms 2028 KB Output is correct
21 Correct 0 ms 2028 KB Output is correct
22 Correct 0 ms 2028 KB Output is correct
23 Correct 0 ms 2028 KB Output is correct
24 Correct 0 ms 2028 KB Output is correct
25 Correct 0 ms 2028 KB Output is correct
26 Correct 0 ms 2028 KB Output is correct
27 Correct 0 ms 2028 KB Output is correct
28 Correct 0 ms 2028 KB Output is correct
29 Correct 0 ms 2028 KB Output is correct
30 Correct 0 ms 2028 KB Output is correct
31 Correct 0 ms 2028 KB Output is correct
32 Correct 0 ms 2028 KB Output is correct
33 Correct 0 ms 2028 KB Output is correct
34 Correct 0 ms 2028 KB Output is correct
35 Correct 0 ms 2028 KB Output is correct
36 Correct 0 ms 2028 KB Output is correct
37 Correct 0 ms 2028 KB Output is correct
38 Correct 0 ms 2028 KB Output is correct
39 Correct 0 ms 2028 KB Output is correct
40 Incorrect 0 ms 2028 KB Output isn't correct
41 Incorrect 0 ms 2028 KB Output isn't correct
42 Incorrect 0 ms 2028 KB Output isn't correct
43 Incorrect 0 ms 2028 KB Output isn't correct
44 Incorrect 0 ms 2028 KB Output isn't correct
45 Incorrect 0 ms 2028 KB Output isn't correct
46 Incorrect 0 ms 2028 KB Output isn't correct
47 Incorrect 0 ms 2028 KB Output isn't correct
48 Incorrect 0 ms 2028 KB Output isn't correct
49 Incorrect 0 ms 2028 KB Output isn't correct
50 Incorrect 0 ms 2028 KB Output isn't correct
51 Incorrect 0 ms 2028 KB Output isn't correct
52 Incorrect 0 ms 2028 KB Output isn't correct
53 Incorrect 0 ms 2028 KB Output isn't correct
54 Incorrect 0 ms 2028 KB Output isn't correct
55 Incorrect 0 ms 2028 KB Output isn't correct
56 Incorrect 0 ms 2028 KB Output isn't correct
57 Incorrect 0 ms 2028 KB Output isn't correct
58 Incorrect 0 ms 2028 KB Output isn't correct
59 Incorrect 0 ms 2028 KB Output isn't correct

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2028 KB Output is correct
2 Correct 0 ms 2028 KB Output is correct
3 Correct 0 ms 2028 KB Output is correct
4 Correct 0 ms 2028 KB Output is correct
5 Correct 0 ms 2028 KB Output is correct
6 Correct 0 ms 2028 KB Output is correct
7 Correct 0 ms 2028 KB Output is correct
8 Correct 0 ms 2028 KB Output is correct
9 Correct 0 ms 2028 KB Output is correct
10 Correct 0 ms 2028 KB Output is correct
11 Correct 0 ms 2028 KB Output is correct
12 Correct 0 ms 2028 KB Output is correct
13 Correct 0 ms 2028 KB Output is correct
14 Correct 0 ms 2028 KB Output is correct
15 Correct 0 ms 2028 KB Output is correct
16 Correct 0 ms 2028 KB Output is correct
17 Correct 0 ms 2028 KB Output is correct
18 Correct 0 ms 2028 KB Output is correct
19 Correct 0 ms 2028 KB Output is correct
20 Correct 0 ms 2028 KB Output is correct
21 Correct 0 ms 2028 KB Output is correct
22 Correct 0 ms 2028 KB Output is correct
23 Correct 0 ms 2028 KB Output is correct
24 Correct 0 ms 2028 KB Output is correct
25 Correct 0 ms 2028 KB Output is correct
26 Correct 0 ms 2028 KB Output is correct
27 Correct 0 ms 2028 KB Output is correct
28 Correct 0 ms 2028 KB Output is correct
29 Correct 0 ms 2028 KB Output is correct
30 Correct 0 ms 2028 KB Output is correct
31 Correct 0 ms 2028 KB Output is correct
32 Correct 0 ms 2028 KB Output is correct
33 Correct 0 ms 2028 KB Output is correct
34 Correct 0 ms 2028 KB Output is correct
35 Correct 0 ms 2028 KB Output is correct
36 Correct 0 ms 2028 KB Output is correct
37 Correct 0 ms 2028 KB Output is correct
38 Correct 0 ms 2028 KB Output is correct
39 Correct 0 ms 2028 KB Output is correct
40 Correct 6 ms 2028 KB Output is correct
41 Correct 163 ms 2028 KB Output is correct
42 Correct 166 ms 2028 KB Output is correct
43 Correct 166 ms 2028 KB Output is correct
44 Correct 169 ms 2028 KB Output is correct
45 Correct 119 ms 2028 KB Output is correct
46 Correct 143 ms 2028 KB Output is correct
47 Runtime error 0 ms 2028 KB Execution killed with signal 11 (could be triggered by violating memory limits)
48 Correct 6 ms 2028 KB Output is correct
49 Correct 103 ms 2028 KB Output is correct
50 Correct 0 ms 2028 KB Output is correct
51 Correct 0 ms 2028 KB Output is correct
52 Correct 0 ms 2028 KB Output is correct
53 Correct 16 ms 2028 KB Output is correct
54 Correct 73 ms 2028 KB Output is correct
55 Correct 63 ms 2028 KB Output is correct
56 Correct 0 ms 2028 KB Output is correct
57 Correct 0 ms 2028 KB Output is correct
58 Correct 6 ms 2028 KB Output is correct
59 Correct 0 ms 2028 KB Output is correct
60 Runtime error 0 ms 2028 KB Execution killed with signal 11 (could be triggered by violating memory limits)
61 Correct 6 ms 2028 KB Output is correct
62 Correct 0 ms 2028 KB Output is correct
63 Incorrect 0 ms 2028 KB Output isn't correct
64 Incorrect 0 ms 2028 KB Output isn't correct
65 Incorrect 0 ms 2028 KB Output isn't correct
66 Incorrect 0 ms 2028 KB Output isn't correct
67 Incorrect 0 ms 2028 KB Output isn't correct
68 Incorrect 0 ms 2028 KB Output isn't correct
69 Incorrect 0 ms 2028 KB Output isn't correct
70 Incorrect 0 ms 2028 KB Output isn't correct
71 Incorrect 0 ms 2028 KB Output isn't correct
72 Incorrect 0 ms 2028 KB Output isn't correct
73 Incorrect 0 ms 2028 KB Output isn't correct
74 Incorrect 0 ms 2028 KB Output isn't correct
75 Incorrect 0 ms 2028 KB Output isn't correct
76 Incorrect 0 ms 2028 KB Output isn't correct
77 Incorrect 0 ms 2028 KB Output isn't correct
78 Incorrect 0 ms 2028 KB Output isn't correct
79 Incorrect 0 ms 2028 KB Output isn't correct
80 Incorrect 0 ms 2028 KB Output isn't correct
81 Incorrect 0 ms 2028 KB Output isn't correct
82 Incorrect 0 ms 2028 KB Output isn't correct
83 Incorrect 0 ms 2028 KB Output isn't correct
84 Incorrect 0 ms 2028 KB Output isn't correct
85 Incorrect 0 ms 2028 KB Output isn't correct
86 Incorrect 0 ms 2028 KB Output isn't correct
87 Incorrect 0 ms 2028 KB Output isn't correct
88 Incorrect 0 ms 2028 KB Output isn't correct
89 Incorrect 0 ms 2028 KB Output isn't correct
90 Incorrect 0 ms 2028 KB Output isn't correct
91 Incorrect 0 ms 2028 KB Output isn't correct
92 Incorrect 0 ms 2028 KB Output isn't correct
93 Incorrect 0 ms 2028 KB Output isn't correct
94 Incorrect 0 ms 2028 KB Output isn't correct
95 Incorrect 0 ms 2028 KB Output isn't correct
96 Incorrect 0 ms 2028 KB Output isn't correct
97 Incorrect 0 ms 2028 KB Output isn't correct
98 Incorrect 0 ms 2028 KB Output isn't correct
99 Incorrect 0 ms 2028 KB Output isn't correct
100 Incorrect 0 ms 2028 KB Output isn't correct
101 Incorrect 0 ms 2028 KB Output isn't correct
102 Incorrect 0 ms 2028 KB Output isn't correct
103 Incorrect 0 ms 2028 KB Output isn't correct
104 Incorrect 0 ms 2028 KB Output isn't correct
105 Incorrect 0 ms 2028 KB Output isn't correct
106 Incorrect 0 ms 2028 KB Output isn't correct
107 Incorrect 0 ms 2028 KB Output isn't correct