Submission #1279922

#	Time	Username	Problem	Language	Result	Execution time	Memory
1279922		nguyennhutruong	Selling RNA Strands (JOI16_selling_rna)	C++20	100 / 100	128 ms	78728 KiB

selling_rna

#include <bits/stdc++.h>
using namespace std;

//#define int long long
#define start signed main
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define il pair<int,ll>
#define pii pair<int,int>
#define len(s) (int)s.size()
#define piii pair<pii,int>
#define mpp make_pair
#define all(s) (s).begin(),(s).end()
#define OpenFile(Name) if (fopen(Name".inp","r")) freopen(Name".inp","r",stdin),freopen(Name".out","w",stdout);

#define MASK(x) ((1LL)<<(x))
#define Bit(x,i) (((x)>>(i))&1)
#define Countbit(x) __builtin_popcountll(x)

typedef long long ll;
typedef long double ld;

int dx[]={1,-1,0,0,-1,1,1,-1};
int dy[]={0,0,1,-1,-1,-1,1,1};

template <class C> bool Minimize(C &a, C b) { if (a>b) { a=b; return true; } return false;}
template <class C> bool Maximize(C &a, C b) { if (a<b) { a=b; return true; } return false;}

const int N=1e6+5,M=1e3+5,INF=1e9,lim=1e6;
const int block=448;

ll Mod=1e9+7,Mod_base=1777777777,LNF=1e18;

///________________________________________________________________________________________________________


const int mod=1e9+7;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=4000005;
const int root=3;

/*
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
*/

const int base=101;
int c[256];
struct BIT{
    int n,bit[maxn];
    BIT(){}
    void init(int N){n=N;}
    void update(int x,int val){
        for(int i=x;i<=n;i+=(i&(-i))) bit[i]+=val;
    }
    int query(int x){
        int res=0;
        for(int i=x;i>=1;i-=(i&(-i))) res+=bit[i];
        return res;
    }
    int query_range(int l,int r){
        return query(r)-query(l-1);
    }
}bit;
struct trie{
    int nxt[maxa][4],leaf[maxa],L[maxa],R[maxa];
    int num,pos;
    vector<int> edge[maxn];
    trie(){}
    int add(string s){
        int u=0;
        for(char ch:s){
            int a=c[ch];
            if(nxt[u][a]==0) nxt[u][a]=++num;
            u=nxt[u][a];
        }
        leaf[u]=1;
        return u;
    }
    void dfs(int u,int d){
        if(leaf[u]){
            L[u]=++pos;
            edge[d].push_back(pos);d=pos;
        }
        for(int i=0;i<4;i++){
            if(nxt[u][i]) dfs(nxt[u][i],d);
        }
        if(leaf[u]) R[u]=pos;
    }
}sf,pf;
vector<pii> add[maxn];
int ans[maxn],child[maxn],son[maxn];
void dfs_sz(int u){
    child[u]=1;
    for(int v:pf.edge[u]){
        dfs_sz(v);child[u]+=child[v];
        if(child[v]>child[son[u]]) son[u]=v;
    }
}
void cal(int u,int val){
    for(auto &[y,id]:add[u]){
        if(id==0) bit.update(y,val);
    }
    for(int v:pf.edge[u]) cal(v,val);
}
void dfs(int u,int t){
    for(int v:pf.edge[u]){
        if(v==son[u]) continue;
        dfs(v,1);
    }
    if(son[u]) dfs(son[u],0);
    for(int v:pf.edge[u]){
        if(v==son[u]) continue;
        cal(v,1);
    }
    for(auto &[y,id]:add[u]){
        if(id==0) bit.update(y,1);
        else ans[id]=bit.query_range(sf.L[y],sf.R[y]);
    }
    if(t) cal(u,-1);
}
void solve(){
    vector<pii> a,b;
    c['A']=0;c['G']=1;c['U']=2;c['C']=3;
    int n,m;cin >> n >> m;
    for(int i=1;i<=n;i++){
        string s;cin >> s;
        int x=pf.add(s);
        reverse(s.begin(),s.end());
        int y=sf.add(s);
        a.push_back({x,y});
    }
    for(int i=1;i<=m;i++){
        string p,q;cin >> p >> q;
        reverse(q.begin(),q.end());
        b.push_back({pf.add(p),sf.add(q)});
    }
    pf.dfs(0,0);sf.dfs(0,0);
    for(auto &[x,y]:a) add[pf.L[x]].push_back({sf.L[y],0});
    for(int i=1;i<=m;i++){
        int x=b[i-1].fi,y=b[i-1].se;
        add[pf.L[x]].push_back({y,i});
    }
    bit.init(sf.pos);
    dfs_sz(0);dfs(0,0);
    for(int i=1;i<=m;i++) cout << ans[i] << '\n';
}

start() {
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    OpenFile("TASK");

    solve();

    //cerr<<"\nBien dich thanh cong\nTime: "<<(1.0*clock()/CLOCKS_PER_SEC)<<" s\n";
    return 0;
}

Compilation message (stderr)

selling_rna.cpp: In function 'int main()':
selling_rna.cpp:16:58: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 | #define OpenFile(Name) if (fopen(Name".inp","r")) freopen(Name".inp","r",stdin),freopen(Name".out","w",stdout);
      |                                                   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
selling_rna.cpp:165:5: note: in expansion of macro 'OpenFile'
  165 |     OpenFile("TASK");
      |     ^~~~~~~~
selling_rna.cpp:16:88: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 | #define OpenFile(Name) if (fopen(Name".inp","r")) freopen(Name".inp","r",stdin),freopen(Name".out","w",stdout);
      |                                                                                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
selling_rna.cpp:165:5: note: in expansion of macro 'OpenFile'
  165 |     OpenFile("TASK");
      |     ^~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 25 / 25
• Subtask 3: 25 / 25
• Subtask 4: 40 / 40