oj.uz

답안 #577673

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
577673 2022-06-15T07:53:01 Z vanic Event Hopping (BOI22_events) C++14
10 / 100
 1500 ms 524288 KB 
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <queue>

using namespace std;

const int maxn=1e5+5, Log=17, pot=(1<<Log);

vector < int > svi;

void query(int L, int D, int x, int l, int d){
	if(L>=l && D<=d){
		svi.push_back(x);
		return;
	}
	if((L+D)/2>=l){
		query(L, (L+D)/2, x*2, l, d);
	}
	if((L+D)/2+1<=d){
		query((L+D)/2+1, D, x*2+1, l, d);
	}
}


pair < int, int > a[maxn];
set < int > s;
map < int, int > m;
int dist[pot*2];
int d[maxn];
vector < pair < int, int > >  ms[pot*2];

void precompute(){
	for(int i=2; i<pot*2; i++){
		ms[i].push_back({i/2, 0});
	}
}

void bfs(int x){
	memset(dist, -1, sizeof(dist));
	memset(d, -1, sizeof(d));
	queue < int > q1, q2;
	q1.push(a[x].second+pot);
	dist[a[x].second+pot]=0;
	d[x]=0;
	int tren=0;
	while(!q1.empty()){
		while(!q1.empty()){
			x=q1.front();
			q1.pop();
			for(int i=0; i<(int)ms[x].size(); i++){
				if(ms[x][i].second){
					if(dist[ms[x][i].first]==-1){
						dist[ms[x][i].first]=tren+1;
						q2.push(ms[x][i].first);
					}
					if(d[ms[x][i].second]==-1){
						d[ms[x][i].second]=tren+1;
					}
				}
				else{
					if(dist[ms[x][i].first]==-1){
						dist[ms[x][i].first]=tren;
						q1.push(ms[x][i].first);
					}
				}
			}
		}
		swap(q1, q2);
		tren++;
	}
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	precompute();
	int n, q;
	cin >> n >> q;
	for(int i=1; i<=n; i++){
		cin >> a[i].first >> a[i].second;
		s.insert(a[i].first);
		s.insert(a[i].second);
	}
	int br=0;
	for(auto it=s.begin(); it!=s.end(); it++){
		m[*it]=br;
		br++;
	}
	for(int i=1; i<=n; i++){
		a[i]={m[a[i].first], m[a[i].second]};
//		cout << a[i].first << ' ' << a[i].second << endl;
		query(0, pot-1, 1, a[i].first, a[i].second);
		while(!svi.empty()){
//			cout << "moji " << svi.back() << endl;
			ms[svi.back()].push_back({a[i].second+pot, i});
			svi.pop_back();
		}
	}
	int x, y;
	for(int i=0; i<q; i++){
		cin >> x >> y;
		bfs(x);
		if(d[y]==-1){
			cout << "impossible\n";
		}
		else{
			cout << d[y] << '\n';
		}
	}
	return 0;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 16084 KB Output is correct
2 Execution timed out 1590 ms 26140 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 16012 KB Output is correct
2 Correct 17 ms 16084 KB Output is correct
3 Correct 24 ms 16300 KB Output is correct
4 Correct 20 ms 16136 KB Output is correct
5 Correct 23 ms 16124 KB Output is correct
6 Correct 24 ms 16212 KB Output is correct
7 Correct 24 ms 16300 KB Output is correct
8 Correct 26 ms 16460 KB Output is correct
9 Correct 23 ms 16132 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 16012 KB Output is correct
2 Correct 17 ms 16084 KB Output is correct
3 Correct 24 ms 16300 KB Output is correct
4 Correct 20 ms 16136 KB Output is correct
5 Correct 23 ms 16124 KB Output is correct
6 Correct 24 ms 16212 KB Output is correct
7 Correct 24 ms 16300 KB Output is correct
8 Correct 26 ms 16460 KB Output is correct
9 Correct 23 ms 16132 KB Output is correct
10 Correct 15 ms 16108 KB Output is correct
11 Correct 15 ms 16092 KB Output is correct
12 Correct 24 ms 16204 KB Output is correct
13 Correct 21 ms 16212 KB Output is correct
14 Correct 23 ms 16204 KB Output is correct
15 Correct 24 ms 16212 KB Output is correct
16 Correct 25 ms 16368 KB Output is correct
17 Correct 24 ms 16564 KB Output is correct
18 Correct 23 ms 16104 KB Output is correct
19 Execution timed out 1592 ms 17416 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 16012 KB Output is correct
2 Correct 17 ms 16084 KB Output is correct
3 Correct 24 ms 16300 KB Output is correct
4 Correct 20 ms 16136 KB Output is correct
5 Correct 23 ms 16124 KB Output is correct
6 Correct 24 ms 16212 KB Output is correct
7 Correct 24 ms 16300 KB Output is correct
8 Correct 26 ms 16460 KB Output is correct
9 Correct 23 ms 16132 KB Output is correct
10 Correct 16 ms 16084 KB Output is correct
11 Correct 16 ms 16076 KB Output is correct
12 Correct 25 ms 16216 KB Output is correct
13 Correct 21 ms 16212 KB Output is correct
14 Correct 21 ms 16140 KB Output is correct
15 Correct 21 ms 16252 KB Output is correct
16 Correct 24 ms 16348 KB Output is correct
17 Correct 32 ms 16364 KB Output is correct
18 Correct 22 ms 16084 KB Output is correct
19 Correct 1081 ms 26256 KB Output is correct
20 Correct 583 ms 26276 KB Output is correct
21 Correct 789 ms 31548 KB Output is correct
22 Runtime error 316 ms 524288 KB Execution killed with signal 9
23 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1582 ms 26200 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 16084 KB Output is correct
2 Execution timed out 1590 ms 26140 KB Time limit exceeded
3 Halted 0 ms 0 KB -