oj.uz

Submission #938081

# Submission time Handle Problem Language Result Execution time Memory
938081 2024-03-04T19:23:44 Z codefox Selling RNA Strands (JOI16_selling_rna) C++14
35 / 100
 1500 ms 278356 KB 
#include <bits/stdc++.h>

using namespace std;

#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")

int N = 3*1e6;

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(300);
    alph['A'] = 0;
    alph['C'] = 1;
    alph['G'] = 2;
    alph['U'] = 3; 

    vector<string> ns(n);
    vector<int> pind(m);
    vector<int> sind(m);
    map<string, int> mp;
    map<string, int> ms;
    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());

        if (mp[a]==0) 
        {
            pind[i] = ++dp;
            mp[a] = dp;
            int curr = 0;
            for (char c:a)
            {
                int next = alph[c];
                if (prefix[curr][next]==-1)
                {
                    prefix[curr][next] = ++cp;
                }   
                curr = prefix[curr][next];
            }
            preind[curr] = dp;
        }
        else pind[i] = mp[a];
        
        if (ms[b]==0) 
        {
            sind[i] = ++ds;
            ms[b] = ds;
            int curr = 0;
            for (char c:b)
            {
                int next = alph[c];
                if (suffix[curr][next]==-1)
                {
                    suffix[curr][next] = ++cs;
                }   
                curr = suffix[curr][next];
            }
            sufind[curr] = ds;
        }
        else sind[i] = ms[b];
    }


    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;
        while (p1 < pnodes[pind[i]].size() && p2 < snodes[sind[i]].size())
        {
            if (pnodes[pind[i]][p1] == snodes[sind[i]][p2]) sol++;
            if (pnodes[pind[i]][p1] > snodes[sind[i]][p2]) p2++;
            else p1++;
        }
        cout << sol << "\n";
    }

    return 0;
}

Compilation message

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

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 258604 KB Output is correct
2 Correct 74 ms 258552 KB Output is correct
3 Correct 67 ms 258640 KB Output is correct
4 Correct 68 ms 258640 KB Output is correct
5 Correct 69 ms 258644 KB Output is correct
6 Correct 86 ms 258648 KB Output is correct
7 Correct 68 ms 258640 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 137 ms 268916 KB Output is correct
2 Correct 220 ms 272216 KB Output is correct
3 Correct 189 ms 270388 KB Output is correct
4 Correct 249 ms 272096 KB Output is correct
5 Correct 108 ms 262816 KB Output is correct
6 Correct 112 ms 262896 KB Output is correct
7 Correct 247 ms 278356 KB Output is correct
8 Correct 147 ms 264016 KB Output is correct
9 Correct 152 ms 264784 KB Output is correct
10 Correct 444 ms 266788 KB Output is correct

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1521 ms 261564 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 258604 KB Output is correct
2 Correct 74 ms 258552 KB Output is correct
3 Correct 67 ms 258640 KB Output is correct
4 Correct 68 ms 258640 KB Output is correct
5 Correct 69 ms 258644 KB Output is correct
6 Correct 86 ms 258648 KB Output is correct
7 Correct 68 ms 258640 KB Output is correct
8 Correct 137 ms 268916 KB Output is correct
9 Correct 220 ms 272216 KB Output is correct
10 Correct 189 ms 270388 KB Output is correct
11 Correct 249 ms 272096 KB Output is correct
12 Correct 108 ms 262816 KB Output is correct
13 Correct 112 ms 262896 KB Output is correct
14 Correct 247 ms 278356 KB Output is correct
15 Correct 147 ms 264016 KB Output is correct
16 Correct 152 ms 264784 KB Output is correct
17 Correct 444 ms 266788 KB Output is correct
18 Execution timed out 1521 ms 261564 KB Time limit exceeded
19 Halted 0 ms 0 KB -