oj.uz

답안 #112653

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
112653 2019-05-21T07:33:00 Z MladenP Selling RNA Strands (JOI16_selling_rna) C++17
35 / 100
 1500 ms 206680 KB 
#include<bits/stdc++.h>
#define STIZE(x) fprintf(stderr, "STIZE%d\n", x);
#define PRINT(x) fprintf(stderr, "%s = %d\n", #x, x);
#define NL(x) printf("%c", " \n"[(x)]);
#define lld long long
#define pii pair<int,int>
#define pb push_back
#define fi first
#define se second
#define mid (l+r)/2
#define endl '\n'
#define all(a) begin(a),end(a)
#define sz(a) int((a).size())
#define LINF 1000000000000000LL
#define INF 1000000000
#define EPS 1e-9
using namespace std;
#define MAXL 2000000
#define MAXN 100010
#define MOD 1000000007
int trie[MAXL][4], siz[MAXL], idx[MAXL], nodes, timer, hshidx, key, f[300];
bool sorted[MAXL];
vector<int> gde[MAXL];
unordered_map<int,int> cudo, celi;
lld hsh[MAXN], hsh1[MAXN], st[MAXN];
char P[MAXN], Q[MAXN], S[MAXN];
void ubaci(char s[], int len) {
    int node = 0;
    for(int idx = 0; idx < len; idx++) {
        int c = f[s[idx]];
        if(trie[node][c] == 0) trie[node][c] = ++nodes;
        //inNode[node].pb(hsh[len-1-idx]);
        gde[hsh[len-1-idx]].pb(node);
        node = trie[node][c];
    }
}
stack<int> dfsq;
int DFS(int node) {
    dfsq.push(node);
    while(!dfsq.empty()) {
        int top = dfsq.top();
        if(idx[top] == 0) {
            idx[top] = ++timer;
            //for(auto x : inNode[top]) gde[x].pb(idx[top]);
            for(int i = 0; i < 4; i++) if(trie[top][i]) dfsq.push(trie[top][i]);
        } else {
            dfsq.pop();
            siz[top] = 1;
            for(int i = 0; i < 4; i++) if(trie[top][i]) siz[top] += siz[trie[top][i]];
        }
    }
}
void hashuj(char s[], lld hsh[], int lens) {
    fill(hsh, hsh+lens+5, 0);
    for(int i = 0; i < lens; i++) {
        hsh[i] += st[i]*(f[s[i]]+1);
        if(hsh[i] >= MOD) hsh[i] %= MOD;
        hsh[i+1] += hsh[i];
        if(cudo[hsh[i]] == 0) cudo[hsh[i]] = ++hshidx;
        hsh[i] = cudo[hsh[i]];
    }
}
void hashuj1(char s[], lld hsh[], int lens) {
    fill(hsh, hsh+lens+5, 0);
    for(int i = 0; i < lens; i++) {
        hsh[i] += st[i]*(f[s[i]]+1);
        if(hsh[i] >= MOD) hsh[i] %= MOD;
        hsh[i+1] += hsh[i];
    }
}
int query(char s[], int len) {
    int node = 0;
    for(int idxx = 0; idxx < len; idxx++) {
        int c = f[s[idxx]];
        if(trie[node][c] == 0) return -1;
        node = trie[node][c];
    }
    return node;
}
int main() {
     //freopen("02-01.txt", "r", stdin);
     //freopen("out.txt", "w", stdout);
    int N, M; scanf("%d%d", &N, &M);
    f['A'] = 0, f['G'] = 1, f['C'] = 2, f['U'] = 3, st[0] = 1;
    for(int i = 1; i < MAXN; i++) st[i] = (st[i-1]*5 >= MOD ? (st[i-1]*5)%MOD : st[i-1]*5);
    for(int i = 1; i <= N; i++) {
        scanf("%s", S);
        int lenS = strlen(S);
        reverse(S, S+lenS);
        hashuj1(S, hsh, lenS);
        celi[hsh[lenS-1]]++;
        hashuj(S, hsh, lenS);
        reverse(S, S+lenS);
        ubaci(S, lenS);
    }
    int kol = hshidx;
    DFS(0);
    for(int q = 0; q < M; q++) {
        int rez = 0;
        scanf("%s%s", P, Q);
        int lenQ = strlen(Q), lenP = strlen(P);
        reverse(Q, Q+lenQ);
        hashuj1(Q, hsh, lenQ); key = cudo[hsh[lenQ-1]];
        int koji = query(P, lenP);
        if(key == 0 || koji == -1) {
            printf("0\n");
            return 0;
        }
        if(!sorted[key]) {
            for(int i = 0; i < sz(gde[key]); i++) gde[key][i] = idx[gde[key][i]];
            sort(all(gde[key]));
            sorted[key] = 1;
        }
        reverse(P, P+lenP);
        hashuj1(P, hsh1, lenP); hashuj1(Q, hsh, lenQ);
        for(int i = 0; i < lenQ; i++) {
            if(hsh[lenQ-1] - hsh[lenQ-2-i] == hsh1[i]*st[lenQ-i-1]) {
                lld cur = hsh1[lenP-1]*st[lenQ-i-1] + hsh[lenQ-2-i];
                rez += celi[cur];
            }
        }
        rez += upper_bound(all(gde[key]), idx[koji]+siz[koji]-1) - lower_bound(all(gde[key]), idx[koji]);
        printf("%d\n", rez);
    }
    return 0;
}

