Submission #2513028


Source Code Expand

#include<iostream>
#include<algorithm>
using namespace std;

int const MAX = 30004;
long long a[MAX], b[MAX];

long long under_x(long long x, int n) {
	long long ans = 0;
	for (int i = 0; i<n; i++) {
		long long t = x / a[i];
		ans += upper_bound(b, b + n, t) - b;
	}
	return ans;
}

bool find_k(long long x, long long k, int n) {
	return under_x(x, n) >= k;
}
int c[5] = { 1,2,3,4,5 };
int main() {
	int n; long long k;
	cin >> n >> k;
	for (int i = 0; i<n; i++) {
		cin >> a[i];
	}
	for (int i = 0; i < n; i++) {
		cin >> b[i];
	}
	sort(a, a + n);
	sort(b, b + n);
	long long s, t, mid;
	s = a[0] * b[0] - 1;
	t = a[n - 1] * b[n - 1];
	while (t - s>1) {
		mid = (s + t) / 2;
		if (find_k(mid, k, n)) {
			t = mid;
		}
		else { s = mid; }
	}
	cout << t << endl;
}

Submission Info

Submission Time
Task C - 億マス計算
User nejineji
Language C++14 (GCC 5.4.1)
Score 100
Code Size 806 Byte
Status AC
Exec Time 107 ms
Memory 768 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 5 / 5 95 / 95
Status
AC × 3
AC × 18
AC × 48
Set Name Test Cases
Sample subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt
Subtask1 subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt
Subtask2 subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt, subtask2_22.txt, subtask2_23.txt, subtask2_24.txt, subtask2_25.txt, subtask2_26.txt, subtask2_27.txt, subtask2_28.txt, subtask2_29.txt, subtask2_30.txt, subtask2_31.txt, subtask2_32.txt, subtask2_33.txt, subtask2_34.txt, subtask2_35.txt, subtask2_36.txt, subtask2_37.txt, subtask2_38.txt, subtask2_39.txt, subtask2_40.txt, subtask2_41.txt, subtask2_42.txt, subtask2_43.txt, subtask2_44.txt, subtask2_45.txt
Case Name Status Exec Time Memory
subtask0_sample_01.txt AC 1 ms 256 KB
subtask0_sample_02.txt AC 1 ms 256 KB
subtask0_sample_03.txt AC 1 ms 256 KB
subtask1_01.txt AC 1 ms 256 KB
subtask1_02.txt AC 1 ms 256 KB
subtask1_03.txt AC 1 ms 256 KB
subtask1_04.txt AC 1 ms 256 KB
subtask1_05.txt AC 1 ms 256 KB
subtask1_06.txt AC 1 ms 256 KB
subtask1_07.txt AC 1 ms 256 KB
subtask1_08.txt AC 1 ms 256 KB
subtask1_09.txt AC 1 ms 256 KB
subtask1_10.txt AC 1 ms 256 KB
subtask1_11.txt AC 1 ms 256 KB
subtask1_12.txt AC 1 ms 256 KB
subtask1_13.txt AC 1 ms 256 KB
subtask1_14.txt AC 1 ms 256 KB
subtask1_15.txt AC 1 ms 256 KB
subtask2_16.txt AC 36 ms 384 KB
subtask2_17.txt AC 27 ms 640 KB
subtask2_18.txt AC 17 ms 384 KB
subtask2_19.txt AC 12 ms 384 KB
subtask2_20.txt AC 91 ms 768 KB
subtask2_21.txt AC 71 ms 768 KB
subtask2_22.txt AC 66 ms 768 KB
subtask2_23.txt AC 41 ms 768 KB
subtask2_24.txt AC 91 ms 768 KB
subtask2_25.txt AC 102 ms 768 KB
subtask2_26.txt AC 101 ms 768 KB
subtask2_27.txt AC 106 ms 768 KB
subtask2_28.txt AC 72 ms 768 KB
subtask2_29.txt AC 107 ms 768 KB
subtask2_30.txt AC 84 ms 768 KB
subtask2_31.txt AC 27 ms 768 KB
subtask2_32.txt AC 4 ms 256 KB
subtask2_33.txt AC 18 ms 384 KB
subtask2_34.txt AC 44 ms 768 KB
subtask2_35.txt AC 46 ms 768 KB
subtask2_36.txt AC 26 ms 384 KB
subtask2_37.txt AC 20 ms 384 KB
subtask2_38.txt AC 12 ms 384 KB
subtask2_39.txt AC 79 ms 768 KB
subtask2_40.txt AC 71 ms 768 KB
subtask2_41.txt AC 69 ms 768 KB
subtask2_42.txt AC 31 ms 384 KB
subtask2_43.txt AC 77 ms 768 KB
subtask2_44.txt AC 81 ms 768 KB
subtask2_45.txt AC 77 ms 768 KB