Submission #537505

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#include <cstdio>
#include <set>
using namespace std;

int main(){
	
	int N, M, X, Y;
	cin >> N >> M;
	cin >> X >> Y;

	vector <int> vecA(N);
	vector <int> vecB(M);
	for ( int i = 0; i < N; i++ ){
		cin >> vecA[i];
	}
	for ( int i = 0; i < M; i++ ){
		cin >> vecB[i];
	}

	int cnt = 0;

	vector <int> arrA(100001,0);
	vector <int> arrB(100001,0);
	for ( int i = 0; i < N; i++ ){
		arrA[vecA[i]+1] = 1;
	}
	for ( int i = 0; i < M; i++ ){
		arrB[vecB[i]+1] = 1;
	}

	for ( int i = 1; i <= arrA.size(); i++ ){
		if ( cnt%2 == 0 ){
			if ( arrA[i] == 1 ){
				i += X-1;
				cnt++;
			}
		}
		else if ( cnt%2 == 1 ){
			if ( arrB[i] == 1 ){
				cnt++;
				i += Y-1;
			}
		}
	}
	

	cout << cnt/2 << endl;


return 0;}

Submission Info

Submission Time
Task C - 飛行機乗り
User kana
Language C++ (GCC 4.9.2)
Score 30
Code Size 860 Byte
Status RE
Exec Time 426 ms
Memory 2344 KiB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 30 / 30 0 / 70
Status
AC × 3
AC × 18
AC × 18
RE × 15
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 122 ms 2208 KiB
subtask0_1.txt AC 84 ms 1948 KiB
subtask0_10.txt AC 96 ms 2088 KiB
subtask0_11.txt AC 104 ms 2076 KiB
subtask0_12.txt AC 117 ms 2208 KiB
subtask0_13.txt AC 92 ms 2080 KiB
subtask0_14.txt AC 107 ms 2208 KiB
subtask0_2.txt AC 102 ms 2088 KiB
subtask0_3.txt AC 101 ms 2080 KiB
subtask0_4.txt AC 101 ms 2088 KiB
subtask0_5.txt AC 82 ms 1956 KiB
subtask0_6.txt AC 124 ms 2212 KiB
subtask0_7.txt AC 103 ms 2084 KiB
subtask0_8.txt AC 84 ms 1956 KiB
subtask0_9.txt AC 128 ms 2344 KiB
subtask0_sample_01.txt AC 28 ms 1688 KiB
subtask0_sample_02.txt AC 27 ms 1576 KiB
subtask0_sample_03.txt AC 28 ms 1680 KiB
subtask1_0.txt RE 407 ms 2216 KiB
subtask1_1.txt RE 400 ms 2208 KiB
subtask1_10.txt RE 362 ms 1884 KiB
subtask1_11.txt RE 388 ms 2084 KiB
subtask1_12.txt RE 397 ms 2208 KiB
subtask1_13.txt RE 426 ms 2196 KiB
subtask1_14.txt RE 385 ms 2076 KiB
subtask1_2.txt RE 400 ms 2208 KiB
subtask1_3.txt RE 380 ms 2088 KiB
subtask1_4.txt RE 394 ms 2212 KiB
subtask1_5.txt RE 400 ms 2212 KiB
subtask1_6.txt RE 395 ms 2080 KiB
subtask1_7.txt RE 391 ms 2072 KiB
subtask1_8.txt RE 393 ms 2084 KiB
subtask1_9.txt RE 407 ms 2208 KiB