oj.uz

답안 #520391

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
520391 2022-01-29T18:31:49 Z Alex_tz307 Sum Zero (RMI20_sumzero) C++17
100 / 100
 275 ms 20420 KB 
#include <bits/stdc++.h>

using namespace std;

const int kN = 4e5;
int nxt[1 + kN], jump[1 + kN + 1 + 1];
int64_t sum[1 + kN];

struct query {
  int l, r, ans;
} q[1 + kN];

void testCase() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    cin >> sum[i];
    sum[i] += sum[i - 1];
  }
  multiset<int64_t> sums{0};
  int r = 0;
  for (int l = 1; l <= n; ++l) {
    while (r <= n) {
      if (sums.count(sum[r]) >= 2) {
        break;
      }
      r += 1;
      sums.emplace(sum[r]);
    }
    nxt[l] = r + 1;
    sums.erase(sums.find(sum[l - 1]));
  }
  int Q;
  cin >> Q;
  for (int i = 1; i <= Q; ++i) {
    cin >> q[i].l >> q[i].r;
    q[i].ans = 0;
  }
  jump[n + 1] = jump[n + 2] = n + 2;
  for (int j = log2(n); j >= 0; --j) {
    for (int i = 1; i <= n; ++i) {
      jump[i] = nxt[i];
    }
    for (int rep = 1; rep <= j; ++rep) {
      for (int i = 1; i <= n; ++i) {
        jump[i] = jump[jump[i]];
      }
    }
    for (int i = 1; i <= Q; ++i) {
      if (jump[q[i].l] <= q[i].r + 1) {
        q[i].ans += (1 << j);
        q[i].l = jump[q[i].l];
      }
    }
  }
  for (int i = 1; i <= Q; ++i) {
    cout << q[i].ans << '\n';
  }
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int tests = 1;
  for (int tc = 1; tc <= tests; ++tc) {
    testCase();
  }
  return 0;
}

Subtask #1
22.0 / 22.0

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

Subtask #2
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 460 KB Output is correct
2 Correct 4 ms 460 KB Output is correct
3 Correct 4 ms 460 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 3 ms 460 KB Output is correct
6 Correct 3 ms 460 KB Output is correct
7 Correct 55 ms 3396 KB Output is correct
8 Correct 53 ms 3372 KB Output is correct
9 Correct 59 ms 3460 KB Output is correct
10 Correct 54 ms 3444 KB Output is correct
11 Correct 57 ms 3488 KB Output is correct
12 Correct 72 ms 3468 KB Output is correct

Subtask #3
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 460 KB Output is correct
2 Correct 4 ms 460 KB Output is correct
3 Correct 4 ms 460 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 3 ms 460 KB Output is correct
6 Correct 3 ms 460 KB Output is correct
7 Correct 55 ms 3396 KB Output is correct
8 Correct 53 ms 3372 KB Output is correct
9 Correct 59 ms 3460 KB Output is correct
10 Correct 54 ms 3444 KB Output is correct
11 Correct 57 ms 3488 KB Output is correct
12 Correct 72 ms 3468 KB Output is correct
13 Correct 240 ms 13164 KB Output is correct
14 Correct 250 ms 12920 KB Output is correct
15 Correct 275 ms 13524 KB Output is correct
16 Correct 256 ms 19524 KB Output is correct
17 Correct 237 ms 20420 KB Output is correct
18 Correct 270 ms 20400 KB Output is correct