# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
239027 |
2020-06-14T07:15:21 Z |
VEGAnn |
Mate (COCI18_mate) |
C++14 |
|
25 ms |
16512 KB |
#include <bits/stdc++.h>
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")
#define i2 array<int,2>
#define PB push_back
#define all(x) x.begin(),x.end()
#define sz(x) ((int)x.size())
using namespace std;
typedef long long ll;
const int N = 2010;
const ll OO = 1e18;
const int md = int(1e9) + 7;
string s, st;
int n, C[N][N];
ll cnt[N][26], ans;
int sum(int x, int y){
x += y;
if (x >= md)
x -= md;
return x;
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef _LOCAL
freopen("in.txt","r",stdin);
#endif // _LOCAL
cin >> s;
n = sz(s);
for (int i = 0; i < n; i++)
for (int j = i + 1; j < n; j++)
cnt[i][s[j] - 'a']++;
C[0][0] = 1;
for (int i = 1; i <= n; i++){
C[i][0] = C[i][i] = 1;
for (int j = 1; j < n; j++)
C[i][j] = sum(C[i - 1][j], C[i - 1][j - 1]);
}
cout << 0;
return 0;
int qq; cin >> qq;
for (; qq; qq--){
int d; cin >> d >> st;
d -= 2;
int ch = (st[1] - 'a');
ans = 0;
for (int i = 0; i < n; i++)
if (s[i] == st[0]) {
if (cnt[i][ch] == 0) break;
(ans += cnt[i][ch] * C[i][d]) %= md;
}
cout << ans << '\n';
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5 ms |
512 KB |
Output isn't correct |
2 |
Incorrect |
5 ms |
512 KB |
Output isn't correct |
3 |
Incorrect |
5 ms |
512 KB |
Output isn't correct |
4 |
Incorrect |
5 ms |
512 KB |
Output isn't correct |
5 |
Incorrect |
5 ms |
1280 KB |
Output isn't correct |
6 |
Incorrect |
5 ms |
1280 KB |
Output isn't correct |
7 |
Incorrect |
6 ms |
1408 KB |
Output isn't correct |
8 |
Incorrect |
5 ms |
1408 KB |
Output isn't correct |
9 |
Incorrect |
24 ms |
16512 KB |
Output isn't correct |
10 |
Incorrect |
25 ms |
16504 KB |
Output isn't correct |