Submission #1480645


Source Code Expand

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

#define REP(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) REP(i,0,n)
#define INF (1<<30)
#define INFLL (1LL<<62LL)

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

int dx[8] = {0, 1, 0, -1, 1, -1, 1, -1};
int dy[8] = {1, 0, -1, 0, 1, -1, -1, 1};

int main() {
  ios_base::sync_with_stdio(false); cin.tie(0);
  int N, M, X, Y;
  vector<int> A, B;

  cin >> N >> M >> X >> Y;
  A.resize(N);
  B.resize(M);

  rep(i, N) cin >> A[i];
  rep(i, M) cin >> B[i];

  int t = 0;
  int ans = 0;
  while (true) {
    auto it = lower_bound(A.begin(), A.end(), t);
    if (it == A.end()) break;
    t = *it + X;
    it = lower_bound(B.begin(), B.end(), t);
    if (it == B.end()) break;
    t = *it + Y;
    ans++;
  }

  cout << ans << endl;
  return 0;
}

Submission Info

Submission Time
Task C - 飛行機乗り
User d2verb
Language C++14 (GCC 5.4.1)
Score 100
Code Size 895 Byte
Status AC
Exec Time 23 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 16 ms 1024 KB
subtask0_1.txt AC 10 ms 768 KB
subtask0_10.txt AC 11 ms 768 KB
subtask0_11.txt AC 13 ms 896 KB
subtask0_12.txt AC 15 ms 896 KB
subtask0_13.txt AC 11 ms 768 KB
subtask0_14.txt AC 14 ms 896 KB
subtask0_2.txt AC 12 ms 896 KB
subtask0_3.txt AC 13 ms 896 KB
subtask0_4.txt AC 12 ms 768 KB
subtask0_5.txt AC 9 ms 640 KB
subtask0_6.txt AC 16 ms 1024 KB
subtask0_7.txt AC 13 ms 896 KB
subtask0_8.txt AC 10 ms 640 KB
subtask0_9.txt AC 17 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 23 ms 896 KB
subtask1_1.txt AC 21 ms 896 KB
subtask1_10.txt AC 14 ms 640 KB
subtask1_11.txt AC 16 ms 896 KB
subtask1_12.txt AC 22 ms 896 KB
subtask1_13.txt AC 21 ms 1024 KB
subtask1_14.txt AC 14 ms 768 KB
subtask1_2.txt AC 18 ms 896 KB
subtask1_3.txt AC 19 ms 768 KB
subtask1_4.txt AC 19 ms 896 KB
subtask1_5.txt AC 17 ms 896 KB
subtask1_6.txt AC 21 ms 896 KB
subtask1_7.txt AC 19 ms 896 KB
subtask1_8.txt AC 17 ms 896 KB
subtask1_9.txt AC 23 ms 896 KB