oj.uz

Submission #330355

# Submission time Handle Problem Language Result Execution time Memory
330355 2020-11-24T22:10:48 Z VROOM_VARUN Worst Reporter 3 (JOI18_worst_reporter3) C++14
19 / 100
 664 ms 23040 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 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;
}

int 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

# Verdict Execution time Memory Grader output
1 Correct 638 ms 22892 KB Output is correct
2 Correct 664 ms 22764 KB Output is correct
3 Correct 642 ms 23040 KB Output is correct
4 Correct 655 ms 22848 KB Output is correct
5 Correct 659 ms 22892 KB Output is correct
6 Correct 662 ms 22892 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
0 / 81.0

# Verdict Execution time Memory Grader output
1 Correct 638 ms 22892 KB Output is correct
2 Correct 664 ms 22764 KB Output is correct
3 Correct 642 ms 23040 KB Output is correct
4 Correct 655 ms 22848 KB Output is correct
5 Correct 659 ms 22892 KB Output is correct
6 Correct 662 ms 22892 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 2 ms 364 KB Output is correct
13 Runtime error 66 ms 13420 KB Execution killed with signal 8 (could be triggered by violating memory limits)
14 Halted 0 ms 0 KB -