oj.uz

Submission #1106538

# Submission time Handle Problem Language Result Execution time Memory
1106538 2024-10-30T15:37:42 Z ntdaccode Selling RNA Strands (JOI16_selling_rna) C++17
100 / 100
 298 ms 380488 KB 
#include<bits/stdc++.h>
#define fori(i,a,b) for(int i=a;i<=b;i++)
#define pb push_back

using namespace std;
typedef pair<int,int> ii;
typedef tuple<int,int,int> tp;
const int M=1e5+10;
const int N=3e6+10;
const int mod=1e9+7;
int n,m;
int ch[N][26],ch2[N][26];
int l[N],r[N];
vector<int> suf[N];
int cnt=0,cnt2=0;
void upd(string s,int node)
{
  int idx=0;
  fori(i,0,s.size()-1) {
    int k=s[i]-'A';
    if(!ch[idx][k])
    {
      ch[idx][k]=++cnt;
      l[cnt]=1e9;
      r[cnt]=0;
    }
    l[idx]=min(l[idx],node);
    r[idx]=max(r[idx],node);
    idx=ch[idx][k];
  }
  l[idx]=min(l[idx],node);
  r[idx]=max(r[idx],node);

}
void upd2(string s,int node)
{
  int idx=0;
  fori(i,0,s.size()-1) {
    int k=s[i]-'A';
    if(!ch2[idx][k]) ch2[idx][k]=++cnt2;
    suf[idx].pb(node);
    idx=ch2[idx][k];
  }
  suf[idx].pb(node);
}
ii get(string s)
{
  int idx=0;
  fori(i,0,s.size()-1) {
    int k=s[i]-'A';
    if(!ch[idx][k]) return {0,0};
    idx=ch[idx][k];
  }
  return {l[idx],r[idx]};
}
int get2(string s,int u,int v)
{
  int idx=0;
  fori(i,0,s.size()-1) {
    int k=s[i]-'A';
    if(!ch2[idx][k]) return 0;
    idx=ch2[idx][k];
    //cout << idx << " " << s[i] << "\n";
  }
  //for(int x:suf[idx]) cout << x << " ";
  int uu=lower_bound(suf[idx].begin(),suf[idx].end(),u)-suf[idx].begin();
  int vv=upper_bound(suf[idx].begin(),suf[idx].end(),v)-suf[idx].begin();
  return vv-uu;
}
string s[M];
int32_t main()
{
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  if(fopen("1.inp","r"))
  {
    freopen("1.inp","r",stdin);
    freopen("1.out","w",stdout);
  }
  #define task ""
  if(fopen(task".inp","r"))
  {
    freopen(task".inp","r",stdin);
    freopen(task".out","w",stdout);
  }

  cin >> n >> m;
  fori(i,1,n) cin >> s[i];
  l[0]=1e9,r[0]=0;
  sort(s+1,s+n+1);
  fori(i,1,n){
    upd(s[i],i);
    reverse(s[i].begin(),s[i].end());
    upd2(s[i],i);
  }
  while(m--) {
    string pre,suf;
    cin >> pre >> suf;
    reverse(suf.begin(),suf.end());
    auto [u,v] = get(pre);
    if(u==0&&v==0) cout << 0 << "\n";
    else cout << get2(suf,u,v) << "\n";
  }


}

Compilation message

