Submission #3571180


Source Code Expand

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
    int n, m, x, y, ans = 1, k;
    vector<int> a, b;
    cin >> n >> m >> x >> y;
    for(int i = 0; i < n; i++){
        scanf("%d", &k);
        a.push_back(k);
    }
    for(int i = 0; i < m; i++){
        scanf("%d", &k);
        b.push_back(k);
    }
    int t = a[0];
    for(int i = 0; ; i++){
        if(i % 2 == 0){
            auto itr = lower_bound(b.begin(), b.end(), t+x);
            if(itr == b.end()) break;
            t = *itr;
        }
        else{
            auto itr = lower_bound(a.begin(), a.end(), t+y);
            if(itr == a.end()) break;
            t = *itr;
        }
        ans += 1;
    }
    cout << ans / 2 << endl;
    return 0;
}

Submission Info

Submission Time
Task C - 飛行機乗り
User echt
Language C++14 (GCC 5.4.1)
Score 100
Code Size 793 Byte
Status AC
Exec Time 26 ms
Memory 1400 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:11:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &k);
                        ^
./Main.cpp:15:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &k);
                        ^

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 20 ms 1400 KB
subtask0_1.txt AC 12 ms 892 KB
subtask0_10.txt AC 14 ms 1016 KB
subtask0_11.txt AC 15 ms 1148 KB
subtask0_12.txt AC 18 ms 1400 KB
subtask0_13.txt AC 13 ms 1016 KB
subtask0_14.txt AC 17 ms 1272 KB
subtask0_2.txt AC 15 ms 1016 KB
subtask0_3.txt AC 16 ms 1144 KB
subtask0_4.txt AC 15 ms 1148 KB
subtask0_5.txt AC 11 ms 892 KB
subtask0_6.txt AC 20 ms 1400 KB
subtask0_7.txt AC 16 ms 1144 KB
subtask0_8.txt AC 12 ms 892 KB
subtask0_9.txt AC 21 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 26 ms 1400 KB
subtask1_1.txt AC 23 ms 1272 KB
subtask1_10.txt AC 16 ms 892 KB
subtask1_11.txt AC 20 ms 1272 KB
subtask1_12.txt AC 25 ms 1272 KB
subtask1_13.txt AC 25 ms 1400 KB
subtask1_14.txt AC 17 ms 1148 KB
subtask1_2.txt AC 21 ms 1272 KB
subtask1_3.txt AC 21 ms 1272 KB
subtask1_4.txt AC 23 ms 1400 KB
subtask1_5.txt AC 20 ms 1400 KB
subtask1_6.txt AC 23 ms 1272 KB
subtask1_7.txt AC 22 ms 1144 KB
subtask1_8.txt AC 20 ms 1272 KB
subtask1_9.txt AC 26 ms 1400 KB