Submission #1175900


Source Code Expand

//#define _GRIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;

// 基本テンプレート
#pragma region MACRO
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define PED cout << "\n"
#define rep(i,n) for(int i=0; i<(int)n; ++i)
#define REP(i,x,n) for(int i=x; i<(int)n; ++i)
#define repi(i,n) for(int i=0; i<=(int)n; ++i)
#define REPI(i,x,n) for(int i=x; i<=(int)n; ++i)
#define ILP while(true)
#define FOR(i,c) for(__typeof((c).begin())!=(c).begin(); i!=(c).end(); ++i)
#define ALL(c) (c).begin(), (c).end()
#define mp make_pair
#pragma endregion

// 型
#pragma region TYPE_DEF
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<string, string> pss;
typedef pair<string, int> psi;
typedef pair<int, string> pis;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef vector<long> vl;
typedef vector<long long> vll;
typedef vector<string> vs;
#pragma endregion

// Effective std
#pragma region ESTD
template<typename C, typename T> int count(C& c, T t) { return count(ALL(c), t); }
template<typename C, typename F> int count_if(C& c, F f) { return count_if(ALL(c), f); }
template<typename C, typename T> void erase(C& c, T t) { remove(ALL(c), t), c.end(); }
template<typename C> void remove(vector<C>& c, unsigned int index) { c.erase(c.begin()+index); }
template<typename C, typename T, typename U> void replace(C& c, T t, U u) { replace(ALL(c), t, u); }
template<typename C, typename F, typename U> void replace_if(C& c, F f, U u) { (ALL(c), f, u); }
template<typename C> void reverse(C& c) { reverse(ALL(c)); }
template<typename C> void sort(C& c) { sort(ALL(c)); }
template<typename C, typename Pred> void sort(C& c, Pred p) { sort(ALL(c), p); }
#pragma endregion

// 定数
#pragma region CONST_VAL
constexpr int PI = (2*acos(0.0));
constexpr int EPS = (1e-9);
constexpr int MOD = (int)(1e9+7);
constexpr int INF = 100000000;
#pragma endregion


int main()
{
    int n, m, x, y;
    cin >> n >> m >> x >> y;
    vi a(n), b(m);
    rep(i,n) cin >> a[i];
    rep(i,m) cin >> b[i];
    sort(a);
    sort(b);

    int tmp = a[0];
    int ans = 0;
    int dir = 1;
    while(true) {
        if(dir==0) {
            auto it = lower_bound(ALL(a),tmp+y);
            if(it==a.end()) break;
            tmp = *it;
            dir = 1;
        }
        else {
            auto it = lower_bound(ALL(b),tmp+x);
            if(it==b.end()) break;
            tmp = *it;
            ans++;
            dir = 0;
        }
    }
    P(ans);
    return 0;
}

Submission Info

Submission Time
Task C - 飛行機乗り
User noconocolib
Language C++14 (GCC 5.4.1)
Score 100
Code Size 2608 Byte
Status AC
Exec Time 77 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 59 ms 1024 KB
subtask0_1.txt AC 34 ms 640 KB
subtask0_10.txt AC 40 ms 768 KB
subtask0_11.txt AC 44 ms 896 KB
subtask0_12.txt AC 49 ms 896 KB
subtask0_13.txt AC 38 ms 768 KB
subtask0_14.txt AC 48 ms 896 KB
subtask0_2.txt AC 43 ms 768 KB
subtask0_3.txt AC 45 ms 768 KB
subtask0_4.txt AC 42 ms 768 KB
subtask0_5.txt AC 32 ms 640 KB
subtask0_6.txt AC 56 ms 1024 KB
subtask0_7.txt AC 45 ms 896 KB
subtask0_8.txt AC 33 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 77 ms 896 KB
subtask1_1.txt AC 69 ms 896 KB
subtask1_10.txt AC 49 ms 640 KB
subtask1_11.txt AC 67 ms 896 KB
subtask1_12.txt AC 76 ms 896 KB
subtask1_13.txt AC 76 ms 896 KB
subtask1_14.txt AC 56 ms 768 KB
subtask1_2.txt AC 70 ms 896 KB
subtask1_3.txt AC 62 ms 768 KB
subtask1_4.txt AC 69 ms 896 KB
subtask1_5.txt AC 67 ms 896 KB
subtask1_6.txt AC 68 ms 896 KB
subtask1_7.txt AC 66 ms 896 KB
subtask1_8.txt AC 66 ms 896 KB
subtask1_9.txt AC 77 ms 896 KB