Submission #1456479


Source Code Expand

#include<iostream>
#include<algorithm>
#include <string>
#include<cstdio>
#include<math.h>
#include<stack>
#include<cstring>
#include<vector>
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define EREP(i,n) for(int i=(n-1);i>=0;--i)
#define D(n,retu) REP(i,n){cin>>retu[i];}
#define mod 1000000007
#define MIN -93193111451418101
using namespace std;
typedef long long int ll;
template<typename T>
void fill_all(T& arr, const T& v) {
	arr = v;
}
template<typename T, typename ARR>
void fill_all(ARR& arr, const T& v) {
	for (auto& i : arr) { fill_all(i, v); }
}

//------------------変数-----------------------//
ll n, q, w, h, k, m, x, y, cnt = 0, maxa, maxb;
vector<ll> a, b; bool ok = false;
ll aa(ll now); ll bb(ll now);
//-------------------関数----------------------//

ll aa(ll now) {
	if (now > maxa) { return 0; }
	vector<ll>::iterator w = upper_bound(a.begin(), a.end(), now-1);
	bb(*w + x);
	return 0;
}

ll bb(ll now) {
	if (now > maxb) { return 0; }
	vector<ll>::iterator w = upper_bound(b.begin(), b.end(), now-1);
	cnt++;
	aa(*w + y);
	return 0;
}

int main() {
	cin >> n >> m >> x >> y;
	REP(i, n) {
		ll gomi; cin >> gomi;
		if (i == n - 1) { maxa = gomi; }
		a.push_back(gomi);
	}
	REP(i, m) { ll gomi; cin >> gomi; if (i == m - 1) { maxb = gomi; } b.push_back(gomi); }
	aa(0);
	cout << cnt << endl;

	return 0;
}

Submission Info

Submission Time
Task C - 飛行機乗り
User keidaroo
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1417 Byte
Status AC
Exec Time 75 ms
Memory 2548 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 54 ms 2420 KB
subtask0_1.txt AC 33 ms 1400 KB
subtask0_10.txt AC 38 ms 1780 KB
subtask0_11.txt AC 43 ms 1912 KB
subtask0_12.txt AC 47 ms 2548 KB
subtask0_13.txt AC 37 ms 1780 KB
subtask0_14.txt AC 47 ms 2420 KB
subtask0_2.txt AC 41 ms 1908 KB
subtask0_3.txt AC 43 ms 2036 KB
subtask0_4.txt AC 40 ms 1912 KB
subtask0_5.txt AC 31 ms 1400 KB
subtask0_6.txt AC 53 ms 2420 KB
subtask0_7.txt AC 43 ms 1908 KB
subtask0_8.txt AC 33 ms 1528 KB
subtask0_9.txt AC 55 ms 2548 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 75 ms 2420 KB
subtask1_1.txt AC 68 ms 2420 KB
subtask1_10.txt AC 46 ms 1528 KB
subtask1_11.txt AC 63 ms 2420 KB
subtask1_12.txt AC 73 ms 2420 KB
subtask1_13.txt AC 74 ms 2420 KB
subtask1_14.txt AC 55 ms 1912 KB
subtask1_2.txt AC 68 ms 2420 KB
subtask1_3.txt AC 61 ms 2420 KB
subtask1_4.txt AC 67 ms 2548 KB
subtask1_5.txt AC 65 ms 2548 KB
subtask1_6.txt AC 66 ms 2420 KB
subtask1_7.txt AC 63 ms 2292 KB
subtask1_8.txt AC 63 ms 2420 KB
subtask1_9.txt AC 74 ms 2548 KB