oj.uz

답안 #38139

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
38139 2018-01-02T04:23:56 Z funcsr Selling RNA Strands (JOI16_selling_rna) C++14
0 / 100
 1500 ms 38328 KB 
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <cassert>
#include <algorithm>
#define rep(i,n) for (int i=0; i<(n); i++)
#define all(x) x.begin(), x.end()
#define pb push_back
#define _1 first
#define _2 second
using namespace std;
typedef pair<int, int> P;

string convert(string s) {
  string o = "";
  for (char c : s) {
    if (c == 'A') o += 'a';
    else if (c == 'G') o += 'b';
    else if (c == 'C') o += 'c';
    else o += 'd';
  }
  return o;
}
string read() {
  string s;
  cin >> s;
  return convert(s);
}

vector<int> radixSort(int p, vector<int> all, string *src) {
  vector<int> s[4] = {};
  vector<int> ret;
  for (int x : all) {
    if (src[x].size() == p) ret.pb(x);
    else s[src[x][p]-'a'].pb(x);
  }
  rep(k, 4) if (!s[k].empty()) {
    vector<int> r = radixSort(p+1, s[k], src);
    ret.insert(ret.end(), all(r));
  }
  return ret;
}

struct Trie {
  int val;
  Trie *ch[4];
  Trie() : val(0) {
    rep(k, 4) ch[k] = NULL;
  }
  int find(const char *s) {
    if (*s == '\0') return val;
    int k = *s-'a';
    if (ch[k] == NULL) return 0;
    return ch[k]->find(s+1);
  }
  void add(const char *s) {
    if (*s == '\0') {
      val++;
      return;
    }
    val++;
    int k = *s-'a';
    if (ch[k] == NULL) ch[k] = new Trie();
    ch[k]->add(s+1);
  }
  void destroy() {
    rep(k, 4) if (ch[k]) {
      ch[k]->destroy();
      delete ch[k];
    }
  }
};
struct Bucket {
  vector<string> str;
  Trie *trie;
  Bucket() {
    trie = new Trie();
  }
  void add(string s) {
    str.pb(s);
    trie->add(s.c_str());
  }
  void destroy() {
    str.clear();
    trie->destroy();
    delete trie;
  }
};

int N, Q;
string S[100000], Srev[100000];
string Qpre[100000], Qsuf[100000];
Bucket data[200000];
int ans[100000];

bool is_prefix_of(const string &S, const string &T) {
  if (T.size() > S.size()) return false;
  rep(i, T.size()) if (T[i] != S[i]) return false;
  return true;
}

int main() {
  cin >> N >> Q;
  rep(i, N) {
    S[i] = read();
    Srev[i] = string(S[i]);
    reverse(all(Srev[i]));
  }
  rep(i, Q) Qpre[i] = read(), Qsuf[i] = read();
  rep(i, Q) {
    int s = 0;
    rep(j, N) {
      if (is_prefix_of(S[j], Qpre[i]) && is_prefix_of(Srev[j], Qsuf[i])) s++;
    }
    cout << s << "\n";
  }
  return 0;
}

Compilation message

selling_rna.cpp: In function 'std::vector<int> radixSort(int, std::vector<int>, std::__cxx11::string*)':
selling_rna.cpp:36:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if (src[x].size() == p) ret.pb(x);
                       ^
selling_rna.cpp: In function 'bool is_prefix_of(const string&, const string&)':
selling_rna.cpp:8:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define rep(i,n) for (int i=0; i<(n); i++)
                                 ^
selling_rna.cpp:100:3: note: in expansion of macro 'rep'
   rep(i, T.size()) if (T[i] != S[i]) return false;
   ^

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 9 ms 30532 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1086 ms 38328 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1500 ms 30532 KB Execution timed out
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 9 ms 30532 KB Output isn't correct
2 Halted 0 ms 0 KB -