Compilation message

selling_rna.cpp: In function 'void ubaci(char*, int)':
selling_rna.cpp:30:25: warning: array subscript has type 'char' [-Wchar-subscripts]
         int c = f[s[idx]];
                         ^
selling_rna.cpp: In function 'int DFS(int)':
selling_rna.cpp:52:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^
selling_rna.cpp: In function 'void hashuj(char*, long long int*, int)':
selling_rna.cpp:56:32: warning: array subscript has type 'char' [-Wchar-subscripts]
         hsh[i] += st[i]*(f[s[i]]+1);
                                ^
selling_rna.cpp: In function 'void hashuj1(char*, long long int*, int)':
selling_rna.cpp:66:32: warning: array subscript has type 'char' [-Wchar-subscripts]
         hsh[i] += st[i]*(f[s[i]]+1);
                                ^
selling_rna.cpp: In function 'int query(char*, int)':
selling_rna.cpp:74:26: warning: array subscript has type 'char' [-Wchar-subscripts]
         int c = f[s[idxx]];
                          ^
selling_rna.cpp: In function 'int main()':
selling_rna.cpp:96:9: warning: unused variable 'kol' [-Wunused-variable]
     int kol = hshidx;
         ^~~
selling_rna.cpp:83:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     int N, M; scanf("%d%d", &N, &M);
               ~~~~~^~~~~~~~~~~~~~~~
selling_rna.cpp:87:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%s", S);
         ~~~~~^~~~~~~~~
selling_rna.cpp:100:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%s%s", P, Q);
         ~~~~~^~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 48120 KB Output is correct
2 Correct 42 ms 48120 KB Output is correct
3 Correct 41 ms 48120 KB Output is correct
4 Correct 41 ms 48120 KB Output is correct
5 Correct 42 ms 48248 KB Output is correct
6 Correct 41 ms 47960 KB Output is correct
7 Correct 41 ms 48168 KB Output is correct

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1559 ms 206680 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 48884 KB Output is correct
2 Correct 67 ms 49116 KB Output is correct
3 Correct 70 ms 49016 KB Output is correct
4 Correct 63 ms 48936 KB Output is correct
5 Correct 66 ms 49016 KB Output is correct
6 Correct 70 ms 49144 KB Output is correct

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 48120 KB Output is correct
2 Correct 42 ms 48120 KB Output is correct
3 Correct 41 ms 48120 KB Output is correct
4 Correct 41 ms 48120 KB Output is correct
5 Correct 42 ms 48248 KB Output is correct
6 Correct 41 ms 47960 KB Output is correct
7 Correct 41 ms 48168 KB Output is correct
8 Execution timed out 1559 ms 206680 KB Time limit exceeded
9 Halted 0 ms 0 KB -