Submission #1671669


Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>

int main() {
	int x, y, n, m;
	std::cin >> n >> m >> x >> y;

	std::vector<int> a(n), b(m);
	for (auto&& e : a)
		std::cin >> e;
	for (auto&& e : b)
		std::cin >> e;

	int cur = a[0] + x, ans = 0;
	bool isA = false;
	while (true) {
		if (isA) {
			auto it = std::lower_bound(a.begin(), a.end(), cur);
			if (it == a.end())
				break;

			cur = *it + x;
		}
		else {
			auto it = std::lower_bound(b.begin(), b.end(), cur);
			if (it == b.end())
				break;

			cur = *it + y;
		}

		isA = !isA;
		if (isA)
			++ans;
	}

	std::cout << ans << std::endl;
}

Submission Info

Submission Time
Task C - 飛行機乗り
User azaika2098
Language C++14 (GCC 5.4.1)
Score 100
Code Size 649 Byte
Status AC
Exec Time 74 ms
Memory 1024 KB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 30 / 30 70 / 70
Status
AC × 3
AC × 18
AC × 33
Set Name Test Cases
Sample subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt
Subtask1 subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt, subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt
All subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt, subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt
Case Name Status Exec Time Memory
subtask0_0.txt AC 53 ms 1024 KB
subtask0_1.txt AC 32 ms 640 KB
subtask0_10.txt AC 38 ms 768 KB
subtask0_11.txt AC 42 ms 896 KB
subtask0_12.txt AC 47 ms 896 KB
subtask0_13.txt AC 37 ms 768 KB
subtask0_14.txt AC 45 ms 896 KB
subtask0_2.txt AC 41 ms 768 KB
subtask0_3.txt AC 42 ms 768 KB
subtask0_4.txt AC 40 ms 768 KB
subtask0_5.txt AC 30 ms 640 KB
subtask0_6.txt AC 53 ms 1024 KB
subtask0_7.txt AC 42 ms 896 KB
subtask0_8.txt AC 31 ms 640 KB
subtask0_9.txt AC 58 ms 1024 KB
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_0.txt AC 74 ms 896 KB
subtask1_1.txt AC 67 ms 896 KB
subtask1_10.txt AC 46 ms 640 KB
subtask1_11.txt AC 63 ms 896 KB
subtask1_12.txt AC 73 ms 896 KB
subtask1_13.txt AC 73 ms 896 KB
subtask1_14.txt AC 55 ms 768 KB
subtask1_2.txt AC 67 ms 896 KB
subtask1_3.txt AC 60 ms 768 KB
subtask1_4.txt AC 67 ms 896 KB
subtask1_5.txt AC 66 ms 896 KB
subtask1_6.txt AC 66 ms 896 KB
subtask1_7.txt AC 64 ms 896 KB
subtask1_8.txt AC 63 ms 896 KB
subtask1_9.txt AC 74 ms 896 KB