Submission #531470

#	Time	Username	Problem	Language	Result	Execution time	Memory
531470		fcw	Selling RNA Strands (JOI16_selling_rna)	C++17	35 / 100	1575 ms	52908 KiB

selling_rna

#include <bits/stdc++.h>
#define st first
#define nd second
using lint = int64_t;
constexpr int mod = int(1e9) + 7;
constexpr int inf = 0x3f3f3f3f;
constexpr int ninf = 0xcfcfcfcf;
constexpr lint linf = 0x3f3f3f3f3f3f3f3f;
const long double pi = acosl(-1.0);
// Returns -1 if a < b, 0 if a = b and 1 if a > b.
int cmp_double(double a, double b = 0, double eps = 1e-9) {
	return a + eps > b ? b + eps > a ? 0 : 1 : -1;
}
using namespace std;

int f(char c){
	if(c == 'A') return 0;
	if(c == 'C') return 1;
	if(c == 'G') return 2;
	return 3;
}

int main() {
	cin.tie(nullptr)->sync_with_stdio(false);
	int n, m;
	cin>>n>>m;
	vector<string>s(n), t(n), p(m), q(m);
	for(int i=0;i<n;i++){
		cin>>s[i];
		t[i] = s[i];
		reverse(t[i].begin(), t[i].end());
	}
	for(int i=0;i<m;i++){
		cin>>p[i]>>q[i];
		reverse(q[i].begin(), q[i].end());
	}
	vector<array<int, 4>>triep(1, {-1, -1, -1, -1}), trieq(1, {-1, -1, -1, -1});
	vector<vector<int>>gp(1), gq(1);
	for(int i=0;i<m;i++){
		{
			int cur = 0;
			for(char c : p[i]){
				int b = f(c);
				if(triep[cur][b] == -1){
					triep[cur][b] = (int)triep.size();
					triep.push_back({-1, -1, -1, -1});
					gp.push_back({});
				}
				cur = triep[cur][b];
			}
			gp[cur].push_back(i);
		}
		{
			int cur = 0;
			for(char c : q[i]){
				int b = f(c);
				if(trieq[cur][b] == -1){
					trieq[cur][b] = (int)trieq.size();
					trieq.push_back({-1, -1, -1, -1});
					gq.push_back({});
				}
				cur = trieq[cur][b];
			}
			gq[cur].push_back(i);
		}
	}
	vector<int>ans(m);
	vector<bool>w(m);
	for(int i=0;i<n;i++){
		vector<int>v;
		{
			int cur = 0;
			for(char c : s[i]){
				int b = f(c);
				if(triep[cur][b] == -1) break;
				cur = triep[cur][b];
				for(int u : gp[cur]){
					v.push_back(u);
					w[u] = 1;
				}
			}
		}
		{
			int cur = 0;
			for(char c : t[i]){
				int b = f(c);
				if(trieq[cur][b] == -1) break;
				cur = trieq[cur][b];
				for(int u : gq[cur]){
					if(w[u]) ans[u]++;
				}
			}
		}
		for(int u : v) w[u] = 0;
	}
	for(int i=0;i<m;i++) cout<<ans[i]<<"\n";

	return 0;
}
/*
[  ]Leu o problema certo???
[  ]Ver se precisa de long long
[  ]Viu o limite dos fors (é n? é m?)
[  ]Tamanho do vetor, será que é 2e5 em vez de 1e5??
[  ]Testar sample
[  ]Testar casos de  borda
[  ]1LL no 1LL << i
[  ]Testar mod (é 1e9+7, mesmo?, será que o mod não ficou negativo?)
*/

• Subtask 1: 10 / 10
• Subtask 2: 25 / 25
• Subtask 3: 0 / 25
• Subtask 4: 0 / 40