oj.uz

Submission #220650

# Submission time Handle Problem Language Result Execution time Memory
220650 2020-04-08T10:54:30 Z rama_pang Worst Reporter 3 (JOI18_worst_reporter3) C++14
100 / 100
 724 ms 9592 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
  int N, Q;
  scanf("%d %d", &N, &Q);

  vector<int> D(N + 1, 1);
  for (int i = 1; i <= N; i++) {
    scanf("%d", &D[i]);
  }

  // Compute the array X, which means the i-th person will move X[i] units every X[i] seconds
  vector<long long> X(N + 1, 1);
  for (int i = 1; i <= N; i++) {
    X[i] = ((D[i] + X[i - 1] - 1) / X[i - 1]) * X[i - 1];
  }

  auto Query = [&](int T, int L, int R) { // Count T - R - i <= T mod X[i] <= T - L - i
    int res = N + 1;

    { // Count how many i where T mod X[i] < T - R - i holds, and decrease it from answer.
      // T mod X[i] is monotonically increasing, so we can binary search for it.
      int lo = -1, hi = N;
      while (lo < hi) {
        int mid = (lo + hi + 1) >> 1;
        if (T % X[mid] < T - R - mid) {
          lo = mid;
        } else {
          hi = mid - 1;
        }
      }

      res -= lo + 1; // there are lo+1 such elements which T mod X[i] < T - R - i holds. (i = [0, N])
    }

    { // Count how many i where T mod X[i] > T - L - i holds, and decrease it from answer.
      // T mod X[i] is monotonically increasing, so we can binary search for it.
      int lo = 0, hi = N + 1;
      while (lo < hi) {
        int mid = (lo + hi) >> 1;
        if (T % X[mid] > T - L - mid) {
          hi = mid;
        } else {
          lo = mid + 1;
        }
      }

      res -= (N - lo) + 1; // there are N - lo + 1 such elements which T mod X[i] > T - L - i holds. (i = [0, N])
    }

    return res;
  };

  for (int qi = 0; qi < Q; qi++) {
    int T, L, R;
    scanf("%d %d %d", &T, &L, &R);
    printf("%d\n", Query(T, L, R));
  }

  return 0;
}

Compilation message

worst_reporter3.cpp: In function 'int main()':
worst_reporter3.cpp:6:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &N, &Q);
   ~~~~~^~~~~~~~~~~~~~~~~
worst_reporter3.cpp:10:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &D[i]);
     ~~~~~^~~~~~~~~~~~~
worst_reporter3.cpp:57:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d", &T, &L, &R);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 724 ms 9336 KB Output is correct
2 Correct 712 ms 9336 KB Output is correct
3 Correct 722 ms 9336 KB Output is correct
4 Correct 707 ms 9592 KB Output is correct
5 Correct 717 ms 9292 KB Output is correct
6 Correct 717 ms 9208 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 384 KB Output is correct

Subtask #3
81.0 / 81.0

# Verdict Execution time Memory Grader output
1 Correct 724 ms 9336 KB Output is correct
2 Correct 712 ms 9336 KB Output is correct
3 Correct 722 ms 9336 KB Output is correct
4 Correct 707 ms 9592 KB Output is correct
5 Correct 717 ms 9292 KB Output is correct
6 Correct 717 ms 9208 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 256 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 498 ms 7264 KB Output is correct
14 Correct 491 ms 7340 KB Output is correct
15 Correct 473 ms 7160 KB Output is correct
16 Correct 503 ms 7164 KB Output is correct
17 Correct 578 ms 8748 KB Output is correct
18 Correct 578 ms 8824 KB Output is correct
19 Correct 574 ms 8568 KB Output is correct
20 Correct 581 ms 8696 KB Output is correct
21 Correct 581 ms 8800 KB Output is correct
22 Correct 569 ms 8696 KB Output is correct
23 Correct 590 ms 8824 KB Output is correct
24 Correct 576 ms 8568 KB Output is correct
25 Correct 700 ms 9208 KB Output is correct
26 Correct 712 ms 9256 KB Output is correct
27 Correct 627 ms 9188 KB Output is correct
28 Correct 627 ms 9080 KB Output is correct
29 Correct 610 ms 9264 KB Output is correct
30 Correct 624 ms 9208 KB Output is correct
31 Correct 619 ms 9120 KB Output is correct
32 Correct 574 ms 8952 KB Output is correct
33 Correct 5 ms 256 KB Output is correct