oj.uz

Submission #875807

# Submission time Handle Problem Language Result Execution time Memory
875807 2023-11-20T14:02:39 Z resfast Selling RNA Strands (JOI16_selling_rna) C++14
35 / 100
 1500 ms 8780 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;
/*
talent is important,
as is the work we have to
do to achieve your goals... <Sorry, looks like I won't be able to go to the moon>©ciberpank

ok,enough quotes it's time to get to work
*/
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;
	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;
	}

}
main(){
//    ios;
    int T = 1;
//	    cin >> T;
    while(T--){
        solve();
    }
}

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 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
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 182 ms 3164 KB Output is correct
2 Correct 652 ms 4888 KB Output is correct
3 Correct 252 ms 7296 KB Output is correct
4 Correct 309 ms 7248 KB Output is correct
5 Correct 545 ms 4656 KB Output is correct
6 Correct 667 ms 4820 KB Output is correct
7 Correct 498 ms 8220 KB Output is correct
8 Correct 1098 ms 8776 KB Output is correct
9 Correct 1008 ms 8780 KB Output is correct
10 Correct 1441 ms 6620 KB Output is correct

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1527 ms 2004 KB Time limit exceeded
2 Halted 0 ms 0 KB -

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 182 ms 3164 KB Output is correct
9 Correct 652 ms 4888 KB Output is correct
10 Correct 252 ms 7296 KB Output is correct
11 Correct 309 ms 7248 KB Output is correct
12 Correct 545 ms 4656 KB Output is correct
13 Correct 667 ms 4820 KB Output is correct
14 Correct 498 ms 8220 KB Output is correct
15 Correct 1098 ms 8776 KB Output is correct
16 Correct 1008 ms 8780 KB Output is correct
17 Correct 1441 ms 6620 KB Output is correct
18 Execution timed out 1527 ms 2004 KB Time limit exceeded
19 Halted 0 ms 0 KB -