oj.uz

Submission #257040

# Submission time Handle Problem Language Result Execution time Memory
257040 2020-08-03T14:31:47 Z Marlov Mate (COCI18_mate) C++14
90 / 100
 2000 ms 28764 KB 
/*
Code by @marlov       
*/
#include <iostream>
#include <fstream>
#include <string>
#include <sstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <utility>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <iterator>
using namespace std;
typedef long long ll;
typedef pair<long long,long long> pi;

#define maxV 2005
#define MOD 1000000007

string s;
long long Q;
long long pc[maxV][maxV];
long long dp[maxV][26];

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	//ofstream cout("Math.out");
	cin>>s;
	cin>>Q;
	for(long long i=0;i<maxV;i++){
		pc[i][0]=1;
		for(long long j=1;j<i;j++){
			pc[i][j]=pc[i-1][j]+pc[i-1][j-1];
			pc[i][j]%=MOD;
		}
		pc[i][i]=1;
	}
	for(long long i=0;i<26;i++){
		for(long long j=s.length()-1;j>=0;j--){
			if(s[j]=='a'+i){
				dp[j][i]++;
			}
			if(j<s.length()-1){
				dp[j][i]+=dp[j+1][i];
			}
		}
	}
	long long tl;
	char fc,sc;
	for(long long i=0;i<Q;i++){
		long long result=0;
		cin>>tl>>fc>>sc;
		for(long long j=tl-2;j<s.length()-1;j++){
			if(s[j]==fc){
				result+=pc[j][tl-2]*(dp[j+1][sc-'a']);
				result%=MOD;
			}
		}
		cout<<result<<'\n';
	}
    return 0;
}
/*
malimateodmameitate
3
10 ot
7 aa
3 me
*/
/* stuff you should look for
	* long long overflow, array bounds
	* special cases (n=1,n=0?)
	* do smth instead of nothing and stay organized
*/

Compilation message

mate.cpp: In function 'int main()':
mate.cpp:51:8: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if(j<s.length()-1){
       ~^~~~~~~~~~~~~
mate.cpp:61:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(long long j=tl-2;j<s.length()-1;j++){
                        ~^~~~~~~~~~~~~

Subtask #1
90.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 23168 KB Output is correct
2 Correct 17 ms 23168 KB Output is correct
3 Correct 18 ms 23168 KB Output is correct
4 Correct 22 ms 23168 KB Output is correct
5 Correct 54 ms 24056 KB Output is correct
6 Correct 60 ms 24184 KB Output is correct
7 Correct 49 ms 23928 KB Output is correct
8 Correct 49 ms 23928 KB Output is correct
9 Correct 1947 ms 28764 KB Output is correct
10 Execution timed out 2072 ms 27836 KB Time limit exceeded