QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#352888 | #7996. 报数 IV | lopzith | TL | 41ms | 39348kb | C++20 | 2.1kb | 2024-03-13 17:41:51 | 2024-03-13 17:41:53 |
Judging History
answer
#pragma GCC optimize("Ofast", "inline", "-ffast-math")
#pragma GCC target("avx,sse2,sse3,sse4,mmx")
#include <bits/stdc++.h>
#define Arr std::vector
#define Ptn std::pair
#define fi first
#define se second
#define eb emplace_back
#define pb push_back
const int N = 1e3 + 5;
const int M = 9e3 + 5;
const int P = 1e9 + 7;
int T, n, k, m, op[M], t[2][M], f[N][M];
char s[N];
inline int read()
{
int w = 0;
char ch = getchar();
while (ch < '0' || ch > '9')
{
ch = getchar();
}
while (ch >= '0' && ch <= '9')
{
w = w * 10 + (ch - 48);
ch = getchar();
}
return w;
}
inline void Add(int &x, int y) { x += y; if (x >= P) x -= P; }
inline int dfs(int p, int lim, int sum)
{
if (!lim && f[p][sum] != -1) return f[p][sum];
if (p == n + 1) return (sum == 0);
int up = std::min(sum, (lim ? s[p] - '0' : 9)), res = 0;
for (register int i = 0; i <= up; i++) Add(res, dfs(p + 1, lim && (i == (s[p] - '0')), sum - i));
if (!lim) return f[p][sum] = res;
return res;
}
signed main()
{
T = read();
for (int i = 0; i < M; i++)
{
int x = i, cnt = 0;
while (x)
{
cnt += (x % 10);
x /= 10;
}
op[i] = cnt;
}
while (T--)
{
// memset(t, 0, sizeof(t));
memset(f, -1, sizeof(f));
scanf("%s", s + 1); k = read(), m = read(); n = strlen(s + 1);
if (m > 9000) { printf("0\n"); continue; }
int kel = 0;
for (int i = 0; i <= 9000; i++) t[kel][i] = dfs(1, 1, i); k--;
// for (int i = 0; i <= 20; i++) printf("%lld ", t[kel][i]); printf("\n");
k = std::min(4, k);
if (k == 0) { printf("%d\n", t[kel][m]); continue; }
kel ^= 1; memset(t[kel], 0, sizeof(t[kel])); for (int j = 0; j <= 9000; j++) Add(t[kel][op[j]], t[kel ^ 1][j]); k--;
for (int i = 1; i <= k; i++)
{
kel ^= 1; memset(t[kel], 0, sizeof(t[kel]));
for (int j = 0; j <= 36; j++) Add(t[kel][op[j]], t[kel ^ 1][j]);
}
printf("%d\n", t[kel][m]);
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 3ms
memory: 39252kb
input:
2 114 1 5 514 2 10
output:
8 10
result:
ok 2 lines
Test #2:
score: 0
Accepted
time: 41ms
memory: 39348kb
input:
5 114 1 5 514 2 10 114514 3 7 1919810 2 13 1145141919810114514191981011451419198101145141919810114514191981011451419198101145141919810114514191981011451419198101145141919810 1 79
output:
8 10 12724 504 481046284
result:
ok 5 lines
Test #3:
score: -100
Time Limit Exceeded
input:
5 3134666912140933323880320519044791121794814671711104987304374190280064994554822259889216567113228716903875026053927191961850586115167336109747673868148288830282192461669674173201533887392623483710043038941036243583011049049915834937139438028987629569618561762595613799223807979488245056374812076511...
output:
0 613343513 0 500149787 932367667