Submission #1156236

#	Time	Username	Problem	Language	Result	Execution time	Memory
1156236		Nurislam	Selling RNA Strands (JOI16_selling_rna)	C++20	35 / 100	1568 ms	5256 KiB

selling_rna

#include <bits/stdc++.h>
using namespace std;

#define int long long
//#define all(x) x.begin(),x.end()
//#define rall(x) x.rbegin(),x.rend()
//#define ff first
//#define ss second
//#define pb push_back
//template<class T, class U> inline bool chmin(T& a, const U& b) { if (a > b) { a = b; return true; } return false; }
//template<class T, class U> inline bool chmax(T& a, const U& b) { if (a < b) { a = b; return true; } return false; }
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//#define rnd(l, r) uniform_int_distribution <int> (l, r)(rng)

const int inf = 1e9, mod = 1e9 + 7;

unordered_map<string, int> smal;
vector<string> big;
void solve(){
	int n, m;
	cin >> n >> m;
	for(int i = 0; i < n; i ++ ){
		string s;
		cin >> s;
		smal[s] ++ ;
		big.push_back(s);
	}
	
	if(n * m <= 4e8+5e7)
		for(int i = 0; i < m; i ++ ){
			string a, b;
			cin >> a >> b;
			
			int ans = 0;
			for(auto x : big)if(x.size() >= max(a.size(), b.size()) && x.substr(0, a.size()) == a && x.substr(x.size()-b.size()) == b)ans += 1;
			cout << ans << '\n';
		}
	else
		for(int i = 0; i < m; i ++ ){
			string a, b;
			cin >> a >> b;
			
			int ans = 0;
			for(auto [x, y] : smal)if(x.size() >= max(a.size(), b.size()) && x.substr(0, a.size()) == a && x.substr(x.size()-b.size()) == b)ans += y;
			cout << ans << '\n';
		}
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);
    int tt = 1;
    //cin >> tt;
    while(tt--){
        solve();
    };
}

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