selling_rna.cpp: In function 'void upd(std::string, int)':
selling_rna.cpp:2:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    2 | #define fori(i,a,b) for(int i=a;i<=b;i++)
......
   19 |   fori(i,0,s.size()-1) {
      |        ~~~~~~~~~~~~~~             
selling_rna.cpp:19:3: note: in expansion of macro 'fori'
   19 |   fori(i,0,s.size()-1) {
      |   ^~~~
selling_rna.cpp: In function 'void upd2(std::string, int)':
selling_rna.cpp:2:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    2 | #define fori(i,a,b) for(int i=a;i<=b;i++)
......
   38 |   fori(i,0,s.size()-1) {
      |        ~~~~~~~~~~~~~~             
selling_rna.cpp:38:3: note: in expansion of macro 'fori'
   38 |   fori(i,0,s.size()-1) {
      |   ^~~~
selling_rna.cpp: In function 'ii get(std::string)':
selling_rna.cpp:2:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    2 | #define fori(i,a,b) for(int i=a;i<=b;i++)
......
   49 |   fori(i,0,s.size()-1) {
      |        ~~~~~~~~~~~~~~             
selling_rna.cpp:49:3: note: in expansion of macro 'fori'
   49 |   fori(i,0,s.size()-1) {
      |   ^~~~
selling_rna.cpp: In function 'int get2(std::string, int, int)':
selling_rna.cpp:2:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    2 | #define fori(i,a,b) for(int i=a;i<=b;i++)
......
   59 |   fori(i,0,s.size()-1) {
      |        ~~~~~~~~~~~~~~             
selling_rna.cpp:59:3: note: in expansion of macro 'fori'
   59 |   fori(i,0,s.size()-1) {
      |   ^~~~
selling_rna.cpp: In function 'int32_t main()':
selling_rna.cpp:78:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   78 |     freopen("1.inp","r",stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~
selling_rna.cpp:79:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   79 |     freopen("1.out","w",stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~
selling_rna.cpp:84:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   84 |     freopen(task".inp","r",stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
selling_rna.cpp:85:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   85 |     freopen(task".out","w",stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 76368 KB Output is correct
2 Correct 13 ms 76368 KB Output is correct
3 Correct 13 ms 76556 KB Output is correct
4 Correct 12 ms 76368 KB Output is correct
5 Correct 12 ms 76368 KB Output is correct
6 Correct 13 ms 76516 KB Output is correct
7 Correct 12 ms 76368 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 266 ms 344648 KB Output is correct
2 Correct 280 ms 330460 KB Output is correct
3 Correct 221 ms 308036 KB Output is correct
4 Correct 181 ms 298056 KB Output is correct
5 Correct 264 ms 376196 KB Output is correct
6 Correct 261 ms 380488 KB Output is correct
7 Correct 56 ms 92232 KB Output is correct
8 Correct 282 ms 263992 KB Output is correct
9 Correct 221 ms 234312 KB Output is correct
10 Correct 202 ms 227912 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 78028 KB Output is correct
2 Correct 29 ms 78160 KB Output is correct
3 Correct 33 ms 78028 KB Output is correct
4 Correct 26 ms 77772 KB Output is correct
5 Correct 29 ms 78160 KB Output is correct
6 Correct 33 ms 78124 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 76368 KB Output is correct
2 Correct 13 ms 76368 KB Output is correct
3 Correct 13 ms 76556 KB Output is correct
4 Correct 12 ms 76368 KB Output is correct
5 Correct 12 ms 76368 KB Output is correct
6 Correct 13 ms 76516 KB Output is correct
7 Correct 12 ms 76368 KB Output is correct
8 Correct 266 ms 344648 KB Output is correct
9 Correct 280 ms 330460 KB Output is correct
10 Correct 221 ms 308036 KB Output is correct
11 Correct 181 ms 298056 KB Output is correct
12 Correct 264 ms 376196 KB Output is correct
13 Correct 261 ms 380488 KB Output is correct
14 Correct 56 ms 92232 KB Output is correct
15 Correct 282 ms 263992 KB Output is correct
16 Correct 221 ms 234312 KB Output is correct
17 Correct 202 ms 227912 KB Output is correct
18 Correct 31 ms 78028 KB Output is correct
19 Correct 29 ms 78160 KB Output is correct
20 Correct 33 ms 78028 KB Output is correct
21 Correct 26 ms 77772 KB Output is correct
22 Correct 29 ms 78160 KB Output is correct
23 Correct 33 ms 78124 KB Output is correct
24 Correct 281 ms 296696 KB Output is correct
25 Correct 298 ms 296876 KB Output is correct
26 Correct 292 ms 294224 KB Output is correct
27 Correct 197 ms 266884 KB Output is correct
28 Correct 160 ms 120248 KB Output is correct
29 Correct 73 ms 85436 KB Output is correct