oj.uz

Submission #599966

# Submission time Handle Problem Language Result Execution time Memory
599966 2022-07-20T10:53:02 Z TimDee Event Hopping (BOI22_events) C++17
0 / 100
 1500 ms 104712 KB 
//#pragma GCC optimize("O1")
//#pragma GCC optimize("O2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")

#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;
	//forn(i,n) a[i].f=i+1, a[i].s=i+n+1;
	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;
		}

	}
	
	vector<vector<int>> dp(min(n,5000),vector<int>(min(n,5000),1e9+3));
	if (n<=5000) {
		vector<int> vis(n,0);
		forn(i,n) {
			vis.assign(n,0);
			queue<int> q;
			dp[i][i]=0;
			q.push(i);
			while (!q.empty()) {
				int u=q.front(); q.pop(); //cout<<u<<"->";
				if (vis[u]) continue;
				vis[u]=1;
				for (auto v:adj[u]) {
					if (!vis[v]) {
						dp[i][v]=min(dp[i][v],dp[i][u]+1);
						q.push(v); //cout<<v<<' ';
					}
				}
				//cout<<'\n';
			}
		}
	}

	//forn(i,n) {
	//	cout<<i<<": ";
	//	for (auto x:adj[i]) cout<<x<<' '; cout<<'\n';
	//}

	forn(i,m) {
		int u,v; cin>>u>>v;
		--u, --v;
		//int u=0, v=min(4999,n-1);
		if (n<=5000) {
			if (dp[u][v]==1e9+3) cout<<"impossible\n";
			else cout<<dp[u][v]<<'\n';
		} else {

		}
	}
}

int32_t main() {
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	solve();
	return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 121 ms 104620 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 15 ms 4340 KB Output is correct
4 Correct 11 ms 4308 KB Output is correct
5 Correct 17 ms 4308 KB Output is correct
6 Correct 143 ms 5168 KB Output is correct
7 Correct 783 ms 6744 KB Output is correct
8 Correct 899 ms 8152 KB Output is correct
9 Execution timed out 1577 ms 10560 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 15 ms 4340 KB Output is correct
4 Correct 11 ms 4308 KB Output is correct
5 Correct 17 ms 4308 KB Output is correct
6 Correct 143 ms 5168 KB Output is correct
7 Correct 783 ms 6744 KB Output is correct
8 Correct 899 ms 8152 KB Output is correct
9 Execution timed out 1577 ms 10560 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 15 ms 4340 KB Output is correct
4 Correct 11 ms 4308 KB Output is correct
5 Correct 17 ms 4308 KB Output is correct
6 Correct 143 ms 5168 KB Output is correct
7 Correct 783 ms 6744 KB Output is correct
8 Correct 899 ms 8152 KB Output is correct
9 Execution timed out 1577 ms 10560 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 139 ms 104712 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 121 ms 104620 KB Output isn't correct
3 Halted 0 ms 0 KB -