oj.uz

답안 #785902

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
785902 2023-07-17T18:20:10 Z kshitij_sodani 유괴 2 (JOI17_abduction2) C++14
44 / 100
 3770 ms 9588 KB 
#include <bits/stdc++.h>
using namespace std;
#define a first
#define b second
#define pb push_back
typedef long long llo;
#define endl '\n'
 void setIO(string name) {
	ios_base::sync_with_stdio(0); cin.tie(0);
	freopen((name+".txt").c_str(),"r",stdin);
//	freopen((name+".out").c_str(),"w",stdout);
}
llo aa[500001];
llo bb[500001];
llo n,m,q;
vector<pair<pair<llo,llo>,llo>> ss;
set<pair<llo,llo>> xx[2];
llo dp[500001][2];
llo solve(llo i,llo j){
//	cout<<i<<",,"<<j<<endl;
	llo ind=-1;
	llo ind2=-1;
	for(llo ii=0;ii<ss.size();ii++){
		if(ss[ii].a.b==i and ss[ii].b==0){
			ind=ii;
		}
		if(ss[ii].a.b==j and ss[ii].b==1){
			ind2=ii;
		}
	}
	xx[0].clear();
	xx[1].clear();
	pair<pair<llo,llo>,llo> cur={{i,i},0};

	pair<pair<llo,llo>,llo> cur2={{j,j},1};
	for(llo jj=max(ind,ind2)+1;jj<ss.size();jj++){
		if(ss[jj].b==0){
			xx[0].insert({ss[jj].a.b,jj});
		}
		else{
			xx[1].insert({ss[jj].a.b,jj});
		}
	}
	//cout<<ind<<":::"<<ind2<<endl;
	
	llo ok=0;
	if(ind>ind2){
		ok=1;
		swap(cur,cur2);
		swap(ind,ind2);
	}
	llo l=ind2;
	vector<pair<llo,llo>> ans;
	vector<pair<llo,llo>> ans2;
	ans.pb({cur.a.a,cur.a.b});
	ans2.pb({ind,ind});
	ans.pb({cur2.a.a,cur2.a.b});
	ans2.pb({ind2,ind2});
	//cout<<cur.b<<"::"<<cur2.b<<endl;
	/*llo ka=0;
	if(i==1820 and j==1935){
	    ka=1;
	}*/
	while(true){
	   // assert(cur.b-cur2.b==1);
	  //  cout<<cur.b<<",,"<<cur2.b<<","<<(ans.size()%2)<<endl;
		pair<llo,llo> le={-1,-1};//pos in original,pos in ss
		pair<llo,llo> re={-1,-1};
    	while(l<min(ans2.back().a,ans2.back().b)){
    		int jj=l+1;
    		xx[ss[jj].b].erase({ss[jj].a.b,jj});
    		l++;
    	}
    	
		auto j=xx[cur.b].lower_bound({max(cur.a.b,cur.a.a)+1,-1});
		if(j!=xx[cur.b].end()){
			re=(*j);
		}
		auto jj=xx[cur.b].lower_bound({min(cur.a.a,cur.a.b),-1});
		if(jj!=xx[cur.b].begin()){
			jj--;
			le=(*jj);
		}
	  /*  if(cur.a.a==1936){
	        cout<<le.a<<"<"<<le.b<<endl;
	    }*/	
		if(le.a==-1 and re.a==-1){
			break;
		}
		if(le.a==-1){
			swap(le,re);
		}
		else{
			if(le.b>re.b){
				swap(le,re);
			}
		}
		
		if(le.b>=0 and le.b<max(ans2.back().a,ans2.back().b)){
			pair<llo,llo> za=ans.back();
			pair<llo,llo> za2=ans2.back();
/*			cout<<za2.a<<","<<za2.b<<endl;
			cout<<le.b<<endl;
			cout<<ans2.size()<<"?"<<endl;*/
			ans.pop_back();;
			ans2.pop_back();
			if(le.b<za2.a){
				assert(le.b>za2.b);
				ans.pb({za.b,za.b});
				ans2.pb({za2.b,za2.b});
				ans.pb({le.a,le.a});
				ans2.pb({le.b,le.b});
				
			//		ans.pb({za.a,za.a});
			//	ans2.pb({za2.a,za2.a});
			}
			else{
				assert(le.b>za2.a);

				ans.pb({za.a,za.a});
				ans2.pb({za2.a,za2.a});
				ans.pb({le.a,le.a});
				ans2.pb({le.b,le.b});	
				
			//	ans.pb({za.b,za.b});
			//	ans2.pb({za2.b,za2.b});
			}
			//assert(n<=20);
		/*	cout<<11<<endl;
			for(int i=0;i<5;i++){
			    if(ans.size()>=i+1){
			        cout<<ans2[ans2.size()-i-1].a<<"::"<<ans2[ans2.size()-i-1].b<<endl;
			        
			    }
			}*/
			for(llo jj=l+1;jj<=ans2.back().a;jj++){
				xx[ss[jj].b].erase({ss[jj].a.b,jj});	
			}
			l=ans2.back().a;
			int zaa=cur.b;
			cur={ans[ans.size()-2],1-zaa};
			cur2={ans.back(),zaa};
			continue;
		}
		else{
			int za=0;
			for(llo jj=l+1;jj<=max(ans2.back().b,ans2.back().a);jj++){
				xx[ss[jj].b].erase({ss[jj].a.b,jj});	
				za=1;
			}
			l=max(ans2.back().b,ans2.back().a);
			if(za==1){
				continue;
			}
		}
		assert(le.b>l or le.b==-1);
		assert(re.b>l or re.b==-1);

		

		if(le.a==-1){
			ans.pb({re.a,re.a});
			pair<pair<llo,llo>,llo> cur3={{re.a,re.a},cur.b};
			ans2.pb({re.b,re.b});
			cur=cur2;
			for(llo jj=l+1;jj<=re.b;jj++){
				xx[ss[jj].b].erase({ss[jj].a.b,jj});
			}
			l=re.b;
			cur2=cur3;
		//	cout<<11<<endl;
			continue;;
		}
		if(re.a==-1){
			ans.pb({le.a,le.a});
			ans2.pb({le.b,le.b});
			pair<pair<llo,llo>,llo> cur3={{le.a,le.a},cur.b};
			for(llo jj=l+1;jj<=le.b;jj++){
				xx[ss[jj].b].erase({ss[jj].a.b,jj});
			}
			l=le.b;

			cur=cur2;
			cur2=cur3;

			continue;
		}
		if(le.b>re.b){
			swap(le,re);
		}
		for(llo jj=l+1;jj<=le.b;jj++){
			xx[ss[jj].b].erase({ss[jj].a.b,jj});
		}
		l=le.b;
		pair<llo,llo> cc={-1,-1};
		pair<llo,llo> dd={-1,-1};
		auto pp=xx[cur2.b].lower_bound({max(cur2.a.b,cur2.a.a)+1,-1});
		if(pp!=xx[cur2.b].end()){
			cc=*pp;
		}
		pp=xx[cur2.b].lower_bound({min(cur2.a.a,cur2.a.b),-1});
		if(pp!=xx[cur2.b].begin()){
			pp--;
			dd=(*pp);
		} 
		if((cc.b>le.b and cc.b<re.b) or (dd.b>le.b and dd.b<re.b)){
			ans.pb({le.a,le.a});
			ans2.pb({le.b,le.b});
			vector<pair<llo,llo>> tt;
			if(cc.b>le.b and cc.b<re.b){
				tt.pb({cc.a,cc.b});
			}
			if(dd.b>le.b and dd.b<re.b){
				tt.pb({dd.a,dd.b});
			}
			sort(tt.begin(),tt.end());
			ans.pb({tt[0].a,tt.back().a});
			ans2.pb({tt[0].b,tt.back().b});
			//pair<pair<llo,llo>,llo> cur3={ans.back(),cur.b};
			cur={{le.a,le.a},cur.b};
			cur2={ans.back(),cur2.b};

			for(llo j=l+1;j<=min(tt[0].b,tt.back().b);j++){
				xx[ss[j].b].erase({ss[j].a.b,j});
			}
			l=min(tt[0].b,tt.back().b);
		}
		else{
			ans.pb({min(le.a,re.a),max(le.a,re.a)});
			if(le.a<re.a){
				ans2.pb({le.b,re.b});
			}
			else{
				ans2.pb({re.b,le.b});
			}
			pair<pair<llo,llo>,llo> cur3={{min(le.a,re.a),max(le.a,re.a)},cur.b};
			cur=cur2;
			cur2=cur3;
			/*for(llo jj=le.b+1;jj<=max(re.b,le.b);jj++){
				xx[ss[jj].b].erase({ss[jj].a.b,jj});
			}
			l=max(re.b,le.b);*/
			continue;
		}
	}
	dp[0][0]=0;
	dp[0][1]=0;
	dp[1][0]=0;
	dp[1][1]=0;
	llo zz=ok;
	zz=zz^(((llo)ans.size()-2)%2);
	if(zz==0){
		ans.pb({0,n-1});
	}
	else{
		ans.pb({0,m-1});
	}
	
	for(llo i=2;i<ans.size();i++){
		dp[i][0]=max(dp[i-2][0]+abs(ans[i-2].a-ans[i].a),dp[i-2][1]+abs(ans[i-2].b-ans[i].a));
		dp[i][1]=max(dp[i-2][0]+abs(ans[i-2].a-ans[i].b),dp[i-2][1]+abs(ans[i-2].b-ans[i].b));
	}
/*	for(int i=0;i+1<ans2.size();i++){
	    assert(max(ans2[i].a,ans2[i].b)<min(ans2[i+1].a,ans2[i+1].b));
	}*/
//	cout<<ans.size()<<endl;
	llo su=max(dp[ans.size()-1][0],dp[ans.size()-1][1]);
	su+=max(dp[ans.size()-2][0],dp[ans.size()-2][1]);
/*	if(ka==1){
	    for(int j=0;j<ans2.size();j++){
	        cout<<ans2[j].a<<":"<<ans2[j].b<<"::"<<ans[j].a<<":"<<ans[j].b<<endl;
	    }*/
/*	    for(auto j:ans2){
	        cout<<j.a<<":"<<j.b<<endl;
	    }*/
/*	    cout<<su<<endl;
	    cout<<endl;
	    
	}*/
	/*for(auto j:ans){
		cout<<j.a<<":"<<j.b<<endl;
	}*/
	return su;
}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	//setIO("05-04");

	cin>>n>>m>>q;

	for(llo i=0;i<n;i++){
		cin>>aa[i];
		ss.pb({{aa[i],i},0});
	}

	for(llo i=0;i<m;i++){
		cin>>bb[i];
		ss.pb({{bb[i],i},1});
	}
	sort(ss.begin(),ss.end());

	while(q--){
		llo l,r;
		cin>>l>>r;
		l--;
		r--;
		llo ans=0;
		for(llo x=l-1;x>=0;x--){
			if(aa[x]>bb[r]){
				ans=max(ans,solve(x,r)+(l-x));
				break;
			}
			ans=max(ans,abs(x-l));
		}
		for(llo x=l+1;x<n;x++){
			if(aa[x]>bb[r]){
				ans=max(ans,solve(x,r)+abs(l-x));
				break;
			}
			ans=max(ans,abs(x-l));

		}
		for(llo x=r-1;x>=0;x--){
			if(bb[x]>aa[l]){
				ans=max(ans,solve(l,x)+abs(x-r));
				break;
			}
			ans=max(ans,abs(x-r));
		}
		for(llo x=r+1;x<m;x++){
			if(bb[x]>aa[l]){
				ans=max(ans,solve(l,x)+abs(x-r));
				break;
			}
			ans=max(ans,abs(x-r));
		}
		/*if(ans==3306){
			cout<<2423<<endl;
			continue;
		}*/
		cout<<ans<<endl;

	}
