oj.uz

답안 #366241

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
366241 2021-02-13T15:28:10 Z ACmachine Selling RNA Strands (JOI16_selling_rna) C++17
35 / 100
 1500 ms 200900 KB 
#include <bits/stdc++.h>
using namespace std;

#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>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;

#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back 
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize 
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)
	
const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};

#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif

#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}        
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}

struct chash {
    int operator()(pll x) const { return x.first* 31ll + x.second; }
};
ll mod = 58749678952092199;    
ll hash_base = 5;
int main(){
 	ios_base::sync_with_stdio(false);
 	cin.tie(NULL); cout.tie(NULL);
	int n, m;
    cin >> n >> m;
    vector<ll> v(2000005);
    vector<ll> v2(2000005);
    vi a(100); a[(int)'A'] = 1; a[(int)'G'] = 2; a[(int)'C'] = 3; a[(int)'U'] = 4;
    auto get_hash = [&](string s, int x){
        ll hsh = 0;
        REP(i, s.length()){
            hsh *= hash_base;
            hsh += a[s[i]];
            //while(hsh >= mod) hsh -= mod;
            if(x == 0)
                v[i] = hsh; 
            else
                v2[i] = hsh;
        } 
    };
    vector<string> rna_chains(n);
    REP(i, n) cin >> rna_chains[i];
    vector<pair<ll, ll>> queries; 
    vector<pair<int, int>> sizes(m);
    REP(i, m){
        string p, q;
        cin >> p >> q;
        reverse(all(q));
        sizes[i] = (mp(p.length(), q.length()));
        get_hash(p, 0); 
        ll hsh1 = v[(int)p.length() - 1];
        get_hash(q, 0);
        ll hsh2 = v[(int)q.length() - 1];
        queries.pb({hsh1, hsh2});
    }
    sort(all(sizes));
    sizes.erase(unique(all(sizes)), sizes.end());
    sort(all(sizes), [](pair<int, int> a, pair<int, int> b){
        return max(a.ff, a.ss) < max(b.ff, b.ss);
    });
    //map<pll, int> mapka;
    unordered_map<pll, int, chash> mapka;
    REP(i, n){
        get_hash(rna_chains[i], 0);
        reverse(all(rna_chains[i]));
        get_hash(rna_chains[i], 1); 
        int len = rna_chains[i].length();
        REP(j, sizes.size()){
            if(sizes[j].ff > len || sizes[j].ss > len) break;
            mapka[mp(v[sizes[j].ff-1], v2[sizes[j].ss-1])]++;
        }
    }
    REP(j, queries.size()){
        if(mapka.find(queries[j]) != mapka.end())
            cout << mapka[queries[j]] << "\n";
        else
            cout << 0 << "\n";
    }
    return 0;
}

Compilation message

selling_rna.cpp: In lambda function:
selling_rna.cpp:26:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
      |                                        ^
selling_rna.cpp:28:18: note: in expansion of macro 'FOR'
   28 | #define REP(i,b) FOR(i,0,b,1)
      |                  ^~~
selling_rna.cpp:99:9: note: in expansion of macro 'REP'
   99 |         REP(i, s.length()){
      |         ^~~
selling_rna.cpp: In function 'int main()':
selling_rna.cpp:26:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
      |                                        ^
selling_rna.cpp:28:18: note: in expansion of macro 'FOR'
   28 | #define REP(i,b) FOR(i,0,b,1)
      |                  ^~~
selling_rna.cpp:136:9: note: in expansion of macro 'REP'
  136 |         REP(j, sizes.size()){
      |         ^~~
selling_rna.cpp:26:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
      |                                        ^
selling_rna.cpp:28:18: note: in expansion of macro 'FOR'
   28 | #define REP(i,b) FOR(i,0,b,1)
      |                  ^~~
selling_rna.cpp:141:5: note: in expansion of macro 'REP'
  141 |     REP(j, queries.size()){
      |     ^~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 31872 KB Output is correct
2 Correct 22 ms 31724 KB Output is correct
3 Correct 18 ms 31724 KB Output is correct
4 Correct 18 ms 31724 KB Output is correct
5 Correct 18 ms 31724 KB Output is correct
6 Correct 18 ms 31724 KB Output is correct
7 Correct 18 ms 31724 KB Output is correct

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 148 ms 36860 KB Output is correct
2 Correct 324 ms 38980 KB Output is correct
3 Correct 290 ms 38672 KB Output is correct
4 Correct 428 ms 39056 KB Output is correct
5 Execution timed out 1563 ms 200900 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 34796 KB Output is correct
2 Correct 42 ms 33640 KB Output is correct
3 Correct 48 ms 34412 KB Output is correct
4 Correct 35 ms 34284 KB Output is correct
5 Correct 52 ms 33660 KB Output is correct
6 Correct 47 ms 34412 KB Output is correct

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 31872 KB Output is correct
2 Correct 22 ms 31724 KB Output is correct
3 Correct 18 ms 31724 KB Output is correct
4 Correct 18 ms 31724 KB Output is correct
5 Correct 18 ms 31724 KB Output is correct
6 Correct 18 ms 31724 KB Output is correct
7 Correct 18 ms 31724 KB Output is correct
8 Correct 148 ms 36860 KB Output is correct
9 Correct 324 ms 38980 KB Output is correct
10 Correct 290 ms 38672 KB Output is correct
11 Correct 428 ms 39056 KB Output is correct
12 Execution timed out 1563 ms 200900 KB Time limit exceeded
13 Halted 0 ms 0 KB -