Submission #7848225


Source Code Expand

Copy
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>

const int MOD = 1e9 + 7;
const int iINF = 2147483647 / 2;
const long long int llINF = 9223372036854775807 / 2;

using namespace std;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;

typedef pair<ll, ll> pll;
bool paircomp(const pll &a, const pll &b) {
  if (a.first == b.first)
    return a.second < b.second;
  return a.first < b.first;
}

#define REP(i, n) for (ll i = 0; i < (n); i++)
#define RREP(i, n) for (ll i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define AUTO(i, m) for (auto &i : m)
#define ALL(a) (a).begin(), (a).end()
#define MAX(vec) *std::max_element(vec.begin(), vec.end())
#define MIN(vec) *std::min_element(vec.begin(), vec.end())
#define ARGMAX(vec)                                                            \
  std::distance(vec.begin(), std::max_element(vec.begin(), vec.end()))
#define ARGMIN(vec)                                                            \
  std::distance(vec.begin(), std::min_element(vec.begin(), vec.end()))
#define REV(T) greater<T>()
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
#define VVL(a, b, c) vector<vector<ll>>(a, vector<ll>(b, c))
#define VVVL(a, b, c, d)                                                       \
  vector<vector<vector<ll>>>(a, vector<vector<ll>>(b, vector<ll>(c, d)))
#define SP(a) setprecision(a)
#define SQRT(a) sqrt((long double)(a))
#define DPOW(a, b) pow((long double)(a), (long double)(b))
#define UNIQUE(vec)                                                            \
  do {                                                                         \
    sort(ALL((vec)));                                                          \
    (vec).erase(std::unique(ALL((vec))), (vec).end());                         \
  } while (0)

ll POW(ll n, ll m) {
  if (m == 0) {
    return 1;
  } else if (m % 2 == 0) {
    ll tmp = POW(n, m / 2);
    return (tmp * tmp);
  } else {
    return (n * POW(n, m - 1));
  }
}

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ll N, L, Q;
  cin >> N;
  vl X(N);
  REP(i, N) cin >> X[i];
  cin >> L >> Q;
  vvl r = VVL(20, N + 1, 0);
  REP(i, N) { r[0][i] = upper_bound(ALL(X), X[i] + 10) - X.begin() - 1; }
  FOR(j, 1, 20) {
    REP(i, N) { r[j][i] = r[j - 1][r[j - 1][i]]; }
  }
  vl ans(Q);
  REP(q, Q) {
    ll a, b;
    cin >> a >> b;
    ll s = min(a, b);
    ll e = max(a, b);
    ll an = 0;

    RREP(i, 20) {
      if (e <= r[i][s]) {
        an = POW(2, i);
      } else {
        s = r[i][s];
      }
    }
    ans[q] = an;
  }
  REP(i, Q) cout << ans[i] << endl;

  return 0;
}

Submission Info

Submission Time
Task E - Tak and Hotels
User grayf
Language C++14 (GCC 5.4.1)
Score 0
Code Size 3085 Byte
Status WA
Exec Time 254 ms
Memory 17648 KB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 0 / 200 0 / 500
Status
WA × 1
WA × 14
WA × 27
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 WA 1 ms 256 KB
subtask1_01.txt WA 1 ms 256 KB
subtask1_02.txt WA 1 ms 256 KB
subtask1_03.txt WA 3 ms 384 KB
subtask1_04.txt WA 3 ms 384 KB
subtask1_05.txt WA 3 ms 384 KB
subtask1_06.txt WA 2 ms 384 KB
subtask1_07.txt WA 2 ms 384 KB
subtask1_08.txt WA 3 ms 384 KB
subtask1_09.txt WA 3 ms 384 KB
subtask1_10.txt WA 3 ms 384 KB
subtask1_11.txt WA 3 ms 384 KB
subtask1_12.txt WA 3 ms 384 KB
subtask1_13.txt WA 3 ms 384 KB
subtask2_01.txt WA 240 ms 17648 KB
subtask2_02.txt WA 248 ms 17648 KB
subtask2_03.txt WA 254 ms 17648 KB
subtask2_04.txt WA 155 ms 11772 KB
subtask2_05.txt WA 155 ms 11772 KB
subtask2_06.txt WA 245 ms 17648 KB
subtask2_07.txt WA 236 ms 17648 KB
subtask2_08.txt WA 253 ms 17648 KB
subtask2_09.txt WA 250 ms 17648 KB
subtask2_10.txt WA 240 ms 17648 KB
subtask2_11.txt WA 233 ms 16304 KB
subtask2_12.txt WA 221 ms 17648 KB
subtask2_13.txt WA 232 ms 17648 KB