제출 #241192

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
241192		kshitij_sodani	Selling RNA Strands (JOI16_selling_rna)	C++17	100 / 100	997 ms	130788 KiB

selling_rna

#include <bits/stdc++.h>
using namespace std;
typedef int64_t llo;
#define mp make_pair
#define pb push_back
#define a first 
#define b second
//#define endl '\n'
int n,m;
string aa[100001];
vector<string> tree[400001];
void build(int no,int l,int r){
	if(l==r){
		tree[no].pb("");
		for(int i=(int)(aa[l].size())-1;i>=0;i--){
			tree[no][0]+=aa[l][i];
		}
		//tree[no].pb(aa[l]);
	}
	else{
		int mid=(l+r)/2;
		build(no*2+1,l,mid);
		build(no*2+2,mid+1,r);
		int ind=0;
		int ind2=0;
		while(ind<tree[no*2+1].size() and ind2<tree[no*2+2].size()){
			if(tree[no*2+1][ind]<tree[no*2+2][ind2]){
				tree[no].pb(tree[no*2+1][ind]);
				ind+=1;
			}
			else{
				tree[no].pb(tree[no*2+2][ind2]);
				ind2+=1;
			}
		}
		while(ind<tree[no*2+1].size()){
			tree[no].pb(tree[no*2+1][ind]);
			ind+=1;
		}
		while(ind2<tree[no*2+2].size()){
			tree[no].pb(tree[no*2+2][ind2]);
			ind2+=1;
		}
	}
}
string cur;
string cur2;
int query(int no,int l,int r,int aa,int bb){
	if(r<aa or l>bb or aa>bb){
		return 0;
	}
	if(aa<=l and r<=bb){
		int x=lower_bound(tree[no].begin(),tree[no].end(),cur2)-tree[no].begin()-1;
		x-=lower_bound(tree[no].begin(),tree[no].end(),cur)-tree[no].begin();
		return x+1;
	}
	else{
		int mid=(l+r)/2;
		return query(no*2+1,l,mid,aa,bb)+query(no*2+2,mid+1,r,aa,bb);
	}

}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin>>n>>m;
	for(int i=0;i<n;i++){
		cin>>aa[i];
	}
	sort(aa,aa+n);
	build(0,0,n-1);

	while(m--){
		string s,tt;
		cin>>s>>tt;
		int x=lower_bound(aa,aa+n,s)-aa;
		string ss;
		ss=s;
		ss[ss.size()-1]++;
		int y=lower_bound(aa,aa+n,ss)-aa-1;
		string t="";
		for(int i=(int)(tt.size())-1;i>=0;i--){
			t+=tt[i];
		}
		cur=t;
		cur2=t;
		cur2[cur2.size()-1]++;
	//	cout<<x<<','<<y<<endl;
		cout<<query(0,0,n-1,x,y)<<'\n';
	}







	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

selling_rna.cpp: In function 'void build(int, int, int)':
selling_rna.cpp:26:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(ind<tree[no*2+1].size() and ind2<tree[no*2+2].size()){
         ~~~^~~~~~~~~~~~~~~~~~~~
selling_rna.cpp:26:41: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(ind<tree[no*2+1].size() and ind2<tree[no*2+2].size()){
                                     ~~~~^~~~~~~~~~~~~~~~~~~~
selling_rna.cpp:36:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(ind<tree[no*2+1].size()){
         ~~~^~~~~~~~~~~~~~~~~~~~
selling_rna.cpp:40:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(ind2<tree[no*2+2].size()){
         ~~~~^~~~~~~~~~~~~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 25 / 25
• Subtask 3: 25 / 25
• Subtask 4: 40 / 40