oj.uz

Submission #876249

# Submission time Handle Problem Language Result Execution time Memory
876249 2023-11-21T13:14:55 Z Nurislam Selling RNA Strands (JOI16_selling_rna) C++14
60 / 100
 1500 ms 8544 KB 
#include <bits/stdc++.h>
using namespace std;
/*
<<<<It's never too late for a new beginning in your life>>>>
Today is hard
  tomorrow will worse
  but the day after tomorrow will be the sunshine..
 
HARD WORK BEATS TALENT WHEN TALENT DOESN'T WORK HARD............
Never give up  */
 
//The most CHALISHKANCHIK
#define int long long int
map<pair<string, string> , int> mp;
void solve(){
	int n, m;
	cin >> n >> m;
	if(n*m <= 2e8){
		vector<string> v;
		for(int i = 0; i < n; i++){
			string s;
			cin >> s;
			v.push_back(s);
		}
		for(int i = 0; i < m; i++){
			string a, b;
			cin >> a >> b;
			int ans = 0;
			for(int j = 0; j < n; j++){
				if(v[j].size() < a.size() || v[j].size() < b.size())continue;
				if(v[j].substr(0, a.size()) == a && v[j].substr(v[j].size()-b.size()) == b)ans++;
			}
			cout << ans << '\n';
		}
	}
	else {
		for(int i = 0; i < n; i++){
			string s;
			cin >> s;
			for(int k = 0; k < (int)s.size(); k++){
				for(int j = 0; j < (int)s.size(); j++){
					string s1 = s.substr(0, k+1), s2 = s.substr(j);
					mp[{s1, s2}]++;
				}
			}
		}
		for(int i = 0; i < m; i++){
			string a, b;
			cin >> a >> b;
			cout << mp[{a,b}] << '\n';	
		}
	}
}
main(){
	ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
	int t = 1;
	//~ cin >> t;
	while(t--){
		solve();
	}
}

Compilation message

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

Subtask #1
10.0 / 10.0

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

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 130 ms 6400 KB Output is correct
2 Correct 586 ms 6532 KB Output is correct
3 Correct 181 ms 6320 KB Output is correct
4 Correct 237 ms 6524 KB Output is correct
5 Correct 527 ms 4496 KB Output is correct
6 Correct 539 ms 4384 KB Output is correct
7 Correct 421 ms 7496 KB Output is correct
8 Correct 1041 ms 8544 KB Output is correct
9 Correct 899 ms 8280 KB Output is correct
10 Correct 1475 ms 6000 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 604 KB Output is correct
2 Correct 232 ms 6632 KB Output is correct
3 Correct 165 ms 3156 KB Output is correct
4 Correct 40 ms 456 KB Output is correct
5 Correct 201 ms 6484 KB Output is correct
6 Correct 146 ms 3152 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 352 KB Output is correct
6 Correct 1 ms 352 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 130 ms 6400 KB Output is correct
9 Correct 586 ms 6532 KB Output is correct
10 Correct 181 ms 6320 KB Output is correct
11 Correct 237 ms 6524 KB Output is correct
12 Correct 527 ms 4496 KB Output is correct
13 Correct 539 ms 4384 KB Output is correct
14 Correct 421 ms 7496 KB Output is correct
15 Correct 1041 ms 8544 KB Output is correct
16 Correct 899 ms 8280 KB Output is correct
17 Correct 1475 ms 6000 KB Output is correct
18 Correct 28 ms 604 KB Output is correct
19 Correct 232 ms 6632 KB Output is correct
20 Correct 165 ms 3156 KB Output is correct
21 Correct 40 ms 456 KB Output is correct
22 Correct 201 ms 6484 KB Output is correct
23 Correct 146 ms 3152 KB Output is correct
24 Execution timed out 1531 ms 5804 KB Time limit exceeded
25 Halted 0 ms 0 KB -