Submission #856808


Source Code Expand

Copy
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <sstream>
#include <string>
#define repd(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
#define mod 1000000007
#define inf 2000000007
#define mp make_pair
#define pb push_back
typedef long long ll;
using namespace std;
template <typename T>
inline void output(T a, int p) {
    if(p) cout << fixed << setprecision(p)  << a << "\n";
    else cout << a << "\n";
}
// end of template

int main() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    // source code
    int N;
    cin >> N;
    vector<ll> X(N);
    rep(i, N) cin >> X[i];
    ll L;
    cin >> L;
    vector<int> B(N);
    rep(i, N - 1){
        int l = i + 1, r = N;
        while(r - l > 1){
            int mid = (l + r) / 2;
            if(X[mid] - X[i] <= L) l = mid;
            else r = mid;
        }
        B[i] = l;
    }
    int Q;
    cin >> Q;
    vector<pair<int, int>> A(Q);
    rep(i, Q){
        int a, b;
        cin >> a >> b;
        if(a > b) swap(a, b);
        a--, b--;
        A[i] = mp(a, b);
    }
    
    rep(i, Q){
        int ret = 0;
        for(int j = A[i].first;j < A[i].second;j = B[j], ret++){
        }
        output(ret, 0);
    }
    
    
    return 0;
}

Submission Info

Submission Time
Task E - Tak and Hotels
User ctyl
Language C++14 (GCC 5.4.1)
Score 200
Code Size 1496 Byte
Status TLE
Exec Time 3153 ms
Memory 2688 KB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 200 / 200 0 / 500
Status
AC × 1
AC × 14
AC × 21
TLE × 6
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 4 ms 256 KB
subtask1_02.txt AC 4 ms 256 KB
subtask1_03.txt AC 4 ms 256 KB
subtask1_04.txt AC 5 ms 256 KB
subtask1_05.txt AC 5 ms 256 KB
subtask1_06.txt AC 4 ms 256 KB
subtask1_07.txt AC 4 ms 256 KB
subtask1_08.txt AC 4 ms 256 KB
subtask1_09.txt AC 5 ms 256 KB
subtask1_10.txt AC 5 ms 256 KB
subtask1_11.txt AC 5 ms 256 KB
subtask1_12.txt AC 5 ms 256 KB
subtask1_13.txt AC 5 ms 256 KB
subtask2_01.txt AC 1608 ms 2688 KB
subtask2_02.txt TLE 3153 ms 2432 KB
subtask2_03.txt AC 489 ms 2560 KB
subtask2_04.txt AC 52 ms 1664 KB
subtask2_05.txt AC 747 ms 1792 KB
subtask2_06.txt AC 77 ms 2432 KB
subtask2_07.txt AC 1984 ms 2688 KB
subtask2_08.txt TLE 3153 ms 2432 KB
subtask2_09.txt TLE 3153 ms 2432 KB
subtask2_10.txt TLE 3153 ms 2560 KB
subtask2_11.txt TLE 3153 ms 2432 KB
subtask2_12.txt TLE 3153 ms 2304 KB
subtask2_13.txt AC 79 ms 2432 KB