Submission #2120017
Source Code Expand
using namespace std; #include <iostream> #include <cstdlib> #include <algorithm> #include <cmath> #include <limits> #include <climits> #include <vector> #include <string> #include <set> #include <queue> #include <stack> #include <map> #include <numeric> typedef long long ll; typedef pair<int,int> p; #define rep(i, n) for(int (i) = 0; (i) < (n); (i)++) int main() { int aToNum, bToNum; ll aTobTime,bToaTime; cin >> aToNum >> bToNum >> aTobTime >> bToaTime; std::vector<int> va; std::vector<int> vb; int tmp; for (int i = 0; i < aToNum; i++) { cin >> tmp; va.push_back(tmp); } for (int i = 0; i < bToNum; i++) { cin >> tmp; vb.push_back(tmp); } int nt = 0; int result = 0; bool placeA = true; int lastTime = max(va[aToNum-1],vb[bToNum-1]); int ai = 0; int bi = 0; while (nt <= lastTime) { if (placeA) { for(;ai < aToNum; ai++){ if (nt <= va[ai]) { nt = va[ai]; nt += aTobTime; placeA = false; break; } } if (ai >= aToNum) goto LABEL; } else if(placeA == false) { for(;bi < bToNum; bi++){ if (nt <= vb[bi]) { nt = vb[bi]; nt += bToaTime; placeA = true; result++; break; } } if (bi >= bToNum) goto LABEL; } } LABEL: std::cout << result << '\n'; }
Submission Info
Submission Time | |
---|---|
Task | C - 飛行機乗り |
User | inazuma110 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1463 Byte |
Status | AC |
Exec Time | 72 ms |
Memory | 1400 KB |
Judge Result
Set Name | Sample | Subtask1 | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 30 / 30 | 70 / 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 | 53 ms | 1400 KB |
subtask0_1.txt | AC | 33 ms | 892 KB |
subtask0_10.txt | AC | 39 ms | 1016 KB |
subtask0_11.txt | AC | 44 ms | 1148 KB |
subtask0_12.txt | AC | 47 ms | 1400 KB |
subtask0_13.txt | AC | 38 ms | 1016 KB |
subtask0_14.txt | AC | 46 ms | 1272 KB |
subtask0_2.txt | AC | 42 ms | 1016 KB |
subtask0_3.txt | AC | 42 ms | 1016 KB |
subtask0_4.txt | AC | 41 ms | 1148 KB |
subtask0_5.txt | AC | 31 ms | 892 KB |
subtask0_6.txt | AC | 53 ms | 1400 KB |
subtask0_7.txt | AC | 44 ms | 1144 KB |
subtask0_8.txt | AC | 32 ms | 892 KB |
subtask0_9.txt | AC | 55 ms | 1400 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 | 72 ms | 1400 KB |
subtask1_1.txt | AC | 66 ms | 1272 KB |
subtask1_10.txt | AC | 45 ms | 892 KB |
subtask1_11.txt | AC | 63 ms | 1272 KB |
subtask1_12.txt | AC | 69 ms | 1272 KB |
subtask1_13.txt | AC | 72 ms | 1272 KB |
subtask1_14.txt | AC | 55 ms | 1148 KB |
subtask1_2.txt | AC | 68 ms | 1272 KB |
subtask1_3.txt | AC | 58 ms | 1272 KB |
subtask1_4.txt | AC | 65 ms | 1400 KB |
subtask1_5.txt | AC | 65 ms | 1400 KB |
subtask1_6.txt | AC | 64 ms | 1272 KB |
subtask1_7.txt | AC | 62 ms | 1144 KB |
subtask1_8.txt | AC | 64 ms | 1272 KB |
subtask1_9.txt | AC | 71 ms | 1400 KB |