#include <bits/stdc++.h>
using namespace std;
#define int long long
#define forn(i,n) for (int i=0; i<n; ++i)
#define pb(x) push_back(x);
#define f first
#define s second
void solve() {
int n, m; cin>>n>>m;
vector<pair<int,int>> a(n);
forn(i,n) cin>>a[i].first>>a[i].second;
vector<vector<int>> adj(n);
if (n<=5000) {
forn(i,n) {
forn(j,n) {
if (i==j) continue;
if (a[j].f<=a[i].s && a[i].s<=a[j].s) adj[i].pb(j);
}
}
} else {
set<pair<int,int>> s;
forn(i,n) s.insert({a[i].s,i});
auto p = s.end(); --p;
for (;;--p) {
auto x=*p; int i=x.s;
auto it = s.upper_bound({a[i].f,-1});
auto z=*it; if (z.f<a[x.s].f) ++it;
while (it!=s.end() && (*it).f<=x.f) {
if ((*it).s!=i) adj[(*it).s].pb(i);
++it;
}
if (p==s.begin()) break;
}
}
bitset<5000> vis;
forn(i,m) {
vis.reset();
int u,v; cin>>u>>v;
--u, --v;
queue<pair<int,int>> q;
q.push({u,0});
vis.set(u);
int foo=0;
while (!q.empty()) {
auto u=q.front(); q.pop();
if (u.f==v) {
foo=1;
cout<<u.s<<'\n';
break;
}
for (auto v:adj[u.f]) {
if (!vis[v]) {
vis.set(v);
q.push({v,u.s+1});
}
}
}
if (foo) continue;
cout<<"impossible\n";
}
}
int32_t main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
solve();
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Runtime error |
100 ms |
27572 KB |
Execution killed with signal 6 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
7 ms |
380 KB |
Output is correct |
4 |
Correct |
5 ms |
340 KB |
Output is correct |
5 |
Correct |
6 ms |
340 KB |
Output is correct |
6 |
Correct |
10 ms |
1876 KB |
Output is correct |
7 |
Correct |
16 ms |
3620 KB |
Output is correct |
8 |
Correct |
17 ms |
5588 KB |
Output is correct |
9 |
Correct |
48 ms |
8404 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
7 ms |
380 KB |
Output is correct |
4 |
Correct |
5 ms |
340 KB |
Output is correct |
5 |
Correct |
6 ms |
340 KB |
Output is correct |
6 |
Correct |
10 ms |
1876 KB |
Output is correct |
7 |
Correct |
16 ms |
3620 KB |
Output is correct |
8 |
Correct |
17 ms |
5588 KB |
Output is correct |
9 |
Correct |
48 ms |
8404 KB |
Output is correct |
10 |
Correct |
0 ms |
212 KB |
Output is correct |
11 |
Correct |
0 ms |
212 KB |
Output is correct |
12 |
Correct |
8 ms |
340 KB |
Output is correct |
13 |
Correct |
6 ms |
340 KB |
Output is correct |
14 |
Correct |
8 ms |
340 KB |
Output is correct |
15 |
Correct |
11 ms |
1876 KB |
Output is correct |
16 |
Correct |
17 ms |
3616 KB |
Output is correct |
17 |
Correct |
19 ms |
5596 KB |
Output is correct |
18 |
Correct |
53 ms |
8316 KB |
Output is correct |
19 |
Execution timed out |
1590 ms |
54792 KB |
Time limit exceeded |
20 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
7 ms |
380 KB |
Output is correct |
4 |
Correct |
5 ms |
340 KB |
Output is correct |
5 |
Correct |
6 ms |
340 KB |
Output is correct |
6 |
Correct |
10 ms |
1876 KB |
Output is correct |
7 |
Correct |
16 ms |
3620 KB |
Output is correct |
8 |
Correct |
17 ms |
5588 KB |
Output is correct |
9 |
Correct |
48 ms |
8404 KB |
Output is correct |
10 |
Correct |
0 ms |
212 KB |
Output is correct |
11 |
Correct |
0 ms |
212 KB |
Output is correct |
12 |
Correct |
9 ms |
388 KB |
Output is correct |
13 |
Correct |
5 ms |
360 KB |
Output is correct |
14 |
Correct |
7 ms |
340 KB |
Output is correct |
15 |
Correct |
10 ms |
1876 KB |
Output is correct |
16 |
Correct |
17 ms |
3608 KB |
Output is correct |
17 |
Correct |
20 ms |
5580 KB |
Output is correct |
18 |
Correct |
52 ms |
8404 KB |
Output is correct |
19 |
Runtime error |
98 ms |
27344 KB |
Execution killed with signal 6 |
20 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
106 ms |
27368 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Runtime error |
100 ms |
27572 KB |
Execution killed with signal 6 |
3 |
Halted |
0 ms |
0 KB |
- |