oj.uz

답안 #953774

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
953774 2024-03-26T15:55:49 Z amirhoseinfar1385 Passport (JOI23_passport) C++17
0 / 100
 52 ms 17492 KB 
#include<bits/stdc++.h>
using namespace std;
const int maxn=200000+10;
int n,q,vasps[maxn],vassuf[maxn],tedps[maxn],tedsuf[maxn],fasps[maxn],fassuf[maxn],vis[maxn];
pair<int,int>all[maxn];
vector<int>fps,fsuf;
pair<int,int>dp[maxn];
struct cmp {
    bool operator() (pair<int,int> a,pair<int,int> b) const {
  		if(a.first!=b.first){
  			return a.first<b.first;
  		}      
  		if(all[a.second].second!=all[b.second].second){
  			return all[a.second].second<all[b.second].second;
  		}
  		return a<b;
    }
};
set<pair<int,int>,cmp>st;

void upddij(pair<int,int>x){
	for(int i=1;i<=n;i++){
		if(vis[i]==1){
			continue;
		}
		if(all[i].first<=x.second&&all[i].second>=x.second){
			all[i].second=max(all[i].second,dp[x.second].second);
			st.insert(make_pair(x.first+1,i));
		}
	}
}

void dij(){
	for(int i=1;i<=n;i++){
		if(all[i].first==1){
			st.insert(make_pair(0,i));
			vis[i]=1;
		}
	}
	while((int)st.size()>0){
		auto x=*st.begin();
		st.erase(x);
		dp[x.first]=make_pair(x.first,all[x.second].second);
		upddij(x);
	}
}

void vorod(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>all[i].first>>all[i].second;
	}
}

void pre(){
	set<pair<int,int>>st;
	int now=0;
	while(true){
		int nx=now;
		if((int)st.size()>0){
			nx=max(nx,(*st.rbegin()).first);
		}
		if(nx==now){
			vasps[now]=1;
			st.insert(make_pair(all[now+1].second,now+1));
		}else{
			fps.push_back((*st.rbegin()).second);
			st.clear();
			for(int i=now+1;i<=nx;i++){
				st.insert(make_pair(all[i].second,i));
			}
			now=nx;
		}
		if(now==n){
			break;
		}
	}
	st.clear();
	now=n+1;
	while(true){
		int nx=now;
		if((int)st.size()>0){
			nx=min(nx,(*st.begin()).first);
		}
		if(nx==now){
			vassuf[now]=1;
			st.insert(make_pair(all[now-1].first,now-1));
		}else{
			fsuf.push_back((*st.rbegin()).second);
			st.clear();
			for(int i=now-1;i>=nx;i--){
				st.insert(make_pair(all[i].first,i));
			}
			now=nx;
		}
		if(now==1){
			break;
		}
	}
	for(int i=1;i<=n;i++){
		vassuf[i]|=vassuf[i-1];
	}
	for(int i=n;i>=1;i--){
		vasps[i]|=vasps[i+1];
	}
	for(auto x:fps){
		tedps[x]++;
	}
	for(auto x:fsuf){
		tedsuf[x]++;
	}
	for(int i=1;i<=n;i++){
		tedsuf[i]+=tedsuf[i-1];
	}
	for(int i=n;i>=1;i--){
		tedps[i]+=tedps[i+1];
	}
	dij();
}

void khor(){
	int q;
	cin>>q;
	int x;
	cin>>x;
	if(x!=1||q!=1){
		assert(0);
	}
	if(vis[x]==1){
		cout<<dp[x].first+tedps[dp[x].second+1]<<"\n";	
	}else{
		cout<<-1<<"\n";
	}
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
//	freopen("inp.txt","r",stdin);
	vorod();
	pre();
	khor();
}

Subtask #1
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8540 KB Output is correct
2 Incorrect 1 ms 8660 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Runtime error 52 ms 17492 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Runtime error 52 ms 17492 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #4
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Runtime error 52 ms 17492 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #5
0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8540 KB Output is correct
2 Incorrect 1 ms 8660 KB Output isn't correct
3 Halted 0 ms 0 KB -