oj.uz

Submission #876036

# Submission time Handle Problem Language Result Execution time Memory
876036 2023-11-21T06:37:03 Z resfast Selling RNA Strands (JOI16_selling_rna) C++17
35 / 100
 1500 ms 8788 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;
    if(n<5001){
    	vector<string>v(n);
	for(i=0;i<n;i++){
		cin>>v[i];
	}
	for(i=0;i<m;i++){
		cin>>s>>s1;
		int ans=0;
		for(j=0;j<n;j++){
			if(v[j].size()>=max(s.size(),s1.size())){
			if(v[j].substr(0,s.size())==s){
			if( v[j].substr(v[j].size()-s1.size())==s1){
			ans++;
			}	
			}	
			}
			
		}
		cout<<ans;nl;
	}
	}
	else{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:70:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   70 | main(){
      | ^~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 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 187 ms 7200 KB Output is correct
2 Correct 665 ms 7508 KB Output is correct
3 Correct 242 ms 7252 KB Output is correct
4 Correct 310 ms 7432 KB Output is correct
5 Correct 572 ms 4820 KB Output is correct
6 Correct 575 ms 4684 KB Output is correct
7 Correct 506 ms 8020 KB Output is correct
8 Correct 1100 ms 8788 KB Output is correct
9 Correct 991 ms 8788 KB Output is correct
10 Execution timed out 1517 ms 6336 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 1112 KB Output is correct
2 Correct 918 ms 860 KB Output is correct
3 Correct 853 ms 1108 KB Output is correct
4 Correct 58 ms 932 KB Output is correct
5 Correct 783 ms 1076 KB Output is correct
6 Correct 760 ms 1108 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 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 187 ms 7200 KB Output is correct
9 Correct 665 ms 7508 KB Output is correct
10 Correct 242 ms 7252 KB Output is correct
11 Correct 310 ms 7432 KB Output is correct
12 Correct 572 ms 4820 KB Output is correct
13 Correct 575 ms 4684 KB Output is correct
14 Correct 506 ms 8020 KB Output is correct
15 Correct 1100 ms 8788 KB Output is correct
16 Correct 991 ms 8788 KB Output is correct
17 Execution timed out 1517 ms 6336 KB Time limit exceeded
18 Halted 0 ms 0 KB -