QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#751687#9536. Athlete Welcome Ceremonyzhuge0WA 1129ms438564kbC++172.2kb2024-11-15 20:10:042024-11-15 20:10:04

Judging History

This is the latest submission verdict.

  • [2024-11-15 20:10:04]
  • Judged
  • Verdict: WA
  • Time: 1129ms
  • Memory: 438564kb
Show
  • [2024-11-15 20:10:04]
  • Submitted

answer

#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll mod = 1e9 + 7;
ll n,m,k,q;
ll f[305][305][305][3]{};
ll g[305][305][305]{};
ll cnt[305]{};
string s;
void solve()
{
	cin >> n >> m;
	cin >> s;
	s = ' ' + s;
	for (int i = 1; i <= n; i++)
	{
		cnt[i] = cnt[i - 1] + (s[i] == '?');
	}
	if (s[1] == '?')
	{
		f[1][1][0][0] = 1;
		f[1][0][1][1] = 1;
		f[1][0][0][2] = 1;
	}
	else
	{
		f[1][0][0][s[1] - 'a'] = 1;
	}
	for (int i = 2; i <= n; i++)
	{
		for (int ca = 0; ca <= cnt[i]; ca++)
		{
			for (int cb = 0; cb+ca <= cnt[i]; cb++)
			{
				if (s[i] != '?')
				{
					ll num = ((f[i - 1][ca][cb][0] + f[i - 1][ca][cb][1])%mod + f[i - 1][ca][cb][2]) % mod;
					f[i][ca][cb][s[i] - 'a'] = (num - f[i - 1][ca][cb][s[i] - 'a'] + mod) % mod;
					continue;
				}
				if (ca)
				{
					ll num = (f[i - 1][ca - 1][cb][1] + f[i - 1][ca-1][cb][2])%mod;
					f[i][ca][cb][0] = num%mod;
				}
				if (cb)
				{
					ll num = (f[i - 1][ca ][cb-1][0] + f[i - 1][ca][cb-1][2]) % mod;
					f[i][ca][cb][1] = num%mod;
				}
				if (cnt[i] - ca - cb)
				{
					ll num = (f[i - 1][ca][cb][0] + f[i-1][ca][cb][1]) % mod;
					f[i][ca][cb][2] = num%mod;
				}
			}
		}
	}
	for (int i = 0; i <= cnt[n]; i++)
	{
		for (int j = 0; j + i <= cnt[n]; j++)
		{
			g[i][j][cnt[n] - i - j] = ((f[n][i][j][0] + f[n][i][j][1])%mod + f[n][i][j][2]) % mod;
		}
	}
	for (int i = 0; i <= 300; i++)
	{
		for (int j = 0; j <= 300; j++)
		{
			for (int k = 0; k <= 300; k++)
			{
				if (i>0)g[i][j][k] += g[i - 1][j][k] % mod, g[i][j][k] %= mod;
				if(j>0)g[i][j][k] += g[i][j-1][k] % mod, g[i][j][k] %= mod;
				if(k>0)g[i][j][k] += g[i][j][k-1] % mod, g[i][j][k] %= mod;
				if(i&&j)g[i][j][k] -= g[i - 1][j-1][k] % mod, g[i][j][k]+=mod,g[i][j][k] %= mod;
				if(j&&k)g[i][j][k] -= g[i][j-1][k-1] % mod, g[i][j][k] %= mod;
				if(i&&k)g[i][j][k] -= g[i - 1][j][k-1] % mod, g[i][j][k] %= mod;
				if(i&&j&&k)g[i][j][k] += g[i - 1][j-1][k-1] % mod, g[i][j][k] %= mod;
			}
		}
	}
	
	while (m--)
	{
		int x, y, z;
		cin >> x >> y >> z;
		cout << g[x][y][z] << '\n';
	}
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int T = 1;
	//cin >> T;
	while(T--)
	{
		solve();
	}
}
源文件, 语言: C++17

详细

Test #1:

score: 100
Accepted
time: 1099ms
memory: 232924kb

input:

6 3
a?b??c
2 2 2
1 1 1
1 0 2

output:

3
1
1

result:

ok 3 lines

Test #2:

score: 0
Accepted
time: 1129ms
memory: 232956kb

input:

6 3
??????
2 2 2
2 3 3
3 3 3

output:

30
72
96

result:

ok 3 lines

Test #3:

score: 0
Accepted
time: 1128ms
memory: 222676kb

input:

1 1
?
0 1 1

output:

2

result:

ok single line: '2'

Test #4:

score: 0
Accepted
time: 1093ms
memory: 241196kb

input:

10 10
acab?cbaca
0 2 0
1 1 2
4 2 3
1 1 1
3 5 1
0 5 2
2 2 0
1 2 5
4 3 0
1 1 3

output:

0
1
1
1
1
0
1
1
1
1

result:

ok 10 lines

Test #5:

score: 0
Accepted
time: 1117ms
memory: 241132kb

