Submission #1165984

#	Time	Username	Problem	Language	Result	Execution time	Memory
1165984		tvgk	Selling RNA Strands (JOI16_selling_rna)	C++20	100 / 100	585 ms	510832 KiB

selling_rna

#include<bits/stdc++.h>
using namespace std;
#define task "a"
#define se second
#define fi first
#define ll long long
#define ii pair<ll, ll>
const long mxN = 1e5 + 7;

int n, q, ans[mxN];
string s[mxN], a[mxN], b[mxN];
vector<int> nw;
vector<ii> Off[mxN];

struct Node
{
    vector<int> cur;
    int cnt, child[30];
};

struct Trie
{
    vector<Node> Tree;

    void Set()
    {
        Tree.resize(2);
    }

    void Upd(int j, string& s, int lv, int id)
    {
        Tree[j].cnt++;
        if (lv == s.size())
        {
            Tree[j].cur.push_back(id);
            return;
        }

        if (!Tree[j].child[s[lv] - 'A'])
        {
            Tree.push_back(Tree[0]);
            Tree[j].child[s[lv] - 'A'] = Tree.size() - 1;
        }
        Upd(Tree[j].child[s[lv] - 'A'], s, lv + 1, id);
    }

    int Get(int j, string& s, int lv, bool pre, bool tt)
    {
        if (lv == s.size() || !j)
            return Tree[j].cnt * tt;

        int res = 0;
        for (int i = 0; i < s[lv] - 'A'; i++)
            res += Tree[Tree[j].child[i]].cnt * pre;
        return res + Get(Tree[j].child[s[lv] - 'A'], s, lv + 1, pre, tt);
    }

    void Run(int j)
    {
        if (!j)
            return;

        for (int i = 0; i <= 'z' - 'a'; i++)
            Run(Tree[j].child[i]);

        for (int i : Tree[j].cur)
            nw.push_back(i);
    }
} Pre, Suf;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    //freopen(task".INP", "r", stdin);
    //freopen(task".OUT", "w", stdout);

    cin >> n >> q;
    Pre.Set();
    Suf.Set();
    for (int i = 1; i <= n; i++)
    {
        cin >> s[i];
        Pre.Upd(1, s[i], 0, i);
    }
    Pre.Run(1);

    for (int i = 1; i <= q; i++)
    {
        cin >> a[i] >> b[i];
        reverse(b[i].begin(), b[i].end());
        Off[Pre.Get(1, a[i], 0, 1, 0)].push_back({-1, i});
        Off[Pre.Get(1, a[i], 0, 1, 1)].push_back({1, i});
    }

    for (int i = 1; i <= n; i++)
    {
        reverse(s[nw[i - 1]].begin(), s[nw[i - 1]].end());
        Suf.Upd(1, s[nw[i - 1]], 0, 0);
        for (ii j : Off[i])
            ans[j.se] += j.fi * Suf.Get(1, b[j.se], 0, 0, 1);
    }

    for (int i = 1; i <= q; i++)
        cout << ans[i] << '\n';
}

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