Submission #100559

#	Time	Username	Problem	Language	Result	Execution time	Memory
100559		TAISA_	Matryoshka (JOI16_matryoshka)	C++14	51 / 100	13 ms	512 KiB

matryoshka

#include <bits/stdc++.h>
#define mp make_pair
#define all(vec) vec.begin(),vec.end()
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
const ll INF=1LL<<30;
const ll LINF=1LL<<60;
const double eps=1e-9;
const ll MOD=1000000007LL;
template<typename T>void chmin(T &a,T b){a=min(a,b);};
template<typename T>void chmax(T &a,T b){a=max(a,b);};
template<typename T>vector<T> make_v(size_t a){return vector<T>(a);}
template<typename T,typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));}
template<typename T,typename V>typename enable_if<is_class<T>::value==0>::type fill_v(T& t,const V& v){t=v;}
template<typename T,typename V>typename enable_if<is_class<T>::value!=0>::type fill_v(T& t,const V& v){for(auto &e:t)fill_v(e,v);};
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
int main(){
    int n,q;cin>>n>>q;if(q>2000||n>2000)return 0;
    vector<P> v(n);
    for(int i=0;i<n;i++){
        cin>>v[i].first>>v[i].second;
        v[i].second*=-1LL;
    }
    sort(all(v));
    reverse(all(v));
    for(int i=0;i<n;i++)v[i].second*=-1LL;
    vector<pair<P,int>> qs(q);
	vector<int> ans(q);
	for(int i=0;i<q;i++){
		cin>>qs[i].first.first>>qs[i].first.second;
		qs[i].second=i;
	}
	sort(all(qs));
    reverse(all(qs));
	int id=0;
	vector<ll> dp(n+10,LINF);
	for(int i=0;i<q;i++){
		ll a=qs[i].first.first,b=qs[i].first.second,idx=qs[i].second;
		while(id<n&&a<=v[id].first){
			*(upper_bound(all(dp),v[id].second))=v[id].second;
			id++;
		}
		ans[idx]=upper_bound(all(dp),b)-dp.begin();
    }
	for(int i=0;i<q;i++)cout<<ans[i]<<endl;
}

• Subtask 1: 11 / 11
• Subtask 2: 15 / 15
• Subtask 3: 25 / 25
• Subtask 4: 0 / 49