Submission #839819

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
839819	2023-08-30T17:30:12 Z	allin27x	A Plus B (IOI23_aplusb)	C++17	100 / 100	42 ms	4632 KB

aplusb

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<signed>

bool check(int s, vi a, vi b){
	int n = a.size();
	int prs = 0;
	int j = n-1;
	for (int i=0; i<n; i++){
		for (; j>=0 && b[j]+a[i]>s; j--) ;
		prs += j+1;
	}
	return prs>=n;
}

vi smallest_sums(signed n, vi a, vi b){
	int l = 0, r = 2e9+7;
	while (l<r){
		int m = (l+r)/2;
		if (check(m, a, b)) r = m;
		else l = m+1;
	}
	vi ans(n,0);
	int ind = 0;
	for (int i=0; i<n; i++){
		for (int j=0; j<n && a[i]+b[j]<l; j++) ans[ind++] = a[i] + b[j];
	}
	while (ind < n) ans[ind++] = l;
	sort(ans.begin(), ans.end());
	return ans;
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	300 KB	Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	300 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	300 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	304 KB	Output is correct
14	Correct	1 ms	296 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct
31	Correct	1 ms	212 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	1 ms	340 KB	Output is correct
34	Correct	2 ms	340 KB	Output is correct
35	Correct	1 ms	384 KB	Output is correct
36	Correct	1 ms	340 KB	Output is correct

Subtask #4
40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	300 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	300 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	304 KB	Output is correct
14	Correct	1 ms	296 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct
31	Correct	1 ms	212 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	1 ms	340 KB	Output is correct
34	Correct	2 ms	340 KB	Output is correct
35	Correct	1 ms	384 KB	Output is correct
36	Correct	1 ms	340 KB	Output is correct
37	Correct	8 ms	1156 KB	Output is correct
38	Correct	29 ms	3360 KB	Output is correct
39	Correct	29 ms	3548 KB	Output is correct
40	Correct	31 ms	3388 KB	Output is correct
41	Correct	42 ms	4344 KB	Output is correct
42	Correct	39 ms	4572 KB	Output is correct
43	Correct	38 ms	4112 KB	Output is correct
44	Correct	8 ms	1216 KB	Output is correct
45	Correct	30 ms	3416 KB	Output is correct
46	Correct	31 ms	3524 KB	Output is correct
47	Correct	30 ms	3536 KB	Output is correct
48	Correct	41 ms	4632 KB	Output is correct
49	Correct	40 ms	4480 KB	Output is correct
50	Correct	38 ms	4224 KB	Output is correct
51	Correct	39 ms	3824 KB	Output is correct
52	Correct	39 ms	3792 KB	Output is correct
53	Correct	39 ms	3812 KB	Output is correct

Submission #839819

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 20.0 / 20.0

Subtask #3 30.0 / 30.0

Subtask #4 40.0 / 40.0

Subtask #1
10.0 / 10.0

Subtask #2
20.0 / 20.0

Subtask #3
30.0 / 30.0

Subtask #4
40.0 / 40.0