oj.uz

Submission #876246

# Submission time Handle Problem Language Result Execution time Memory
876246 2023-11-21T13:14:16 Z Nurislam Selling RNA Strands (JOI16_selling_rna) C++14
35 / 100
 1246 ms 1048576 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 <= 10000000){
		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 1 ms 344 KB Output is correct
2 Correct 0 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 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 128 ms 2392 KB Output is correct
2 Runtime error 1246 ms 1048576 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 1104 KB Output is correct
2 Correct 228 ms 6920 KB Output is correct
3 Correct 153 ms 3660 KB Output is correct
4 Correct 40 ms 848 KB Output is correct
5 Correct 199 ms 6756 KB Output is correct
6 Correct 143 ms 3668 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 0 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 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 128 ms 2392 KB Output is correct
9 Runtime error 1246 ms 1048576 KB Execution killed with signal 9
10 Halted 0 ms 0 KB -