oj.uz

답안 #330356

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
330356 2020-11-24T22:11:38 Z VROOM_VARUN Worst Reporter 3 (JOI18_worst_reporter3) C++14
100 / 100
 671 ms 29360 KB 
/*
ID: varunra2
LANG: C++
TASK: reporter
*/

#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
#include "lib/debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define debug_arr(...) \
  cerr << "[" << #__VA_ARGS__ << "]:", debug_arr(__VA_ARGS__)
#pragma GCC diagnostic ignored "-Wsign-compare"
//#pragma GCC diagnostic ignored "-Wunused-parameter"
//#pragma GCC diagnostic ignored "-Wunused-variable"
#else
#define debug(...) 42
#endif

#define int long long

#define EPS 1e-9
#define IN(A, B, C) assert(B <= A && A <= C)
#define INF (int)1e9
#define MEM(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define MP make_pair
#define PB push_back
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define x first
#define y second

const double PI = acos(-1.0);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef map<int, int> MPII;
typedef multiset<int> MSETI;
typedef set<int> SETI;
typedef set<string> SETS;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<string> VS;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto& a : x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef vector<int> vi;
#pragma GCC diagnostic ignored "-Wsign-compare"
// util functions

VI f, d;
VVI qrys;
int n, q;

void calc_f() {
  f[0] = d[0];
  for (int i = 1; i <= n; i++) {
    f[i] = f[i - 1] * ((d[i] + f[i - 1] - 1) / f[i - 1]);
  }
}

int where(int ind, int time) {
  // where was person ind at time time?
  return (time / f[ind]) * f[ind] - ind;
}

bool works(int ind, int time, int pos) {
  if (ind > n) return true;
  return where(ind, time) <= pos;
}

int getless(int time, int pos) {
  // elements <= pos at time time
  int x = -1;
  for (int b = n + 1; b >= 1; b /= 2) {
    while (!works(x + b, time, pos)) x += b;
  }
  return n - x;
}

int32_t main() {
// #ifndef ONLINE_JUDGE
  // freopen("reporter.in", "r", stdin);
  // freopen("reporter.out", "w", stdout);
// #endif
  cin.sync_with_stdio(0);
  cin.tie(0);

  cin >> n >> q;

  f.resize(n + 1);
  d.resize(n + 1);

  for (int i = 0; i < n; i++) {
    cin >> d[i + 1];
  }

  d[0] = 1;

  calc_f();

  while (q--) {
    int t, l, r;
    cin >> t >> l >> r;
    int val1 = getless(t, r);
    int val2 = getless(t, l - 1);
    cout << val1 - val2 << '\n';
  }

  return 0;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 649 ms 11244 KB Output is correct
2 Correct 651 ms 11500 KB Output is correct
3 Correct 650 ms 11372 KB Output is correct
4 Correct 646 ms 11244 KB Output is correct
5 Correct 650 ms 11244 KB Output is correct
6 Correct 641 ms 11244 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct

Subtask #3
81.0 / 81.0

# 결과 실행 시간 메모리 Grader output
1 Correct 649 ms 11244 KB Output is correct
2 Correct 651 ms 11500 KB Output is correct
3 Correct 650 ms 11372 KB Output is correct
4 Correct 646 ms 11244 KB Output is correct
5 Correct 650 ms 11244 KB Output is correct
6 Correct 641 ms 11244 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 402 ms 20332 KB Output is correct
14 Correct 385 ms 25836 KB Output is correct
15 Correct 370 ms 24556 KB Output is correct
16 Correct 383 ms 25040 KB Output is correct
17 Correct 486 ms 29292 KB Output is correct
18 Correct 491 ms 29272 KB Output is correct
19 Correct 477 ms 29292 KB Output is correct
20 Correct 486 ms 29164 KB Output is correct
21 Correct 483 ms 29292 KB Output is correct
22 Correct 485 ms 29292 KB Output is correct
23 Correct 485 ms 29292 KB Output is correct
24 Correct 492 ms 29360 KB Output is correct
25 Correct 671 ms 26732 KB Output is correct
26 Correct 664 ms 26604 KB Output is correct
27 Correct 553 ms 28780 KB Output is correct
28 Correct 541 ms 29164 KB Output is correct
29 Correct 563 ms 28772 KB Output is correct
30 Correct 588 ms 28784 KB Output is correct
31 Correct 551 ms 29164 KB Output is correct
32 Correct 525 ms 25452 KB Output is correct
33 Correct 1 ms 364 KB Output is correct