제출 #856972

#제출 시각아이디문제언어결과실행 시간메모리
856972TS_2392Selling RNA Strands (JOI16_selling_rna)C++14
100 / 100
164 ms205904 KiB
#include <bits/stdc++.h> using namespace std; #define fileIO(name) if(fopen(name".inp", "r")) {freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout);} #define SPEED ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0) #define all(a) a.begin(), a.end() #define lwb lower_bound #define upb upper_bound #define sz(a) (int) a.size() #define eb emplace_back const int N = 2e6 + 10; vector <int> through[N]; int trie[2][4][N], L[N], R[N]; int n, m, trie_sz[2]; string s[N], DNA = "ACGT"; int trans(char c){ if (c == 'A') return 0; if (c == 'U') return 1; if (c == 'G') return 2; if (c == 'C') return 3; } void add_str(string & s, int j, int t, bool r = 0){ int v = 1; for (int i = 0; i < sz(s); i++){ char u = s[r ? sz(s) - 1 - i : i]; int c = trans(u); if (!trie[t][c][v]) trie[t][c][v] = trie_sz[t]++; v = trie[t][c][v]; if (t == 0){ if (L[v] == 0) L[v] = j; R[v] = max(R[v], j); } else through[v].eb(j); } } int query(string & s, int t, bool r = 0){ int v = 1; for (int i = 0; i < sz(s); i++) { char u = s[r ? sz(s) - 1 - i : i]; int c = trans(u); v = trie[t][c][v]; if (!v) return 0; } return v; } int main(){ SPEED; cin >> n >> m; trie_sz[0] = trie_sz[1] = 2; for (int i = 0; i < n; i++) cin >> s[i]; sort(s, s + n); for (int i = 0; i < n; i++){ add_str(s[i], i + 1, 0); add_str(s[i], i + 1, 1, 1); } for (int i = 0; i < m; i++){ string s, t; cin >> s >> t; int I = query(s, 0), I2 = query(t, 1, 1); int p1 = lwb(all(through[I2]), L[I]) - through[I2].begin(); int p2 = upb(all(through[I2]), R[I]) - through[I2].begin(); cout << max(0, p2 - p1) << '\n'; } return 0; }

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

selling_rna.cpp: In function 'int trans(char)':
selling_rna.cpp:23:1: warning: control reaches end of non-void function [-Wreturn-type]
   23 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...