Submission #1002352

#	Time	Username	Problem	Language	Result	Execution time	Memory
1002352		nmts	Selling RNA Strands (JOI16_selling_rna)	C++17	0 / 100	1266 ms	1048576 KiB

selling_rna

#include <bits/stdc++.h>
using namespace std;

unordered_map<string, int> prefix_count, suffix_count;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int N, M;
    cin >> N >> M;

    vector<string> RNA(N);
    for (int i = 0; i < N; ++i) {
        cin >> RNA[i];
    }

    vector<pair<string, string>> orders(M);
    for (int j = 0; j < M; ++j) {
        cin >> orders[j].first >> orders[j].second;
    }

    // Count the prefix and suffix occurrences
    for (const string& s : RNA) {
        for (int len = 1; len <= s.size(); ++len) {
            prefix_count[s.substr(0, len)]++;
            suffix_count[s.substr(s.size() - len, len)]++;
        }
    }

    // Process each order
    for (const auto& order : orders) {
        const string& P = order.first;
        const string& Q = order.second;

        int prefixCount = prefix_count[P];
        int suffixCount = suffix_count[Q];

        cout << min(prefixCount, suffixCount) << '\n';
    }

    return 0;
}

Compilation message (stderr)

selling_rna.cpp: In function 'int main()':
selling_rna.cpp:25:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |         for (int len = 1; len <= s.size(); ++len) {
      |                           ~~~~^~~~~~~~~~~

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