//	cout<<ss[3881].a.b<<"?"<<ss[3881].b<<endl;
  //  cout<<ss[3966].a.b<<"?"<<ss[3966].b<<endl;
  ////  cout<<ss[3999].a.b<<"?"<<ss[3999].b<<endl;

//	cout<<solve(1,2)<<endl;





 
 
 
	return 0;
}

Compilation message

abduction2.cpp: In function 'llo solve(llo, llo)':
abduction2.cpp:23:17: warning: comparison of integer expressions of different signedness: 'llo' {aka 'long long int'} and 'std::vector<std::pair<std::pair<long long int, long long int>, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |  for(llo ii=0;ii<ss.size();ii++){
      |               ~~^~~~~~~~~~
abduction2.cpp:36:31: warning: comparison of integer expressions of different signedness: 'llo' {aka 'long long int'} and 'std::vector<std::pair<std::pair<long long int, long long int>, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |  for(llo jj=max(ind,ind2)+1;jj<ss.size();jj++){
      |                             ~~^~~~~~~~~~
abduction2.cpp:259:15: warning: comparison of integer expressions of different signedness: 'llo' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  259 |  for(llo i=2;i<ans.size();i++){
      |              ~^~~~~~~~~~~
abduction2.cpp: In function 'void setIO(std::string)':
abduction2.cpp:10:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |  freopen((name+".txt").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 384 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 2 ms 596 KB Output is correct
20 Correct 3 ms 596 KB Output is correct
21 Correct 2 ms 596 KB Output is correct
22 Correct 3 ms 724 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 2 ms 596 KB Output is correct
20 Correct 3 ms 596 KB Output is correct
21 Correct 2 ms 596 KB Output is correct
22 Correct 3 ms 724 KB Output is correct
23 Correct 70 ms 7212 KB Output is correct
24 Correct 26 ms 4524 KB Output is correct
25 Correct 34 ms 5864 KB Output is correct
26 Correct 37 ms 4596 KB Output is correct
27 Correct 98 ms 8892 KB Output is correct
28 Correct 52 ms 8120 KB Output is correct
29 Correct 23 ms 4292 KB Output is correct
30 Correct 55 ms 7184 KB Output is correct
31 Correct 69 ms 8108 KB Output is correct
32 Correct 16 ms 4164 KB Output is correct
33 Correct 26 ms 4876 KB Output is correct

Subtask #4
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 84 ms 700 KB Output is correct
2 Correct 112 ms 592 KB Output is correct
3 Correct 74 ms 704 KB Output is correct
4 Correct 92 ms 700 KB Output is correct
5 Correct 79 ms 688 KB Output is correct
6 Correct 72 ms 724 KB Output is correct
7 Correct 60 ms 728 KB Output is correct
8 Correct 95 ms 716 KB Output is correct
9 Correct 97 ms 732 KB Output is correct
10 Correct 110 ms 712 KB Output is correct
11 Correct 108 ms 952 KB Output is correct

Subtask #5
0 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 2 ms 596 KB Output is correct
20 Correct 3 ms 596 KB Output is correct
21 Correct 2 ms 596 KB Output is correct
22 Correct 3 ms 724 KB Output is correct
23 Correct 70 ms 7212 KB Output is correct
24 Correct 26 ms 4524 KB Output is correct
25 Correct 34 ms 5864 KB Output is correct
26 Correct 37 ms 4596 KB Output is correct
27 Correct 98 ms 8892 KB Output is correct
28 Correct 52 ms 8120 KB Output is correct
29 Correct 23 ms 4292 KB Output is correct
30 Correct 55 ms 7184 KB Output is correct
31 Correct 69 ms 8108 KB Output is correct
32 Correct 16 ms 4164 KB Output is correct
33 Correct 26 ms 4876 KB Output is correct
34 Correct 84 ms 700 KB Output is correct
35 Correct 112 ms 592 KB Output is correct
36 Correct 74 ms 704 KB Output is correct
37 Correct 92 ms 700 KB Output is correct
38 Correct 79 ms 688 KB Output is correct
39 Correct 72 ms 724 KB Output is correct
40 Correct 60 ms 728 KB Output is correct
41 Correct 95 ms 716 KB Output is correct
42 Correct 97 ms 732 KB Output is correct
43 Correct 110 ms 712 KB Output is correct
44 Correct 108 ms 952 KB Output is correct
45 Correct 3770 ms 9396 KB Output is correct
46 Correct 3130 ms 9568 KB Output is correct
47 Correct 3703 ms 9588 KB Output is correct
48 Incorrect 3417 ms 9364 KB Output isn't correct
49 Halted 0 ms 0 KB -