제출 #430932

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
430932		MarcoMeijer	Selling RNA Strands (JOI16_selling_rna)	C++14	35 / 100	1599 ms	377948 KiB

selling_rna

#include <bits/stdc++.h>
using namespace std;
 
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e18
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
 
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }
 
// dp
template<class T> bool ckmin(T&a, T&b) { bool bl = a > b; a = min(a,b); return bl;}
template<class T> bool ckmax(T&a, T&b) { bool bl = a < b; a = max(a,b); return bl;}
 
void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}
 
 
//===================//
//   begin program   //
//===================//
 
const int MX = 2e5;
const int N = (1<<23);

// debug
void printString(string s) {
    FOR(c,s) c+='a';
    OUTL(s);
}

int n, m;
string s[MX], p[MX], q[MX];

// tree
int nodes=1;
vi adj[N];
int w[N];
void createNode(int u) {
    RE(i,4) adj[u].pb(nodes++);
}

// trie
string t;
int bg[MX];
int addTrie(int u, int i) {
    if(t.size() == i)
        return u;
    if(adj[u].empty())
        createNode(u);
    return addTrie(adj[u][t[i]],i+1);
}
int getTrie(int u, int i) {
    if(t.size() == i)
        return u;
    if(adj[u].empty())
        return -1;
    return getTrie(adj[u][t[i]],i+1);
}

// dfs pre order
int sgi[N], sge[N], nextSeg = 0;
void dfs(int u) {
    sgi[u] = nextSeg++;
    FOR(v,adj[u])
        dfs(v);
    sge[u] = nextSeg - 1;
}

// segment tree
int seg[N*2];
void addSeg(int i, int v, int p=1, int l=0, int r=N-1) {
    if(i < l || i > r) return;
    seg[p] += v;
    if(l == r)
        return;
    int m=(l+r)/2;
    addSeg(i,v,p*2  ,l  ,m);
    addSeg(i,v,p*2+1,m+1,r);
}
int getSeg(int i, int j, int p=1, int l=0, int r=N-1) {
    if(j < l || i > r) return 0;
    if(i <= l && j >= r) return seg[p];
    int m=(l+r)/2;
    int a=getSeg(i,j,p*2  ,l  ,m);
    int b=getSeg(i,j,p*2+1,m+1,r);
    return a+b;
}

// answer
map<string,vi> mp;
int ans[N];

// dfs ans
string curStr;
vi inter;
void dfsAns(int i) {
    if(inter.empty())
        return;
    RE(c,4) {
        vi rem, newInter;
        FOR(x,inter) {
            if(s[x].size() == i || s[x][i] != c)
                rem.pb(x);
            else
                newInter.pb(x);
        }
        inter = newInter;
        newInter.clear(); newInter.shrink_to_fit();
        FOR(j,rem)
            addSeg(sgi[bg[j]],-1);
        curStr += char(c);

        // answer queries
        vi queries = mp[curStr];
        FOR(x,queries) {
            t = q[x];
            reverse(all(t));
            int u = getTrie(0,0);
            if(u == -1)
                continue;
            ans[x] = getSeg(sgi[u], sge[u]);
        }

        dfsAns(i+1);

        // return back to normal
        curStr.pop_back();
        FOR(j,rem)
            addSeg(sgi[bg[j]], 1);
        FOR(j,rem)
            inter.pb(j);
    }
}

void program() {
    IN(n,m);
    RE(i,n) IN(s[i]);
    RE(i,m) IN(p[i],q[i]);

    // compress strings
    map<char,char> charToComp;
    charToComp['A']=0, charToComp['U']=1, charToComp['G']=2, charToComp['C']=3;
    RE(i,n) FOR(c,s[i]) c = charToComp[c];
    RE(i,m) {
        FOR(c,p[i]) c = charToComp[c];
        FOR(c,q[i]) c = charToComp[c];
    }

    // create trie
    createNode(0);
    RE(i,n) {
        t = s[i];
        reverse(all(t));
        bg[i] = addTrie(0,0);
    }
    dfs(0);
    RE(i,n) addSeg(sgi[bg[i]],1);

    // fill map
    RE(i,m) mp[p[i]].pb(i);

    RE(i,n) inter.pb(i);
    dfsAns(0);

    RE(i,m) OUTL(ans[i]);
}

컴파일 시 표준 에러 (stderr) 메시지

selling_rna.cpp: In function 'int addTrie(int, int)':
selling_rna.cpp:86:17: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   86 |     if(t.size() == i)
      |        ~~~~~~~~~^~~~
selling_rna.cpp: In function 'int getTrie(int, int)':
selling_rna.cpp:93:17: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   93 |     if(t.size() == i)
      |        ~~~~~~~~~^~~~
selling_rna.cpp: In function 'void dfsAns(int)':
selling_rna.cpp:142:28: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  142 |             if(s[x].size() == i || s[x][i] != c)
      |                ~~~~~~~~~~~~^~~~

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