답안 #20510 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
20510	2017-02-12T07:22:18 Z	안녕하세요 투어리스트입니다 진짜에요(#49, Namnamseo)	복불복 (OJUZ11_luck)	C++14	9 / 100	3 ms	2032 KB

luck

#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=int(1e9)+7;

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 main()
{
#ifdef NAMSEO
	freopen("in", "r", stdin);
#endif
    in();
    if(n<=8) naive();
    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); }
                                  ^

Subtask #1
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	2032 KB	Output is correct
2	Correct	3 ms	2032 KB	Output is correct
3	Correct	3 ms	2032 KB	Output is correct
4	Correct	3 ms	2032 KB	Output is correct
5	Correct	3 ms	2032 KB	Output is correct
6	Correct	3 ms	2032 KB	Output is correct
7	Correct	3 ms	2032 KB	Output is correct
8	Correct	3 ms	2032 KB	Output is correct
9	Correct	3 ms	2032 KB	Output is correct
10	Correct	3 ms	2032 KB	Output is correct
11	Correct	3 ms	2032 KB	Output is correct
12	Correct	0 ms	2032 KB	Output is correct
13	Correct	0 ms	2032 KB	Output is correct
14	Correct	0 ms	2032 KB	Output is correct
15	Correct	0 ms	2032 KB	Output is correct
16	Correct	0 ms	2032 KB	Output is correct
17	Correct	0 ms	2032 KB	Output is correct
18	Correct	0 ms	2032 KB	Output is correct
19	Correct	0 ms	2032 KB	Output is correct
20	Correct	0 ms	2032 KB	Output is correct
21	Correct	3 ms	2032 KB	Output is correct
22	Correct	3 ms	2032 KB	Output is correct

Subtask #2
0 / 13.0

#	결과	메모리	Grader output
1	Incorrect	2032 KB	Output isn't correct
2	Incorrect	2032 KB	Output isn't correct
3	Incorrect	2032 KB	Output isn't correct
4	Incorrect	2032 KB	Output isn't correct
5	Incorrect	2032 KB	Output isn't correct
6	Incorrect	2032 KB	Output isn't correct
7	Incorrect	2032 KB	Output isn't correct
8	Incorrect	2032 KB	Output isn't correct
9	Incorrect	2032 KB	Output isn't correct
10	Correct	2032 KB	Output is correct
11	Correct	2032 KB	Output is correct
12	Correct	2032 KB	Output is correct
13	Correct	2032 KB	Output is correct
14	Incorrect	2032 KB	Output isn't correct
15	Incorrect	2032 KB	Output isn't correct
16	Incorrect	2032 KB	Output isn't correct
17	Incorrect	2032 KB	Output isn't correct

Subtask #3
0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	2032 KB	Output is correct
2	Correct	3 ms	2032 KB	Output is correct
3	Correct	3 ms	2032 KB	Output is correct
4	Correct	3 ms	2032 KB	Output is correct
5	Correct	3 ms	2032 KB	Output is correct
6	Correct	3 ms	2032 KB	Output is correct
7	Correct	3 ms	2032 KB	Output is correct
8	Correct	3 ms	2032 KB	Output is correct
9	Correct	3 ms	2032 KB	Output is correct
10	Correct	3 ms	2032 KB	Output is correct
11	Correct	3 ms	2032 KB	Output is correct
12	Correct	0 ms	2032 KB	Output is correct
13	Correct	0 ms	2032 KB	Output is correct
14	Correct	0 ms	2032 KB	Output is correct
15	Correct	0 ms	2032 KB	Output is correct
16	Correct	0 ms	2032 KB	Output is correct
17	Correct	0 ms	2032 KB	Output is correct
18	Correct	0 ms	2032 KB	Output is correct
19	Correct	0 ms	2032 KB	Output is correct
20	Correct	0 ms	2032 KB	Output is correct
21	Correct	3 ms	2032 KB	Output is correct
22	Correct	3 ms	2032 KB	Output is correct
23	Incorrect	0 ms	2032 KB	Output isn't correct
24	Incorrect	0 ms	2032 KB	Output isn't correct
25	Incorrect	0 ms	2032 KB	Output isn't correct
26	Incorrect	0 ms	2032 KB	Output isn't correct
27	Incorrect	0 ms	2032 KB	Output isn't correct
28	Incorrect	0 ms	2032 KB	Output isn't correct
29	Incorrect	0 ms	2032 KB	Output isn't correct
30	Incorrect	0 ms	2032 KB	Output isn't correct
31	Incorrect	0 ms	2032 KB	Output isn't correct
32	Incorrect	0 ms	2032 KB	Output isn't correct
33	Incorrect	0 ms	2032 KB	Output isn't correct
34	Incorrect	0 ms	2032 KB	Output isn't correct
35	Incorrect	0 ms	2032 KB	Output isn't correct
36	Incorrect	0 ms	2032 KB	Output isn't correct
37	Incorrect	0 ms	2032 KB	Output isn't correct
38	Incorrect	0 ms	2032 KB	Output isn't correct
39	Incorrect	0 ms	2032 KB	Output isn't correct
40	Incorrect	0 ms	2032 KB	Output isn't correct
41	Incorrect	0 ms	2032 KB	Output isn't correct
42	Incorrect	0 ms	2032 KB	Output isn't correct
43	Incorrect	0 ms	2032 KB	Output isn't correct
44	Incorrect	0 ms	2032 KB	Output isn't correct
45	Incorrect	0 ms	2032 KB	Output isn't correct