input:

10 10
?c?c?cbac?
10 5 1
5 8 7
9 2 6
5 7 1
5 2 6
5 6 5
5 10 3
9 1 10
2 5 9
1 2 9

output:

16
16
11
16
11
16
16
5
11
0

result:

ok 10 lines

Test #6:

score: 0
Accepted
time: 1091ms
memory: 274364kb

input:

50 100
?abacbacab?cbcbcb?acabcbabcbcacbababc?caba?acacbca
8 3 8
2 4 8
8 7 3
0 9 2
10 8 7
7 6 5
4 10 2
6 9 3
3 6 6
9 10 8
2 5 8
8 1 0
3 5 0
1 0 6
5 0 8
6 5 5
1 7 9
7 7 10
4 7 5
6 6 4
10 1 2
4 1 7
10 0 8
7 6 3
1 9 1
4 7 2
8 4 0
8 6 1
5 10 4
5 8 2
5 8 4
4 5 9
5 2 1
1 10 9
4 10 1
8 4 3
8 9 9
8 0 1
0 8 0...

output:

8
8
8
0
8
8
6
8
8
8
8
0
0
0
1
8
4
8
8
8
2
4
1
8
1
6
0
2
8
6
8
8
1
4
2
8
8
0
0
8
2
0
8
8
8
4
8
8
8
8
2
0
0
4
8
8
1
8
7
6
7
0
8
8
8
0
4
7
8
4
0
8
0
4
8
8
8
7
8
4
7
2
8
8
8
0
2
2
8
8
8
4
4
0
8
0
8
8
1
1

result:

ok 100 lines

Test #7:

score: 0
Accepted
time: 1114ms
memory: 329644kb

input:

50 100
b????????bca?????c?b??ca?acac?b?b???ca?ab???a?a???
35 43 36
12 49 47
7 11 34
38 44 22
42 17 10
49 8 38
18 26 44
6 18 14
28 29 6
48 32 47
29 15 48
1 5 33
24 17 18
10 27 32
19 10 34
2 23 9
14 24 39
46 12 34
9 49 26
21 8 46
43 43 3
31 16 2
8 27 7
24 41 35
17 25 31
0 13 47
24 31 23
33 40 30
36 39...

output:

34272000
31599360
497244
34272000
17637520
12290752
34272000
93044
415832
34272000
34272000
0
34272000
16360704
27933952
0
34272000
33886976
7896832
12290752
718
24
0
34272000
34272000
0
34272000
34272000
34272000
32254720
0
5666944
34256640
34272000
34272000
12290752
30493248
34256640
20630016
0
10...

result:

ok 100 lines

Test #8:

score: 0
Accepted
time: 1083ms
memory: 425464kb

input:

100 1000
c?cbababcabacbacbacacbacabcbabababacababcbcab?cbabacbacbcbcacbab?bcabcbcababcacbabacbcb?babcbab?baca
13 11 4
4 17 20
14 5 2
16 14 15
8 12 17
19 5 11
5 17 12
20 7 6
19 10 1
6 5 0
13 1 9
7 17 1
20 4 16
11 12 18
19 2 16
18 1 11
19 16 3
7 1 0
6 9 16
6 9 16
6 20 7
0 16 20
1 2 8
16 5 20
18 14 18
...

output:

16
15
14
16
16
16
16
16
8
2
16
8
16
16
16
16
16
2
16
16
16
0
1
16
16
5
1
5
16
16
16
16
16
15
16
13
16
15
2
16
16
1
8
16
16
16
15
0
16
15
16
16
16
16
8
8
16
16
16
16
16
16
8
16
16
1
8
8
16
16
1
16
1
0
16
2
2
16
7
16
16
8
16
16
16
16
1
16
14
16
16
16
16
5
16
16
14
16
11
16
15
11
2
1
8
16
16
7
16
5
16
...

result:

ok 1000 lines

Test #9:

score: -100
Wrong Answer
time: 1122ms
memory: 438564kb

input:

100 1000
?????c??????????????????????????b???a????a?????????????????????????c????????????????????????????????
43 38 20
27 40 32
39 27 33
28 50 43
50 3 46
38 46 14
42 48 10
45 25 28
49 10 49
38 17 42
41 49 22
41 18 44
46 47 25
17 44 35
34 43 22
47 42 32
32 44 40
36 41 24
45 38 45
49 44 18
42 34 32
43...

output:

-509524351
143989836
119661929
-292135540
10104
219100551
479284703
-235781478
-96153776
-340305459
204287063
105920502
191779504
182802705
215438611
938692318
797581204
-96082587
893995828
-712777383
-421304178
95654849
457810426
-290650212
85961844
-76669513
-216992501
111119718
295402274
24159407...

result:

wrong answer 1st lines differ - expected: '490475656', found: '-509524351'
English 繁體中文 简体中文

服务器时间: 2025-02-07 00:39:10 | 开源项目