#711939 (C++14) No.1725 [Cherry 3rd Tune D] 無言の言葉

• 問題: No.1725 [Cherry 3rd Tune D] 無言の言葉
• ユーザー: tnakao0123
• 提出日時: 2021-10-30 17:21:46
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 46 ms / 4,000 ms
• コード長: 1,813 bytes
• コンパイル時間: 450 ms
• コンパイル使用メモリ: 44,800 KB
• 実行使用メモリ: 23,704 KB
• 最終ジャッジ日時: 2024-10-07 13:47:24
• 合計ジャッジ時間: 3,340 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

ファイルパターン	結果
sample	AC * 2
other	AC * 42

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
/* -*- coding: utf-8 -*-
 *
 * 1725.cc:  No.1725 [Cherry 3rd Tune D] 無言の言葉 - yukicoder
 */
#include<cstdio>
#include<cstring>
#include<algorithm>
 
using namespace std;
/* constant */
const int MAX_N = 100000;
const int MAX_K = 30;
const int MAX_R = 1000000000;
/* typedef */
struct Vec {
  int vs[26];
  Vec(): vs() {}
  int &operator[](int i) { return vs[i]; }
  Vec operator+(const Vec &e) const {
    Vec r;
    for (int i = 0; i < 26; i++) r.vs[i] = vs[i] + e.vs[i];
    return r;
  }
  Vec operator-(const Vec &e) const {
    Vec r;
    for (int i = 0; i < 26; i++) r.vs[i] = vs[i] - e.vs[i];
    return r;
  }
};
/* global variables */
char sx[MAX_N + 4], sy[MAX_N + 4];
Vec xvs[MAX_N + 1], yvs[MAX_N + 1], fvs[MAX_K];
int xn, yn, fns[MAX_K];
/* subroutines */
void s2vecs(int n, char s[], Vec vs[]) {
  for (int i = 0; i < n; i++) {
    vs[i + 1] = vs[i];
    vs[i + 1][s[i] - 'a']++;
  }
}
int rec(int k, int r, int ci) {
  if (k <= 0) return xvs[min(xn, r)][ci];
  k--;
  if (r <= fns[k])
    return rec(k, r, ci);
  if (r <= fns[k] + yn)
    return fvs[k][ci] + yvs[r - fns[k]][ci];
  r -= fns[k] + yn;
  return fvs[k + 1][ci] - rec(k, max(0, fns[k] - r), ci);
}
/* main */
int main() {
  int qn;
  scanf("%s%s%d", sx, sy, &qn);
  xn = strlen(sx), yn = strlen(sy);
  s2vecs(xn, sx, xvs);
  s2vecs(yn, sy, yvs);
  fns[0] = xn;
  fvs[0] = xvs[xn];
  int k = 0;
  while (fns[k] < MAX_R) {
    fns[k + 1] = fns[k] * 2 + yn;
    fvs[k + 1] = fvs[k] + yvs[yn] + fvs[k];
    k++;
  }
  //printf("k=%d ", k);
  //for (int i = 0; i <= k; i++) printf("%d ", fns[i]); putchar('\n');
  while (qn--) {
    int l, r;
    char sc[4];
    scanf("%d%d%s", &l, &r, sc);
    l--;
    int ci = sc[0] - 'a';
    int d = rec(k, r, ci) - rec(k, l, ci);
    printf("%d\n", d);
  }
  return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX