oj.uz

답안 #875818

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
875818 2023-11-20T14:31:52 Z resfast Selling RNA Strands (JOI16_selling_rna) C++14
10 / 100
 1500 ms 3664 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<min(m,5000ll);i++){
		cin>>s>>s1;
		int ans=0;
		for(j=0;j<min(n,5000ll);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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 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 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

# 결과 실행 시간 메모리 Grader output
1 Correct 230 ms 3352 KB Output is correct
2 Correct 668 ms 3664 KB Output is correct
3 Correct 260 ms 3408 KB Output is correct
4 Correct 312 ms 3416 KB Output is correct
5 Correct 569 ms 2396 KB Output is correct
6 Correct 584 ms 2644 KB Output is correct
7 Correct 527 ms 3092 KB Output is correct
8 Correct 1151 ms 3020 KB Output is correct
9 Correct 968 ms 3272 KB Output is correct
10 Execution timed out 1526 ms 3144 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 470 ms 2012 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 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 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 230 ms 3352 KB Output is correct
9 Correct 668 ms 3664 KB Output is correct
10 Correct 260 ms 3408 KB Output is correct
11 Correct 312 ms 3416 KB Output is correct
12 Correct 569 ms 2396 KB Output is correct
13 Correct 584 ms 2644 KB Output is correct
14 Correct 527 ms 3092 KB Output is correct
15 Correct 1151 ms 3020 KB Output is correct
16 Correct 968 ms 3272 KB Output is correct
17 Execution timed out 1526 ms 3144 KB Time limit exceeded
18 Halted 0 ms 0 KB -