oj.uz

답안 #398730

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
398730 2021-05-04T18:52:30 Z MilosMilutinovic Brperm (RMI20_brperm) C++14
100 / 100
 1712 ms 38972 KB 
/**
 *    author:  milos
 *    created: 04.05.2021 20:27:22       
**/
#include <bits/stdc++.h>
#include "brperm.h"
#pragma GCC optimize("O3")
 
using namespace std;

const int N = 500050;
 
string s = "";
vector<pair<int, int>> a(N);
vector<vector<int>> cnt(N, vector<int>(2));
void Calc(int n) {
  for (int i = 0; i < n; i++) {
    int j = i, cnt = 0, res = 0;
    while (j) {
      res = res * 2 + j % 2;
      cnt++;
      j /= 2;
    }
    a[i] = {res, cnt};
  } 
}

void init(int n, const char seq[]) {
  for (int i = 0; i < n; i++) {
    s += seq[i];
    if (i > 0) {
      cnt[i][0] = cnt[i - 1][0];
      cnt[i][1] = cnt[i - 1][1];
    }
    if (s[i] == 'a') {
      cnt[i][0] += 1;
    }
    if (s[i] == 'b') {
      cnt[i][1] += 1;
    }
  }
  Calc(n); 
}

int Rev(int x, int k) {
  return a[x].first * (1 << (k - a[x].second));
}

int query(int i, int k) {
  if (i + (1 << k) > (int) s.size()) {
    return 0;
  }
  int L = i, R = i + (1 << k) - 1;
  if (cnt[R][0] - (L == 0 ? 0 : cnt[L - 1][0]) == R - L + 1) {
    return 1;
  }
  if (cnt[R][1] - (L == 0 ? 0 : cnt[L - 1][1]) == R - L + 1) {
    return 1;
  }
  for (int j = i; j < i + (1 << k); j++) {
    if (s[j] != s[i + Rev(j - i, k)]) {
      return 0;  
    }
  }
  return 1;
}

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 31556 KB Output is correct
2 Correct 38 ms 31664 KB Output is correct

Subtask #2
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 31556 KB Output is correct
2 Correct 38 ms 31664 KB Output is correct
3 Correct 78 ms 32964 KB Output is correct
4 Correct 81 ms 33000 KB Output is correct
5 Correct 79 ms 32964 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1712 ms 38972 KB Output is correct
2 Correct 354 ms 38740 KB Output is correct

Subtask #4
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 31556 KB Output is correct
2 Correct 38 ms 31664 KB Output is correct
3 Correct 78 ms 32964 KB Output is correct
4 Correct 81 ms 33000 KB Output is correct
5 Correct 79 ms 32964 KB Output is correct
6 Correct 1712 ms 38972 KB Output is correct
7 Correct 354 ms 38740 KB Output is correct
8 Correct 287 ms 38724 KB Output is correct
9 Correct 284 ms 38632 KB Output is correct
10 Correct 293 ms 38620 KB Output is correct