# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
312467 | fivefourthreeone | Selling RNA Strands (JOI16_selling_rna) | C++17 | 41 ms | 4676 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#define owo(i,a, b) for(auto i=(a);i<(b); ++i)
#define uwu(i,a, b) for(auto i=(a)-1; i>=(b); --i)
#define senpai push_back
#define ttgl pair<int, int>
#define ayaya cout<<"ayaya~"<<endl
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ordered_set tree<ttgl, null_type,less<ttgl>, rb_tree_tag,tree_order_statistics_node_update>
using ll = long long;
using ld = long double;
const ll MOD = 998244353;
const ll root = 62;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll binpow(ll a,ll b){ll res=1;while(b){if(b&1)res=(res*a)%MOD;a=(a*a)%MOD;b>>=1;}return res;}
ll modInv(ll a){return binpow(a, MOD-2);}
const double PI = atan(1);
const double eps = 1e-10;
const int INF = 0x3f3f3f3f;
const int NINF = 0xc0c0c0c0;
const ll INFLL = 0x3f3f3f3f3f3f3f3f;
const ll NINFLL = 0xc0c0c0c0c0c0c0c0;
const int mxN = 100001;
__gnu_pbds::gp_hash_table<int, int> mp;
int n, m;
string s;
int hsh(char a) {
if(a=='A')return 1;
if(a=='C')return 2;
if(a=='G')return 3;
if(a=='U')return 4;
cout<<"REEE\n";
return 5;
}
int main() {
//freopen("file.in", "r", stdin);
//freopen("file.out", "w", stdout);
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
cin.tie(0)->sync_with_stdio(0);
cin>>n>>m;
owo(i, 0, n) {
cin>>s;
int val = 0;
owo(j, 0, s.size()) {
val = (val*5 + hsh(s[j]))%MOD;
mp[val]++;
}
}
string p, q;
owo(i, 0, m) {
cin>>p>>q;
if(q.size() > p.size()) swap(p, q);
bool same = true;
int pval = 0;
int qval = 0;
owo(i, 0, p.size()) {
pval = (pval*5 + hsh(p[i]))%MOD;
}
owo(i, 0, q.size()) {
qval = (qval*5 + hsh(q[i]))%MOD;
if(p[i]==q[i])continue;
same = false;
}
cout<<(same ? mp[qval] : mp[qval] + mp[pval])<<"\n";
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |