oj.uz

Submission #938091

# Submission time Handle Problem Language Result Execution time Memory
938091 2024-03-04T19:31:34 Z codefox Selling RNA Strands (JOI16_selling_rna) C++14
60 / 100
 1500 ms 189992 KB 
#include <bits/stdc++.h>

using namespace std;

#pragma GCC optimize("O2")

int N = 2*1e6+1;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);

    int n, m;
    cin >> n >> m;

    vector<array<int, 4>> prefix(N, {-1, -1, -1, -1});
    vector<array<int, 4>> suffix(N, {-1, -1, -1, -1});
    vector<int> preind(N, -1);
    vector<int> sufind(N, -1);

    vector<vector<int>> pnodes(N);
    vector<vector<int>> snodes(N);

    vector<int> alph(100);
    alph['A'] = 0;
    alph['C'] = 1;
    alph['G'] = 2;
    alph['U'] = 3; 

    vector<string> ns(n);
    vector<int> pind(m);
    vector<int> sind(m);
    int cp = 0;
    int cs = 0;
    int dp = 0;
    int ds = 0;

    for (int i = 0; i < n; i++) cin >> ns[i];

    for (int i = 0; i < m; i++)
    {
        string a, b;
        cin >> a >> b;
        reverse(b.begin(), b.end());

        int curr = 0;
        for (char c:a)
        {
            int next = alph[c];
            if (prefix[curr][next]==-1)
            {
                prefix[curr][next] = ++cp;
            }   
            curr = prefix[curr][next];
        }
        if (preind[curr]==-1) 
        {
            preind[curr] = ++dp;
            pind[i] = dp;
        }
        else pind[i] = preind[curr];
        

        curr = 0;
        for (char c:b)
        {
            int next = alph[c];
            if (suffix[curr][next]==-1)
            {
                suffix[curr][next] = ++cs;
            }   
            curr = suffix[curr][next];
        }
        if (sufind[curr] ==-1) 
        {
            sufind[curr] = ++ds;
            sind[i] = ds;
        }
        else sind[i] =sufind[curr];
    }


    for (int i = 0; i < n; i++)
    {
        int curr = 0;
        for (char c:ns[i])
        {
            int next = alph[c];
            curr = prefix[curr][next];
            if (curr == -1) break;
            if (preind[curr]!=-1) pnodes[preind[curr]].push_back(i);
        }
        reverse(ns[i].begin(), ns[i].end());
        curr = 0;
        for (char c:ns[i])
        {
            int next = alph[c];
            curr = suffix[curr][next];
            if (curr == -1) break;
            if (sufind[curr]!=-1)  snodes[sufind[curr]].push_back(i);
        }
    }

    for (int i = 0; i < m; i++)
    {
        int p1 = 0;
        int p2 = 0;
        int sol = 0;
        int pi = pind[i];
        int si = sind[i];
        while (p1 < pnodes[pi].size() && p2 < snodes[si].size())
        {
            if (pnodes[pi][p1] == snodes[si][p2]) 
            {
                p1++;
                p2++;
                sol++;
            }
            else if (pnodes[pi][p1] > snodes[si][p2]) p2++;
            else p1++;
        }
        cout << sol << "\n";
    }

    return 0;
}

Compilation message

selling_rna.cpp: In function 'int main()':
selling_rna.cpp:116:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  116 |         while (p1 < pnodes[pi].size() && p2 < snodes[si].size())
      |                ~~~^~~~~~~~~~~~~~~~~~~
selling_rna.cpp:116:45: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  116 |         while (p1 < pnodes[pi].size() && p2 < snodes[si].size())
      |                                          ~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 172628 KB Output is correct
2 Correct 36 ms 172632 KB Output is correct
3 Correct 37 ms 172628 KB Output is correct
4 Correct 36 ms 172620 KB Output is correct
5 Correct 36 ms 172628 KB Output is correct
6 Correct 36 ms 172644 KB Output is correct
7 Correct 35 ms 172460 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 181332 KB Output is correct
2 Correct 92 ms 185400 KB Output is correct
3 Correct 84 ms 183396 KB Output is correct
4 Correct 92 ms 185424 KB Output is correct
5 Correct 50 ms 174676 KB Output is correct
6 Correct 52 ms 174672 KB Output is correct
7 Correct 92 ms 189992 KB Output is correct
8 Correct 68 ms 174928 KB Output is correct
9 Correct 70 ms 175192 KB Output is correct
10 Correct 75 ms 180560 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 636 ms 175440 KB Output is correct
2 Correct 760 ms 174652 KB Output is correct
3 Correct 1243 ms 175024 KB Output is correct
4 Correct 175 ms 174456 KB Output is correct
5 Correct 735 ms 174584 KB Output is correct
6 Correct 1222 ms 175340 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 172628 KB Output is correct
2 Correct 36 ms 172632 KB Output is correct
3 Correct 37 ms 172628 KB Output is correct
4 Correct 36 ms 172620 KB Output is correct
5 Correct 36 ms 172628 KB Output is correct
6 Correct 36 ms 172644 KB Output is correct
7 Correct 35 ms 172460 KB Output is correct
8 Correct 66 ms 181332 KB Output is correct
9 Correct 92 ms 185400 KB Output is correct
10 Correct 84 ms 183396 KB Output is correct
11 Correct 92 ms 185424 KB Output is correct
12 Correct 50 ms 174676 KB Output is correct
13 Correct 52 ms 174672 KB Output is correct
14 Correct 92 ms 189992 KB Output is correct
15 Correct 68 ms 174928 KB Output is correct
16 Correct 70 ms 175192 KB Output is correct
17 Correct 75 ms 180560 KB Output is correct
18 Correct 636 ms 175440 KB Output is correct
19 Correct 760 ms 174652 KB Output is correct
20 Correct 1243 ms 175024 KB Output is correct
21 Correct 175 ms 174456 KB Output is correct
22 Correct 735 ms 174584 KB Output is correct
23 Correct 1222 ms 175340 KB Output is correct
24 Correct 328 ms 183076 KB Output is correct
25 Correct 793 ms 180084 KB Output is correct
26 Correct 168 ms 185936 KB Output is correct
27 Correct 307 ms 183040 KB Output is correct
28 Execution timed out 1550 ms 188748 KB Time limit exceeded
29 Halted 0 ms 0 KB -