oj.uz

Submission #1109666

# Submission time Handle Problem Language Result Execution time Memory
1109666 2024-11-07T09:14:45 Z modwwe Selling RNA Strands (JOI16_selling_rna) C++17
100 / 100
 302 ms 236396 KB 
#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC optimize("conserve-stack")
#include<bits/stdc++.h>
//#define int long long
#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP     ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
#define getchar_unlocked getchar

inline int scan()
{
    char c = getchar_unlocked();
    int x = 0;
    while (c < '0' || c > '9')
    {
        c = getchar_unlocked();
    }
    while (c >= '0' && c <= '9')
    {
        x = (x << 1) + (x << 3) + c - '0';
        c = getchar_unlocked();
    }
    return x;
}

void phongbeo();
const int inf = 1e9;
const int mod2 = 1e9 + 7;
const int  mod1 = 998244353;
const ll base=67;
int add(int x,int y)
{
    if(x+y>=mod2) x-=mod2;
    if(x+y<0) x+=mod2;
    return x+y;
}
struct icd
{
    long double a;
    int b;
};
struct ib
{
    int a;
    int b;
};
struct ic
{
    int a, b, c;
};
struct id
{
    int a, b, c, d;
};
struct ie
{
    int a, b, c, d, e;

};

int n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, mid, l2, r2, center;
int  i, s10, s12,k1,k2,k3,s11,t,lim,w,l,r;
int kk;
int el = 19;

main()
{
    if(fopen(task".inp","r"))
    {
        fin(task);
        //  fou(task);
    }
    NHP
    /// cin>>s1;
    // modwwe
    phongbeo(),down
    // checktime
}
struct node
{
    node* c[4];
    vector<int> pos;
    node()
    {
        for(int i=0; i<4; i++)
            c[i]=NULL;
    }
};
node* rot=new node();
node* pot=new node();
int getId (char C)
{
    if (C == 'A') return 0;
    else if (C == 'G') return 1;
    else if (C == 'C') return 2;
    else return 3;
}
void add(string x,int k,node* u)
{
    for(int i=0; i<x.size(); i++)
    {
        s2=getId(x[i]);
        if(u->c[s2]==NULL)u->c[s2]=new node();
        u=u->c[s2];
        u->pos.pb(k);
    }
}
ib lefandrig(string x,node* u)
{
    for(int i=0; i<x.size(); i++)
    {
        s2=getId(x[i]);
        if(u->c[s2]==NULL)return{-1,-1};
        u=u->c[s2];
    }
    return {u->pos[0],u->pos.back()};
}
int get(ib c,string x,node* u)
{
    for(int i=0; i<x.size(); i++)
    {
        s2=getId(x[i]);
        if(u->c[s2]==NULL) return 0;
        u=u->c[s2];
    }
    return upper_bound(u->pos.begin(),u->pos.end(),c.b)-lower_bound(u->pos.begin(),u->pos.end(),c.a);
}
string Rev (string &S)
{
    static string res;
    res = "";
    for (int i= S.size() - 1; i>=0; --i) res += S[i];
    return res;
}
void phongbeo()
{
    cin>>n>>m;
    vector<string>a(n);
    for(int i=0; i<n; i++)
        cin>>a[i];
    sort(a.begin(),a.end());
    for(int i=0; i<n; i++)
        add(a[i],i,rot),
            add(Rev(a[i]),i,pot);
    for(int i=1; i<=m; i++)
    {
        string c1,c2;
        cin>>c1>>c2;
        cout<<get(lefandrig(c1,rot),Rev(c2),pot),down
    }
}

Compilation message

selling_rna.cpp:76:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   76 | main()
      | ^~~~
selling_rna.cpp: In function 'void add(std::string, int, node*)':
selling_rna.cpp:110:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  110 |     for(int i=0; i<x.size(); i++)
      |                  ~^~~~~~~~~
selling_rna.cpp: In function 'ib lefandrig(std::string, node*)':
selling_rna.cpp:120:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  120 |     for(int i=0; i<x.size(); i++)
      |                  ~^~~~~~~~~
selling_rna.cpp: In function 'int get(ib, std::string, node*)':
selling_rna.cpp:130:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  130 |     for(int i=0; i<x.size(); i++)
      |                  ~^~~~~~~~~
selling_rna.cpp: In function 'int main()':
selling_rna.cpp:13:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | #define fin(x) freopen(x".inp","r",stdin)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~
selling_rna.cpp:80:9: note: in expansion of macro 'fin'
   80 |         fin(task);
      |         ^~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 284 ms 200776 KB Output is correct
2 Correct 302 ms 192368 KB Output is correct
3 Correct 245 ms 199820 KB Output is correct
4 Correct 234 ms 190792 KB Output is correct
5 Correct 283 ms 233064 KB Output is correct
6 Correct 286 ms 236396 KB Output is correct
7 Correct 87 ms 24516 KB Output is correct
8 Correct 240 ms 154488 KB Output is correct
9 Correct 205 ms 131808 KB Output is correct
10 Correct 176 ms 126436 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 3656 KB Output is correct
2 Correct 19 ms 3152 KB Output is correct
3 Correct 21 ms 3464 KB Output is correct
4 Correct 16 ms 2904 KB Output is correct
5 Correct 19 ms 3152 KB Output is correct
6 Correct 23 ms 3408 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 284 ms 200776 KB Output is correct
9 Correct 302 ms 192368 KB Output is correct
10 Correct 245 ms 199820 KB Output is correct
11 Correct 234 ms 190792 KB Output is correct
12 Correct 283 ms 233064 KB Output is correct
13 Correct 286 ms 236396 KB Output is correct
14 Correct 87 ms 24516 KB Output is correct
15 Correct 240 ms 154488 KB Output is correct
16 Correct 205 ms 131808 KB Output is correct
17 Correct 176 ms 126436 KB Output is correct
18 Correct 22 ms 3656 KB Output is correct
19 Correct 19 ms 3152 KB Output is correct
20 Correct 21 ms 3464 KB Output is correct
21 Correct 16 ms 2904 KB Output is correct
22 Correct 19 ms 3152 KB Output is correct
23 Correct 23 ms 3408 KB Output is correct
24 Correct 264 ms 168008 KB Output is correct
25 Correct 272 ms 168052 KB Output is correct
26 Correct 244 ms 166016 KB Output is correct
27 Correct 241 ms 166216 KB Output is correct
28 Correct 164 ms 47284 KB Output is correct
29 Correct 71 ms 16564 KB Output is correct