Submission #1456444
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(int 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; bool a[100010],b[114514], ok = false; ll aa(ll now); ll bb(ll now); //-------------------関数----------------------// ll aa(ll now) { for (int i = now; i <= maxa; i++) { if (a[i]) { bb(i + x); break; } } return 0; } ll bb(ll now) { for (int i = now; i <=maxb ; i++) { if (b[i]) { cnt++; aa(i + y); break; } } return 0; } int main() { cin >> n >> m>>x>>y; REP(i, n) { ll gomi; cin >> gomi; if (i == n - 1) { maxa = gomi; } a[gomi] = true; } REP(i, m) { ll gomi; cin >> gomi; if (i == m - 1) { maxb = gomi; } b[gomi] = true; } aa(0); cout << cnt << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 飛行機乗り |
User | keidaroo |
Language | C++14 (GCC 5.4.1) |
Score | 30 |
Code Size | 1337 Byte |
Status | RE |
Exec Time | 95 ms |
Memory | 768 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 | 640 KB |
subtask0_1.txt | AC | 32 ms | 384 KB |
subtask0_10.txt | AC | 37 ms | 384 KB |
subtask0_11.txt | AC | 42 ms | 384 KB |
subtask0_12.txt | AC | 45 ms | 768 KB |
subtask0_13.txt | AC | 36 ms | 384 KB |
subtask0_14.txt | AC | 45 ms | 384 KB |
subtask0_2.txt | AC | 41 ms | 384 KB |
subtask0_3.txt | AC | 41 ms | 640 KB |
subtask0_4.txt | AC | 39 ms | 384 KB |
subtask0_5.txt | AC | 30 ms | 384 KB |
subtask0_6.txt | AC | 51 ms | 640 KB |
subtask0_7.txt | AC | 42 ms | 384 KB |
subtask0_8.txt | AC | 30 ms | 384 KB |
subtask0_9.txt | AC | 53 ms | 640 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 | RE | 95 ms | 256 KB |
subtask1_1.txt | RE | 95 ms | 256 KB |
subtask1_10.txt | RE | 95 ms | 256 KB |
subtask1_11.txt | RE | 94 ms | 256 KB |
subtask1_12.txt | RE | 94 ms | 256 KB |
subtask1_13.txt | RE | 95 ms | 256 KB |
subtask1_14.txt | RE | 94 ms | 256 KB |
subtask1_2.txt | RE | 95 ms | 256 KB |
subtask1_3.txt | RE | 95 ms | 256 KB |
subtask1_4.txt | RE | 94 ms | 256 KB |
subtask1_5.txt | RE | 94 ms | 256 KB |
subtask1_6.txt | RE | 94 ms | 256 KB |
subtask1_7.txt | RE | 94 ms | 256 KB |
subtask1_8.txt | RE | 94 ms | 256 KB |
subtask1_9.txt | RE | 94 ms | 256 KB |