Submission #535922
Source Code Expand
#define NDEBUG
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>
#include <iomanip>
#include <fstream>
#include <bitset>
using namespace std;
#define foreach(it, c) for (__typeof__((c).begin()) it=(c).begin(); it != (c).end(); ++it)
template <typename T> void print_container(ostream& os, const T& c) { const char* _s = " "; if (!c.empty()) { __typeof__(c.begin()) last = --c.end(); foreach (it, c) { os << *it; if (it != last) os << _s; } } }
template <typename T> ostream& operator<<(ostream& os, const vector<T>& c) { print_container(os, c); return os; }
template <typename T> ostream& operator<<(ostream& os, const set<T>& c) { print_container(os, c); return os; }
template <typename T> ostream& operator<<(ostream& os, const multiset<T>& c) { print_container(os, c); return os; }
template <typename T> ostream& operator<<(ostream& os, const deque<T>& c) { print_container(os, c); return os; }
template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& c) { print_container(os, c); return os; }
template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
template <typename T> void print(T a, int n, const string& split = " ") { for (int i = 0; i < n; i++) { cout << a[i]; if (i + 1 != n) cout << split; } cout << endl; }
template <typename T> void print2d(T a, int w, int h, int width = -1, int br = 0) { for (int i = 0; i < h; ++i) { for (int j = 0; j < w; ++j) { if (width != -1) cout.width(width); cout << a[i][j] << ' '; } cout << endl; } while (br--) cout << endl; }
template <typename T> void input(T& a, int n) { for (int i = 0; i < n; ++i) cin >> a[i]; }
#define dump(v) (cout << #v << ": " << v << endl)
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define erep(i, n) for (int i = 0; i <= (int)(n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define clr(a, x) memset(a, x, sizeof(a))
#define sz(a) ((int)(a).size())
#define mp(a, b) make_pair(a, b)
#define ten(n) ((long long)(1e##n))
template <typename T, typename U> void upmin(T& a, const U& b) { a = min<T>(a, b); }
template <typename T, typename U> void upmax(T& a, const U& b) { a = max<T>(a, b); }
template <typename T> void uniq(T& a) { sort(a.begin(), a.end()); a.erase(unique(a.begin(), a.end()), a.end()); }
template <class T> string to_s(const T& a) { ostringstream os; os << a; return os.str(); }
template <class T> T to_T(const string& s) { istringstream is(s); T res; is >> res; return res; }
void fast_io() { cin.tie(0); ios::sync_with_stdio(false); }
bool in_rect(int x, int y, int w, int h) { return 0 <= x && x < w && 0 <= y && y < h; }
typedef long long ll;
typedef pair<int, int> pint;
const int dx[] = { 0, 1, 0, -1 };
const int dy[] = { 1, 0, -1, 0 };
int main()
{
fast_io();
int n, m, x, y;
cin >> n >> m >> x >> y;
vector<int> a(n), b(m);
input(a, n);
input(b, m);
a.push_back(ten(9) + 10);
b.push_back(ten(9) + 10);
int t = 0;
int around = 0;
while (true)
{
int from = *lower_bound(all(a), t);
if (from > ten(9))
break;
int to = *lower_bound(all(b), from + x);
if (to > ten(9))
break;
++around;
t = to + y;
}
cout << around << endl;
}
Submission Info
Submission Time |
|
Task |
C - 飛行機乗り |
User |
takapt |
Language |
C++11 (GCC 4.9.2) |
Score |
30 |
Code Size |
3796 Byte |
Status |
TLE |
Exec Time |
2035 ms |
Memory |
1956 KB |
Judge Result
Set Name |
Sample |
Subtask1 |
All |
Score / Max Score |
0 / 0 |
30 / 30 |
0 / 70 |
Status |
|
|
|
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 |
51 ms |
1868 KB |
subtask0_1.txt |
AC |
42 ms |
1476 KB |
subtask0_10.txt |
AC |
44 ms |
1576 KB |
subtask0_11.txt |
AC |
45 ms |
1708 KB |
subtask0_12.txt |
AC |
51 ms |
1832 KB |
subtask0_13.txt |
AC |
44 ms |
1572 KB |
subtask0_14.txt |
AC |
48 ms |
1760 KB |
subtask0_2.txt |
AC |
46 ms |
1700 KB |
subtask0_3.txt |
AC |
47 ms |
1708 KB |
subtask0_4.txt |
AC |
46 ms |
1572 KB |
subtask0_5.txt |
AC |
41 ms |
1444 KB |
subtask0_6.txt |
AC |
53 ms |
1864 KB |
subtask0_7.txt |
AC |
46 ms |
1696 KB |
subtask0_8.txt |
AC |
41 ms |
1460 KB |
subtask0_9.txt |
AC |
54 ms |
1956 KB |
subtask0_sample_01.txt |
AC |
26 ms |
800 KB |
subtask0_sample_02.txt |
AC |
26 ms |
916 KB |
subtask0_sample_03.txt |
AC |
26 ms |
916 KB |
subtask1_0.txt |
AC |
62 ms |
1792 KB |
subtask1_1.txt |
AC |
58 ms |
1752 KB |
subtask1_10.txt |
AC |
48 ms |
1440 KB |
subtask1_11.txt |
TLE |
2034 ms |
1700 KB |
subtask1_12.txt |
AC |
61 ms |
1788 KB |
subtask1_13.txt |
TLE |
2033 ms |
1812 KB |
subtask1_14.txt |
TLE |
2035 ms |
1588 KB |
subtask1_2.txt |
TLE |
2035 ms |
1752 KB |
subtask1_3.txt |
AC |
56 ms |
1572 KB |
subtask1_4.txt |
TLE |
2033 ms |
1724 KB |
subtask1_5.txt |
TLE |
2034 ms |
1824 KB |
subtask1_6.txt |
AC |
60 ms |
1700 KB |
subtask1_7.txt |
TLE |
2034 ms |
1704 KB |
subtask1_8.txt |
TLE |
2033 ms |
1716 KB |
subtask1_9.txt |
AC |
63 ms |
1888 KB |