Submission #484071

#	Time	Username	Problem	Language	Result	Execution time	Memory
484071		xiaowuc1	Worst Reporter 3 (JOI18_worst_reporter3)	C++17	100 / 100	856 ms	29176 KiB

worst_reporter3

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

// BEGIN NO SAD
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
typedef vector<int> vi;
#define f first
#define s second
#define derr if(1) cerr
// END NO SAD

template<class Fun>
class y_combinator_result {
  Fun fun_;
public:
  template<class T>
  explicit y_combinator_result(T &&fun): fun_(std::forward<T>(fun)) {}

  template<class ...Args>
  decltype(auto) operator()(Args &&...args) {
    return fun_(std::ref(*this), std::forward<Args>(args)...);
  }
};

template<class Fun>
decltype(auto) y_combinator(Fun &&fun) {
  return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun));
}

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vector<ll>> matrix;

void solve() {
  int n, q;
  cin >> n >> q;
  vector<ll> slows(n+1);
  slows[0] = 1;
  for(int i = 1; i <= n; i++) cin >> slows[i];
  vector<ll> actual(n+1, 1);
  auto eval = [&](int idx, ll t) {
    ll interval = t / actual[idx];
    return interval * actual[idx] - idx;
  };
  auto getamt = [&](ll rhs, ll t) {
    // how many are <= rhs
    if(eval(n, t) > rhs) return 0;
    int a = 0;
    int b = n;
    while(a < b) {
      int mid = (a+b)/2;
      if(eval(mid, t) > rhs) a = mid+1;
      else b = mid;
    }
    return n+1-a;
  };
  for(int i = 1; i <= n; i++) {
    ll lhs = slows[i-1];
    ll rhs = 1e18;
    while(lhs < rhs) {
      ll mid = (lhs+rhs)/2;
      if(eval(i-1, mid) - (-i) > slows[i]) rhs = mid;
      else lhs = mid+1;
    }
    actual[i] = lhs;
  }
  while(q--) {
    ll t, lloc, rloc;
    cin >> t >> lloc >> rloc;
    cout << getamt(rloc, t) - getamt(lloc-1, t) << "\n";
  }
}

// what would chika do
// are there edge cases (N=1?)
// are array sizes proper (scaled by proper constant, for example 2* for koosaga tree)
// integer overflow?
// DS reset properly between test cases
// are you doing geometry in floating points
// are you not using modint when you should

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL); cout.tie(NULL);
  solve();
}

• Subtask 1: 7 / 7
• Subtask 2: 12 / 12
• Subtask 3: 81 / 81