oj.uz

Submission #875823

# Submission time Handle Problem Language Result Execution time Memory
875823 2023-11-20T14:47:45 Z resfast Selling RNA Strands (JOI16_selling_rna) C++14
35 / 100
 1500 ms 2924 KB 
#include <bits/stdc++.h>
using namespace std;

#define islam_zymchybekov void solve()
#define ios ios::sync_with_stdio(false); cin.tie(NULL);
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fr first
#define sc second
#define YES cout<<"YES"<<endl;
#define NO cout<<"NO"<<endl;
#define endl '\n'
#define nl cout<<'\n';
#define int long long
#define stg string
#define yes cout<<"Yes\n";
#define no cout<<"No\n";
typedef vector<int> vi;
typedef pair<int,int> pi;
int c,n,m,i,j,k,x,y,cnt=0,res=0,l=0,mx=-1,sum=0,nx=-1;
islam_zymchybekov{
    string s, s1;
    cin >> n >> m;
    unordered_map<string, int> mp;

    for (int i = 0; i < n; i++) {
        cin >> s;
        mp[s]++;
    }

    for (int i = 0; i < m; i++) {
        cin >> s >> s1;
        int ans = 0;
        int len_s = s.size();
        int len_s1 = s1.size();

        for (auto &it : mp) {
            string curr = it.first;
            int len_curr = curr.size();
            
            if (len_curr >= max(len_s, len_s1)) {
                if (curr.substr(0, len_s) == s && curr.substr(len_curr - len_s1) == s1) {
                    ans += it.second;
                }
            }
        }
        cout << ans; nl;
    }
}

main(){
    int T = 1;
    while(T--){
        solve();
    }
    return 0;
}

Compilation message

selling_rna.cpp:52:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   52 | main(){
      | ^~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 414 ms 2644 KB Output is correct
2 Correct 1447 ms 2836 KB Output is correct
3 Correct 1010 ms 2924 KB Output is correct
4 Correct 1202 ms 2648 KB Output is correct
5 Correct 1375 ms 2132 KB Output is correct
6 Correct 1378 ms 2356 KB Output is correct
7 Correct 1002 ms 2364 KB Output is correct
8 Execution timed out 1562 ms 2744 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 592 KB Output is correct
2 Correct 831 ms 560 KB Output is correct
3 Correct 755 ms 488 KB Output is correct
4 Correct 58 ms 344 KB Output is correct
5 Correct 599 ms 596 KB Output is correct
6 Correct 595 ms 592 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 414 ms 2644 KB Output is correct
9 Correct 1447 ms 2836 KB Output is correct
10 Correct 1010 ms 2924 KB Output is correct
11 Correct 1202 ms 2648 KB Output is correct
12 Correct 1375 ms 2132 KB Output is correct
13 Correct 1378 ms 2356 KB Output is correct
14 Correct 1002 ms 2364 KB Output is correct
15 Execution timed out 1562 ms 2744 KB Time limit exceeded
16 Halted 0 ms 0 KB -