제출 #550161

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
550161		farhan132	Selling RNA Strands (JOI16_selling_rna)	C++17	100 / 100	332 ms	371736 KiB

selling_rna

/***Farhan132***/
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
//#pragma GCC optimization ("unroll-loops")
//#pragma GCC optimize("Ofast,fast-math")
 
 
#include <bits/stdc++.h>
 
 
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<ll> vll;
typedef pair<ll , ll> ii;
typedef vector< ii > vii;
typedef pair < pair < ll , ll > , pair < ll , ll > > cm; 
typedef tuple < ll,  ll, ll > tp;
 
#define ff first
#define ss second
#define pb push_back
#define in insert
#define f0(b) for(int i=0;i<(b);i++)
#define f00(b) for(int j=0;j<(b);j++)
#define f1(b) for(int i=1;i<=(b);i++)
#define f11(b) for(int j=1;j<=(b);j++)
#define f2(a,b) for(int i=(a);i<=(b);i++)
#define f22(a,b) for(int j=(a);j<=(b);j++)
#define sf(a) scanf("%lld",&a)
#define sff(a,b) scanf("%lld %lld", &a , &b)
#define pf(a) printf("%lld\n",a)
#define pff(a,b) printf("%lld %lld\n", a , b)
#define bug printf("**!\n")
#define mem(a , b) memset(a, b ,sizeof(a))
#define front_zero(n) __builtin_clzll(n)
#define back_zero(n) __builtin_ctzll(n)
#define total_one(n) __builtin_popcount(n)
#define clean fflush(stdout)
 
const ll mod =  (ll) 998244353;
//const ll mod =  (ll) 1e9 + 7;
const ll maxn = (ll)1e8 + 5;
const int nnn = 1048590;
const int inf = numeric_limits<int>::max()-1;
//const ll INF = numeric_limits<ll>::max()-1;
const ll INF = (ll)1e18;
 
ll dx[]={0,1,0,-1};
ll dy[]={1,0,-1,0};
ll dxx[]={0,1,0,-1,1,1,-1,-1};
ll dyy[]={1,0,-1,0,1,-1,1,-1};
 
bool USACO = 0;
 
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
 
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const ll N = 2e6 + 5;

ll nxt[2][N][4];
vector < ll > v[2][N];
ll sum[N];

ll lol(char c){
    if(c == 'A') return 0;
    if(c == 'C') return 1;
    if(c == 'G') return 2;
    return 3;
}
ll id[] = {1, 1};

void add(string s, ll x, ll _i){
    ll cur = 1;
    for(ll i = 0; i < s.size(); i++){
        ll a = lol(s[i]);
        if(nxt[x][cur][a] == -1){
            nxt[x][cur][a] = ++id[x];
        }
        cur = nxt[x][cur][a];
        v[x][cur].pb(_i);
    }
    return;
}
ii query(string s){
    ll x = 0, cur = 1;
    for(ll i = 0; i < s.size(); i++){
        ll a = lol(s[i]);
        if(nxt[x][cur][a] == -1) return {0, 0};
        cur = nxt[x][cur][a];
    }

    return {v[0][cur][0], v[0][cur].back()}; 
}
ll count(string s, ii p){
    ll x = 1, cur = 1;
    for(ll i = 0; i < s.size(); i++){
        ll a = lol(s[i]);
        if(nxt[x][cur][a] == -1) return 0;
        cur = nxt[x][cur][a];
    }

    return upper_bound(v[x][cur].begin(), v[x][cur].end(), p.ss) -  lower_bound(v[x][cur].begin(), v[x][cur].end(), p.ff);
}

string s[N];

void solve(){

  mem(nxt, -1);
  
  ll n , q;
  cin >> n >> q;

  for(ll i = 1; i <= n; i++) cin >> s[i];
  
  sort(s + 1, s + n + 1);

  for(ll i = 1; i <= n; i++){
    add(s[i], 0, i);
    reverse(s[i].begin(), s[i].end());
    add(s[i], 1, i);
  }

  while(q--){
    string p, q;
    cin >> p >> q;
    reverse(q.begin(), q.end());
    cout << count(q, query(p)) << '\n';
  }
  
  return;
}
 
int main() {
    
    
    #ifdef LOCAL
        freopen("in", "r", stdin);
        freopen("out", "w", stdout);
        auto start_time = clock();
    #else 
       ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    #endif
 
    //pre(N);
 
    ll T = 1, CT = 0;  //cin >> T; 
 
    while(T--){
       //  cout << "Case #" << ++CT <<": " ;
        solve();
    }
    #ifdef LOCAL
        auto end_time = clock();
        cerr<< "Execution time: "<<(end_time - start_time)*(int)1e3/CLOCKS_PER_SEC<<" ms\n";
    #endif
 
    return 0;
}

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

selling_rna.cpp: In function 'void add(std::string, ll, ll)':
selling_rna.cpp:83:21: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |     for(ll i = 0; i < s.size(); i++){
      |                   ~~^~~~~~~~~~
selling_rna.cpp: In function 'ii query(std::string)':
selling_rna.cpp:95:21: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   95 |     for(ll i = 0; i < s.size(); i++){
      |                   ~~^~~~~~~~~~
selling_rna.cpp: In function 'll count(std::string, ii)':
selling_rna.cpp:105:21: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  105 |     for(ll i = 0; i < s.size(); i++){
      |                   ~~^~~~~~~~~~
selling_rna.cpp: In function 'int main()':
selling_rna.cpp:156:15: warning: unused variable 'CT' [-Wunused-variable]
  156 |     ll T = 1, CT = 0;  //cin >> T;
      |               ^~

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