QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#83933#4812. Counting SequenceScintillaAC ✓3318ms15464kbC++142.2kb2023-03-04 14:08:202023-03-04 14:08:24

Judging History

你现在查看的是最新测评结果

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-03-04 14:08:24]
  • 评测
  • 测评结果:AC
  • 用时:3318ms
  • 内存:15464kb
  • [2023-03-04 14:08:20]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;

#define rep(i, s, e) for (int i = s; i <= e; ++i)
#define drep(i, s, e) for (int i = s; i >= e; --i)
#define file(a) freopen(#a".in", "r", stdin), freopen(#a".out", "w", stdout)
#define pv(a) cout << #a << " = " << a << endl
#define pa(a, l, r) cout << #a " : "; rep(_, l, r) cout << a[_] << ' '; cout << endl

const int P = 998244353;

const int N = 3e5 + 10;
const int B = 800;

int read() {
  int x = 0, f = 1; char c = getchar();
  for (; c < '0' || c > '9'; c = getchar()) if (c == '-') f = -1;
  for (; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + c - 48;
  return x * f;
}

int inc(int a, int b) { return (a += b) >= P ? a - P : a; }
int dec(int a, int b) { return (a -= b) < 0 ? a + P : a; }
int mul(int a, int b) { return 1ll * a * b % P; }
void add(int &a, int b) { (a += b) >= P ? a -= P : 1; }
void sub(int &a, int b) { (a -= b) < 0 ? a += P : 1; }
int qpow(int a, int b) { int res = 1; for (; b; b >>= 1, a = mul(a, a)) if (b & 1) res = mul(res, a); return res; }

int n, c, ans;

namespace small {

  const int M = 1.3e3 + 10;
  const int L = 1.3e3;

  int f[M][M];

  void Main() {
    for (int i = 1, o = 1; i <= n; ++ i, o = (o + 1) % M) {
      fill(f[o] + 1, f[o] + L + 1, 0);
      if (i <= B) f[o][i] = 1;
      rep(j, 1, L) {
        add(f[o][j], f[(o - j + M) % M][j - 1]);
        add(f[o][j], mul(f[(o - j + M) % M][j + 1], c));
      }
    }
    rep(i, 1, L) add(ans, f[n % M][i]);
  }

}

namespace large {

  int c2[N], f[2][B * B];

  void Main() {
    rep(i, 1, B) c2[i] = c2[i - 1] + i - 1;
    f[1][0 + c2[B]] = 1;
    for (int i = 1, o = 1; i < B; ++ i, o ^= 1) {
      fill(f[o ^ 1], f[o ^ 1] + 2 * c2[B], 0);
      for (int x = B + 1; i * x - c2[i] <= n; ++ x) {
        int s = n - i * x;
        if (-c2[i] <= s && s <= c2[i]) add(ans, f[o][s + c2[B]]);
      }
      rep(s, -c2[i], c2[i]) if (f[o][s + c2[B]]) {
        add(f[o ^ 1][s + i + c2[B]], f[o][s + c2[B]]);
        add(f[o ^ 1][s - i + c2[B]], mul(f[o][s + c2[B]], c));
      }
    }
  }

}

int main() {
  n = read(), c = read();
  small::Main();
  large::Main();
  printf("%d\n", ans);
  return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 317ms
memory: 8500kb

input:

5 3

output:

8

result:

ok 1 number(s): "8"

Test #2:

score: 0
Accepted
time: 154ms
memory: 8540kb

input:

1 0

output:

1

result:

ok 1 number(s): "1"

Test #3:

score: 0
Accepted
time: 349ms
memory: 15244kb

input:

2022 39

output:

273239559

result:

ok 1 number(s): "273239559"

Test #4:

score: 0
Accepted
time: 319ms
memory: 8708kb

input:

1 998244352

output:

1

result:

ok 1 number(s): "1"

Test #5:

score: 0
Accepted
time: 317ms
memory: 8528kb

input:

1 12345678

output:

1

result:

ok 1 number(s): "1"

Test #6:

score: 0
Accepted
time: 318ms
memory: 8644kb

input:

20 998998

output:

643731701

result:

ok 1 number(s): "643731701"

Test #7:

score: 0
Accepted
time: 317ms
memory: 8656kb

input:

23 123

output:

947753998

result:

ok 1 number(s): "947753998"

Test #8:

score: 0
Accepted
time: 319ms
memory: 8792kb

input:

50 5555

output:

745339864

result:

ok 1 number(s): "745339864"

Test #9:

score: 0
Accepted
time: 314ms
memory: 8780kb

input:

60 6666

output:

690992218

result:

ok 1 number(s): "690992218"

Test #10:

score: 0
Accepted
time: 319ms
memory: 9048kb

input:

100 50

output:

169678588

result:

ok 1 number(s): "169678588"

Test #11:

score: 0
Accepted
time: 321ms
memory: 11104kb

input:

500 88888

output:

216149701

result:

ok 1 number(s): "216149701"

Test #12:

score: 0
Accepted
time: 324ms
memory: 13660kb

input:

1000 213456

output:

270989457

result:

ok 1 number(s): "270989457"

Test #13:

score: 0
Accepted
time: 331ms
memory: 15248kb

input:

2000 119988

output:

756425375

result:

ok 1 number(s): "756425375"

Test #14:

score: 0
Accepted
time: 357ms
memory: 15248kb

input:

3000 998244352

output:

71841227

result:

ok 1 number(s): "71841227"

Test #15:

score: 0
Accepted
time: 351ms
memory: 15240kb

input:

3000 555555555

output:

79880116

result:

ok 1 number(s): "79880116"

Test #16:

score: 0
Accepted
time: 381ms
memory: 15140kb

input:

4321 1234

output:

949603993

result:

ok 1 number(s): "949603993"

Test #17:

score: 0
Accepted
time: 201ms
memory: 15132kb

input:

5000 0

output:

5

result:

ok 1 number(s): "5"

Test #18:

score: 0
Accepted
time: 367ms
memory: 15168kb

input:

5000 88888777

output:

833064960

result:

ok 1 number(s): "833064960"

Test #19:

score: 0
Accepted
time: 383ms
memory: 15216kb

input:

5000 35557777

output:

696388498

result:

ok 1 number(s): "696388498"

Test #20:

score: 0
Accepted
time: 417ms
memory: 15232kb

input:

10000 123456

output:

434296902

result:

ok 1 number(s): "434296902"

Test #21:

score: 0
Accepted
time: 526ms
memory: 15264kb

input:

20000 555555

output:

34806915

result:

ok 1 number(s): "34806915"

Test #22:

score: 0
Accepted
time: 619ms
memory: 15264kb

input:

30000 777888999

output:

58443551

result:

ok 1 number(s): "58443551"

Test #23:

score: 0
Accepted
time: 834ms
memory: 15400kb

input:

50000 2

output:

90102905

result:

ok 1 number(s): "90102905"

Test #24:

score: 0
Accepted
time: 1016ms
memory: 15400kb

input:

70000 77998866

output:

202638568

result:

ok 1 number(s): "202638568"

Test #25:

score: 0
Accepted
time: 1357ms
memory: 15228kb

input:

100000 998244352

output:

360520717

result:

ok 1 number(s): "360520717"

Test #26:

score: 0
Accepted
time: 1330ms
memory: 15240kb

input:

100000 555555555

output:

613886009

result:

ok 1 number(s): "613886009"

Test #27:

score: 0
Accepted
time: 1897ms
memory: 15192kb

input:

150000 233333

output:

381065878

result:

ok 1 number(s): "381065878"

Test #28:

score: 0
Accepted
time: 1723ms
memory: 15464kb

input:

150000 20050117

output:

269891864

result:

ok 1 number(s): "269891864"

Test #29:

score: 0
Accepted
time: 2160ms
memory: 15244kb

input:

200000 114514

output:

262861613

result:

ok 1 number(s): "262861613"

Test #30:

score: 0
Accepted
time: 2216ms
memory: 15232kb

input:

200000 1919810

output:

77872388

result:

ok 1 number(s): "77872388"

Test #31:

score: 0
Accepted
time: 2908ms
memory: 15172kb

input:

300000 0

output:

12

result:

ok 1 number(s): "12"

Test #32:

score: 0
Accepted
time: 3056ms
memory: 15244kb

input:

300000 1

output:

298803948

result:

ok 1 number(s): "298803948"

Test #33:

score: 0
Accepted
time: 3318ms
memory: 15268kb

input:

300000 2

output:

106751203

result:

ok 1 number(s): "106751203"

Test #34:

score: 0
Accepted
time: 3050ms
memory: 15200kb

input:

300000 1234

output:

427045479

result:

ok 1 number(s): "427045479"

Test #35:

score: 0
Accepted
time: 3108ms
memory: 15220kb

input:

300000 2345

output:

441593553

result:

ok 1 number(s): "441593553"

Test #36:

score: 0
Accepted
time: 3064ms
memory: 15252kb

input:

300000 20041115

output:

580367993

result:

ok 1 number(s): "580367993"

Test #37:

score: 0
Accepted
time: 3108ms
memory: 15404kb

input:

300000 20050117

output:

579859619

result:

ok 1 number(s): "579859619"

Test #38:

score: 0
Accepted
time: 3198ms
memory: 15260kb

input:

300000 22223333

output:

596066085

result:

ok 1 number(s): "596066085"

Test #39:

score: 0
Accepted
time: 3054ms
memory: 15248kb

input:

300000 175846372

output:

660364393

result:

ok 1 number(s): "660364393"

Test #40:

score: 0
Accepted
time: 3205ms
memory: 15168kb

input:

299999 9999999

output:

954865020

result:

ok 1 number(s): "954865020"

Test #41:

score: 0
Accepted
time: 3063ms
memory: 15260kb

input:

299998 55556666

output:

904862432

result:

ok 1 number(s): "904862432"

Test #42:

score: 0
Accepted
time: 2054ms
memory: 15136kb

input:

190733 31756136

output:

880544587

result:

ok 1 number(s): "880544587"

Test #43:

score: 0
Accepted
time: 2117ms
memory: 15220kb

input:

198497 463488298

output:

185220207

result:

ok 1 number(s): "185220207"

Test #44:

score: 0
Accepted
time: 2917ms
memory: 15260kb

input:

299997 0

output:

16

result:

ok 1 number(s): "16"

Test #45:

score: 0
Accepted
time: 1858ms
memory: 15236kb

input:

168168 296157813

output:

798716760

result:

ok 1 number(s): "798716760"

Test #46:

score: 0
Accepted
time: 1331ms
memory: 15408kb

input:

114514 1919810

output:

783513290

result:

ok 1 number(s): "783513290"