Submission #1517650

---

Source Code Expand

#include <iostream>
#include <vector>
#include <queue>
#include <sstream>
#include <algorithm>
#include <bitset>
#include <limits>
#include <map>
#include <set>
#include <iomanip>
#include <cmath>

using namespace std;

typedef long long int ll;
typedef std::numeric_limits<double> dbl;
const long long int LL_INF=1LL<<60;

vector<string> split(const string& input, char delimiter)
{
    stringstream stream(input);
    
    string field;
    vector<string> result;
    while (getline(stream, field, delimiter)) {
        result.push_back(field);
    }
    return result;
}

//#define DEBUG

ll A, B, M, N, D, K, Q, W, H, T, X, Y;

int main()
{
    cin >> N >> M;
    cin >> X >> Y;
    vector<ll> AtoB(N);
    vector<ll> BtoA(M);
    for (auto& a : AtoB)
        cin >> a;
    for (auto& b : BtoA)
        cin >> b;
    
    bool airportB = false; // A
    ll current = 0, num = 0;

    vector<ll>::const_iterator aItr = AtoB.begin();
    vector<ll>::const_iterator bItr = BtoA.begin();
    while (true) {
        //cout << current << ", " << *aItr << " " << *bItr << endl;
        if (!airportB) {
            while (aItr != AtoB.end() && current > *(aItr++))
                current = *aItr;
        } else {
            while (bItr != BtoA.end() && current > *(bItr++))
                current = *bItr;
        }

        if (aItr == AtoB.end() || bItr == BtoA.end())
            break;
        
        if (!airportB) {
            current += X;
            airportB = true;
        } else {
            current += Y;
            airportB = false;
            num++;
        }
    }

    cout << num << endl;

    //cout << fixed << setprecision(10) << M_PI * (double)rad << endl;

    return 0;
}

Submission Info

Judge Result