Submission #856662


Source Code Expand

Copy
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;

int main(){
    int N, L, Q, a, b, cur, c, ans;
    vector<int> x;

    cin >> N;
    x.push_back(0);
    for(int i = 0; i < N; i++){
        cin >> c;
        x.push_back(c);
    }
    cin >> L;
    cin >> Q;
    for(int i = 0; i < Q; i++){
        ans = 1;
        cin >> a >> b;
        if(a > b)swap(a, b);
        cur = x[a];
        while(1){
            cur = *(upper_bound(x.begin(), x.end(), cur + L) - 1);
            if(cur >= x[b])break;
            else ans++;
        }
        cout << ans << endl;
        //cout << cur << endl;
        //cout << x[a] << " " << x[b] << endl;
    }
       



    return 0;
}

Submission Info

Submission Time
Task E - Tak and Hotels
User kay
Language C++14 (GCC 5.4.1)
Score 200
Code Size 737 Byte
Status TLE
Exec Time 3157 ms
Memory 1016 KB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 200 / 200 0 / 500
Status
AC × 1
AC × 14
AC × 17
TLE × 10
Set Name Test Cases
Sample example_01.txt
Subtask1 example_01.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt
All example_01.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt
Case Name Status Exec Time Memory
example_01.txt AC 4 ms 256 KB
subtask1_01.txt AC 5 ms 256 KB
subtask1_02.txt AC 4 ms 256 KB
subtask1_03.txt AC 13 ms 256 KB
subtask1_04.txt AC 34 ms 256 KB
subtask1_05.txt AC 13 ms 256 KB
subtask1_06.txt AC 11 ms 256 KB
subtask1_07.txt AC 9 ms 256 KB
subtask1_08.txt AC 13 ms 256 KB
subtask1_09.txt AC 13 ms 256 KB
subtask1_10.txt AC 24 ms 256 KB
subtask1_11.txt AC 25 ms 256 KB
subtask1_12.txt AC 23 ms 256 KB
subtask1_13.txt AC 22 ms 256 KB
subtask2_01.txt TLE 3157 ms 892 KB
subtask2_02.txt TLE 3157 ms 892 KB
subtask2_03.txt TLE 3157 ms 892 KB
subtask2_04.txt AC 591 ms 892 KB
subtask2_05.txt TLE 3157 ms 892 KB
subtask2_06.txt AC 902 ms 892 KB
subtask2_07.txt TLE 3153 ms 892 KB
subtask2_08.txt TLE 3153 ms 892 KB
subtask2_09.txt TLE 3153 ms 892 KB
subtask2_10.txt TLE 3153 ms 892 KB
subtask2_11.txt TLE 3157 ms 892 KB
subtask2_12.txt TLE 3157 ms 892 KB
subtask2_13.txt AC 901 ms 1016 KB