oj.uz

답안 #938101

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
938101 2024-03-04T19:42:43 Z TAhmed33 Mate (COCI18_mate) C++
100 / 100
 499 ms 30288 KB 
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
int add (int a, int b) {
	a += b; if (a >= MOD) a -= MOD;
	return a;
}
int sub (int a, int b) {
	a -= b; if (a < 0) a += MOD;
	return a;
}
int mul (int a, int b) {
	return (a * 1ll * b) % MOD;
}
int nCr[2001][2001];
int pre[2001][26][26];
string s; int n, q;
vector <int> occ[26];
int main () {
	for (int i = 0; i <= 2000; i++) {
		for (int j = 0; j <= i; j++) {
			if (j == i || j == 0) nCr[i][j] = 1;
			else nCr[i][j] = add(nCr[i - 1][j], nCr[i - 1][j - 1]);
		}
	}
	ios::sync_with_stdio(0); cin.tie(0);
	cin.tie(0);
	cin >> s; n = s.length();
	for (int i = n - 1; i >= 0; i--) occ[s[i] - 'a'].push_back(i);
	for (int i = 0; i < 26; i++) {
		for (int j = 0; j < 26; j++) {
			for (int l = 2; l <= n; l++) {
				int p = 0;
				for (int q = 0; q < (int)occ[j].size(); q++) {
					while (p < (int)occ[i].size() && occ[i][p] > occ[j][q]) p++;
					pre[l][j][i] = add(pre[l][j][i], mul(p, nCr[occ[j][q]][l - 2]));
				}
			}	
		}
	}
	cin >> q;
	while (q--) {
		int t; cin >> t; char a, b; cin >> a >> b;
		cout << pre[t][a - 'a'][b - 'a'] << '\n';
	}
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 17496 KB Output is correct
2 Correct 9 ms 17500 KB Output is correct
3 Correct 10 ms 17244 KB Output is correct
4 Correct 9 ms 17408 KB Output is correct
5 Correct 25 ms 19284 KB Output is correct
6 Correct 27 ms 19544 KB Output is correct
7 Correct 34 ms 19036 KB Output is correct
8 Correct 32 ms 18952 KB Output is correct
9 Correct 499 ms 30268 KB Output is correct
10 Correct 488 ms 30288 KB Output is correct