oj.uz

답안 #858976

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
858976 2023-10-09T13:50:31 Z hungt58 Selling RNA Strands (JOI16_selling_rna) C++14
100 / 100
 227 ms 444240 KB 
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define ll int
#define TIME  (1.0 * clock() / CLOCKS_PER_SEC)
typedef pair<ll,ll> ii;
const ll maxn=5e6+10;
ll n,m,tim[3];
string s[100010];
struct di
{
    ll child[27],in,ou;
};
vector<ll> c[maxn];
di a[maxn],b[maxn];
void update(ll w)
{
    string sa=s[w];;
    ll u=0;
    for (ll i=0;i<sa.size();i++)
    {
    if (a[u].child[sa[i]-'A'+1]==0)
    {

        a[u].child[sa[i]-'A'+1]=++tim[1];
        a[tim[1]].in=w;
    }
    u=a[u].child[sa[i]-'A'+1];
    a[u].ou=w;

    }
    u=0;
    for (ll i=sa.size()-1;i>=0;i--)
    {
    if (b[u].child[sa[i]-'A'+1]==0)
    {
        b[u].child[sa[i]-'A'+1]=++tim[2];
    }
    u=b[u].child[sa[i]-'A'+1];

    c[u].push_back(w);

    }
}
void get (string sa,string sb)
{
    ll u=0,ua=0;
    for (ll i=0;i<sa.size();i++)
    if (a[u].child[sa[i]-'A'+1]!=0) u=a[u].child[sa[i]-'A'+1]; else {cout<<"0";return;}

    for (ll i=sb.size()-1;i>=0;i--)
    if (b[ua].child[sb[i]-'A'+1]!=0) ua=b[ua].child[sb[i]-'A'+1]; else {cout<<"0";return;}
    c[ua].push_back(1000000);
    ll w=lower_bound(c[ua].begin(),c[ua].end(),a[u].in)-c[ua].begin();
    ll wa=upper_bound(c[ua].begin(),c[ua].end(),a[u].ou)-c[ua].begin();
    wa--;

    if (w>wa) {cout<<"0";return;}
    cout<<wa-w+1;
}
int main()
{
    
    ios_base :: sync_with_stdio(0);
    cin.tie(0),cout.tie(0);
    cin>>n>>m;
    for (ll i=1;i<=n;i++)
    cin>>s[i];
    sort (s+1,s+n+1);
    for (ll i=1;i<=n;i++) update(i);
    for (ll i=1;i<=m;i++)
    {
        cin>>s[1]>>s[2];
        get (s[1],s[2]);
        cout<<'\n';
    }


}

Compilation message

selling_rna.cpp: In function 'void update(int)':
selling_rna.cpp:21:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |     for (ll i=0;i<sa.size();i++)
      |                 ~^~~~~~~~~~
selling_rna.cpp: In function 'void get(std::string, std::string)':
selling_rna.cpp:49:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |     for (ll i=0;i<sa.size();i++)
      |                 ~^~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 120920 KB Output is correct
2 Correct 25 ms 121132 KB Output is correct
3 Correct 26 ms 120924 KB Output is correct
4 Correct 25 ms 120924 KB Output is correct
5 Correct 26 ms 120924 KB Output is correct
6 Correct 25 ms 120924 KB Output is correct
7 Correct 26 ms 120924 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 215 ms 410228 KB Output is correct
2 Correct 213 ms 396928 KB Output is correct
3 Correct 102 ms 360088 KB Output is correct
4 Correct 100 ms 349316 KB Output is correct
5 Correct 186 ms 439632 KB Output is correct
6 Correct 183 ms 444240 KB Output is correct
7 Correct 69 ms 137052 KB Output is correct
8 Correct 212 ms 320892 KB Output is correct
9 Correct 166 ms 290388 KB Output is correct
10 Correct 128 ms 282192 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 122056 KB Output is correct
2 Correct 42 ms 122504 KB Output is correct
3 Correct 44 ms 122192 KB Output is correct
4 Correct 39 ms 121844 KB Output is correct
5 Correct 43 ms 122448 KB Output is correct
6 Correct 48 ms 122296 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 120920 KB Output is correct
2 Correct 25 ms 121132 KB Output is correct
3 Correct 26 ms 120924 KB Output is correct
4 Correct 25 ms 120924 KB Output is correct
5 Correct 26 ms 120924 KB Output is correct
6 Correct 25 ms 120924 KB Output is correct
7 Correct 26 ms 120924 KB Output is correct
8 Correct 215 ms 410228 KB Output is correct
9 Correct 213 ms 396928 KB Output is correct
10 Correct 102 ms 360088 KB Output is correct
11 Correct 100 ms 349316 KB Output is correct
12 Correct 186 ms 439632 KB Output is correct
13 Correct 183 ms 444240 KB Output is correct
14 Correct 69 ms 137052 KB Output is correct
15 Correct 212 ms 320892 KB Output is correct
16 Correct 166 ms 290388 KB Output is correct
17 Correct 128 ms 282192 KB Output is correct
18 Correct 51 ms 122056 KB Output is correct
19 Correct 42 ms 122504 KB Output is correct
20 Correct 44 ms 122192 KB Output is correct
21 Correct 39 ms 121844 KB Output is correct
22 Correct 43 ms 122448 KB Output is correct
23 Correct 48 ms 122296 KB Output is correct
24 Correct 216 ms 360128 KB Output is correct
25 Correct 227 ms 360736 KB Output is correct
26 Correct 219 ms 357312 KB Output is correct
27 Correct 102 ms 318544 KB Output is correct
28 Correct 172 ms 167648 KB Output is correct
29 Correct 90 ms 130156 KB Output is correct