Subtask #4
0 / 26.0

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

Subtask #5
0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	2032 KB	Output is correct
2	Correct	3 ms	2032 KB	Output is correct
3	Correct	3 ms	2032 KB	Output is correct
4	Correct	3 ms	2032 KB	Output is correct
5	Correct	3 ms	2032 KB	Output is correct
6	Correct	3 ms	2032 KB	Output is correct
7	Correct	3 ms	2032 KB	Output is correct
8	Correct	3 ms	2032 KB	Output is correct
9	Correct	3 ms	2032 KB	Output is correct
10	Correct	3 ms	2032 KB	Output is correct
11	Correct	3 ms	2032 KB	Output is correct
12	Correct	0 ms	2032 KB	Output is correct
13	Correct	0 ms	2032 KB	Output is correct
14	Correct	0 ms	2032 KB	Output is correct
15	Correct	0 ms	2032 KB	Output is correct
16	Correct	0 ms	2032 KB	Output is correct
17	Correct	0 ms	2032 KB	Output is correct
18	Correct	0 ms	2032 KB	Output is correct
19	Correct	0 ms	2032 KB	Output is correct
20	Correct	0 ms	2032 KB	Output is correct
21	Correct	3 ms	2032 KB	Output is correct
22	Correct	3 ms	2032 KB	Output is correct
23	Incorrect	0 ms	2032 KB	Output isn't correct
24	Incorrect	0 ms	2032 KB	Output isn't correct
25	Incorrect	0 ms	2032 KB	Output isn't correct
26	Incorrect	0 ms	2032 KB	Output isn't correct
27	Incorrect	0 ms	2032 KB	Output isn't correct
28	Incorrect	0 ms	2032 KB	Output isn't correct
29	Incorrect	0 ms	2032 KB	Output isn't correct
30	Incorrect	0 ms	2032 KB	Output isn't correct
31	Incorrect	0 ms	2032 KB	Output isn't correct
32	Correct	0 ms	2032 KB	Output is correct
33	Correct	0 ms	2032 KB	Output is correct
34	Correct	0 ms	2032 KB	Output is correct
35	Correct	0 ms	2032 KB	Output is correct
36	Incorrect	0 ms	2032 KB	Output isn't correct
37	Incorrect	0 ms	2032 KB	Output isn't correct
38	Incorrect	0 ms	2032 KB	Output isn't correct
39	Incorrect	0 ms	2032 KB	Output isn't correct
40	Incorrect	0 ms	2032 KB	Output isn't correct
41	Incorrect	0 ms	2032 KB	Output isn't correct
42	Incorrect	0 ms	2032 KB	Output isn't correct
43	Incorrect	0 ms	2032 KB	Output isn't correct
44	Incorrect	0 ms	2032 KB	Output isn't correct
45	Incorrect	0 ms	2032 KB	Output isn't correct
46	Incorrect	0 ms	2032 KB	Output isn't correct
47	Incorrect	0 ms	2032 KB	Output isn't correct
48	Incorrect	0 ms	2032 KB	Output isn't correct
49	Incorrect	0 ms	2032 KB	Output isn't correct
50	Incorrect	0 ms	2032 KB	Output isn't correct
51	Incorrect	0 ms	2032 KB	Output isn't correct
52	Incorrect	0 ms	2032 KB	Output isn't correct
53	Incorrect	0 ms	2032 KB	Output isn't correct
54	Incorrect	0 ms	2032 KB	Output isn't correct
55	Incorrect	0 ms	2032 KB	Output isn't correct
56	Incorrect	0 ms	2032 KB	Output isn't correct
57	Incorrect	0 ms	2032 KB	Output isn't correct
58	Incorrect	0 ms	2032 KB	Output isn't correct
59	Incorrect	0 ms	2032 KB	Output isn't correct
60	Incorrect	0 ms	2032 KB	Output isn't correct
61	Incorrect	0 ms	2032 KB	Output isn't correct
62	Incorrect	0 ms	2032 KB	Output isn't correct
63	Incorrect	0 ms	2032 KB	Output isn't correct
64	Incorrect	0 ms	2032 KB	Output isn't correct
65	Incorrect	0 ms	2032 KB	Output isn't correct
66	Incorrect	0 ms	2032 KB	Output isn't correct
67	Incorrect	0 ms	2032 KB	Output isn't correct
68	Incorrect	0 ms	2032 KB	Output isn't correct
69	Incorrect	0 ms	2032 KB	Output isn't correct
70	Incorrect	0 ms	2032 KB	Output isn't correct
71	Incorrect	0 ms	2032 KB	Output isn't correct
72	Incorrect	0 ms	2032 KB	Output isn't correct
73	Incorrect	0 ms	2032 KB	Output isn't correct
74	Incorrect	0 ms	2032 KB	Output isn't correct
75	Incorrect	0 ms	2032 KB	Output isn't correct
76	Incorrect	0 ms	2032 KB	Output isn't correct
77	Incorrect	0 ms	2032 KB	Output isn't correct
78	Incorrect	0 ms	2032 KB	Output isn't correct
79	Incorrect	0 ms	2032 KB	Output isn't correct
80	Incorrect	0 ms	2032 KB	Output isn't correct
81	Incorrect	0 ms	2032 KB	Output isn't correct
82	Incorrect	0 ms	2032 KB	Output isn't correct
83	Incorrect	0 ms	2032 KB	Output isn't correct
84	Incorrect	0 ms	2032 KB	Output isn't correct
85	Incorrect	0 ms	2032 KB	Output isn't correct
86	Incorrect	0 ms	2032 KB	Output isn't correct
87	Incorrect	0 ms	2032 KB	Output isn't correct
88	Incorrect	0 ms	2032 KB	Output isn't correct
89	Incorrect	0 ms	2032 KB	Output isn't correct
90	Incorrect	0 ms	2032 KB	Output isn't correct
91	Incorrect	0 ms	2032 KB	Output isn't correct
92	Incorrect	0 ms	2032 KB	Output isn't correct
93	Incorrect	0 ms	2032 KB	Output isn't correct
94	Incorrect	0 ms	2032 KB	Output isn't correct
95	Incorrect	0 ms	2032 KB	Output isn't correct
96	Incorrect	0 ms	2032 KB	Output isn't correct
97	Incorrect	0 ms	2032 KB	Output isn't correct
98	Incorrect	0 ms	2032 KB	Output isn't correct
99	Incorrect	0 ms	2032 KB	Output isn't correct
100	Incorrect	0 ms	2032 KB	Output isn't correct
101	Incorrect	0 ms	2032 KB	Output isn't correct
102	Incorrect	0 ms	2032 KB	Output isn't correct
103	Incorrect	0 ms	2032 KB	Output isn't correct
104	Incorrect	0 ms	2032 KB	Output isn't correct
105	Incorrect	0 ms	2032 KB	Output isn't correct
106	Incorrect	0 ms	2032 KB	Output isn't correct
107	Incorrect	0 ms	2032 KB	Output isn't correct

답안 #20510

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 0 / 13.0

Subtask #3 0 / 25.0

Subtask #4 0 / 26.0

Subtask #5 0 / 27.0

Subtask #1
9.0 / 9.0

Subtask #2
0 / 13.0

Subtask #3
0 / 25.0

Subtask #4
0 / 26.0

Subtask #5
0 / 27.0