oj.uz

Submission #913491

# Submission time Handle Problem Language Result Execution time Memory
913491 2024-01-20T08:07:46 Z pan Airplane (NOI23_airplane) C++17
0 / 100
 194 ms 26932 KB 
#include <bits/stdc++.h>
//#include "bits_stdc++.h"
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
//#define input(x) scanf("%lld", &x);
//#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<ll, pi> pii;
ll n, m;
vector<ll> height;
vector<ll> adj[200005];
pi edges[400005];
ll const INF = 1e13;
vector<ll> dijkstra(ll from)
{
	vector<ll> visited(n+1, false);
	vector<ll> dist(n+1, INF);
	dist[from] = 0;
	priority_queue<pi, vector<pi>, greater<pi> > pq;
	pq.push(mp(0, from));
	while (pq.size())
	{
		ll c = pq.top().s;
		pq.pop();
		if (visited[c]) continue;
		visited[c] = true;
		for (ll u: adj[c])
		{
			ll neww = max(dist[c]+1, height[u]);
			if (dist[u]>neww)
			{
				dist[u] = neww;
				pq.push(mp(neww, u));
			}
		}
	}
	return dist;
}
int main()
{
	cin >> n >> m;
	height.resize(n+1);
	for (ll i=1; i<=n; ++i) cin >> height[i];
	for (ll i=0; i<m; ++i)
	{
		ll x, y;
		cin >> x >> y;
		edges[i].f = x, edges[i].s = y;
		adj[x].pb(y);
		adj[y].pb(x);
	}
	vector<ll> up, down;
	up = dijkstra(1); down = dijkstra(n);
	ll ans = LLONG_MAX;
	// if maintain for 0 sec
	for (ll i=2; i<n; ++i)
	{
		ans = min(ans, up[i] + down[i]);
	}
	// if maintain for 1 sec
	for (ll i=0; i<m; ++i)
	{
		pi x = edges[i];
		if (x.f==1 || x.s==1 || x.f==n || x.s==n) continue;
		ans = min(ans, up[x.f] + down[x.s]+1);
		ans = min(ans, up[x.s] + down[x.f]+1);
	}
	cout << ans << endl;
	
	
	
	return 0;
}

Subtask #1
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7000 KB Output is correct
2 Incorrect 194 ms 26932 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7164 KB Output is correct
2 Correct 4 ms 7160 KB Output is correct
3 Incorrect 3 ms 7256 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7164 KB Output is correct
2 Correct 4 ms 7160 KB Output is correct
3 Incorrect 3 ms 7256 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7000 KB Output is correct
2 Incorrect 194 ms 26932 KB Output isn't correct
3 Halted 0 ms 0 KB -