Submission #47448

# Submission time Handle Problem Language Result Execution time Memory
47448 2018-05-03T07:14:03 Z Just_Solve_The_Problem Worst Reporter 3 (JOI18_worst_reporter3) C++11
19 / 100
503 ms 9512 KB
#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define eb emplace_back
#define ll long long
#define pii pair < int, int >
#define fr first
#define sc second
#define mk make_pair
#define sz(s) (int)s.size()
#define all(s) s.begin(), s.end()
#define ok puts("ok");
#define whatis(x) cerr << #x << " = " << x << endl;
#define pause system("pause");
#define random rand() ^ (rand() << 5)

const int N = (int)5e5 + 7;
const int inf = (int)1e9 + 7;

int n, q;
int d[N];
pii ar[N];
ll pos[N];
bool fl = 1;

main() {
  scanf("%d %d", &n, &q);
  ar[0] = {1, 1};
  for (int i = 1; i <= n; i++) {
    scanf("%d", &d[i]);
    ar[i].sc = (d[i] + ar[i - 1].sc - 1) / ar[i - 1].sc * ar[i - 1].fr;
    ar[i].fr = (ar[i].sc / ar[i - 1].fr * ar[i - 1].sc + (-(i - 1))) - 1 - (-i);
  }
  for (int i = 1; i <= n; i++) {
    fl &= (d[i] == 1);
  }
  if (fl) {
    while (q--) {
      int t, l, r;
      scanf("%d %d %d", &t, &l, &r);
      int tl = -n + t;
      int tr = t;
      int ans = 0;
      if (tl <= l && r <= tr) {
        ans = r - l + 1;
      } else if (l <= tl && tr <= r) {
        ans = tr - tl + 1;
      } else if (tr >= l && l > tl) {
        ans = tr - l + 1;
      } else if (tl <= r && tr > r) {
        ans = r - tl + 1;
      }
      printf("%d\n", ans);
    }
    return 0;
  }
  while (q--) {
    int t, l, r;
    scanf("%d %d %d", &t, &l, &r);
    for (int i = 0; i <= n; i++) {
      pos[i] = t / ar[i].sc * ar[i].fr + (-i);
    }
    int ans = 0;
    for (int i = 0; i <= n; i++) {
      if (pos[i] >= l && pos[i] <= r) {
        ans++;
      }
    }
    printf("%d\n", ans);
  }
}

Compilation message

worst_reporter3.cpp:28:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^
worst_reporter3.cpp: In function 'int main()':
worst_reporter3.cpp:29: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:32: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:42:12: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
       scanf("%d %d %d", &t, &l, &r);
       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
worst_reporter3.cpp:61: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);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 414 ms 9208 KB Output is correct
2 Correct 392 ms 9260 KB Output is correct
3 Correct 456 ms 9260 KB Output is correct
4 Correct 503 ms 9420 KB Output is correct
5 Correct 417 ms 9512 KB Output is correct
6 Correct 390 ms 9512 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 8 ms 9512 KB Output is correct
2 Correct 7 ms 9512 KB Output is correct
3 Correct 10 ms 9512 KB Output is correct
4 Correct 8 ms 9512 KB Output is correct
5 Correct 8 ms 9512 KB Output is correct
6 Correct 8 ms 9512 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 414 ms 9208 KB Output is correct
2 Correct 392 ms 9260 KB Output is correct
3 Correct 456 ms 9260 KB Output is correct
4 Correct 503 ms 9420 KB Output is correct
5 Correct 417 ms 9512 KB Output is correct
6 Correct 390 ms 9512 KB Output is correct
7 Correct 8 ms 9512 KB Output is correct
8 Correct 7 ms 9512 KB Output is correct
9 Correct 10 ms 9512 KB Output is correct
10 Correct 8 ms 9512 KB Output is correct
11 Correct 8 ms 9512 KB Output is correct
12 Correct 8 ms 9512 KB Output is correct
13 Runtime error 3 ms 9512 KB Execution killed with signal 8 (could be triggered by violating memory limits)
14 Halted 0 ms 0 KB -