oj.uz

Submission #929267

# Submission time Handle Problem Language Result Execution time Memory
929267 2024-02-18T04:27:59 Z ono_de206 Airplane (NOI23_airplane) C++14
100 / 100
 438 ms 38440 KB 
#include<bits/stdc++.h>
using namespace std;

#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second

#define int long long

typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
// typedef pair<int, int> P;

template<typename T, typename U>
ostream & operator << (ostream &out, const pair<T, U> &c) {
	out << c.first << ' ' << c.second;
	return out;
}

template<typename T>
ostream & operator << (ostream &out, vector<T> &v) {
	const int sz = v.size();
	for (int i = 0; i < sz; i++) {
		if (i) out << ' ';
		out << v[i];
	}
	return out;
}

template<typename T>
istream & operator >> (istream &in, vector<T> &v) {
	for (T &x : v) in >> x;
	return in;
}

template<typename T, typename U>
	istream & operator >> (istream &in, pair<T, U> &c) {
	in >> c.first;
	in >> c.second;
	return in;
}

template<typename T>
void mxx(T &a, T b){if(b > a) a = b;}
template<typename T>
void mnn(T &a, T b){if(b < a) a = b;}

const int mxn = 2e5 + 10, MXLOG = 22, mod = 1e9 + 7, P = 1181, D = 1523, N = 2500;
const long long inf = 2e18 + 10;
int a[mxn], n;
vector<int> g[mxn];

vector<pair<int, int>> bfs(int st) {
	vector<pair<int, int>> ret(n + 1, make_pair(inf, inf));
	ret[st] = make_pair(0, a[st]);
	priority_queue<pair<pair<int, int>, int>, vector<pair<pair<int, int>, int>>, greater<pair<pair<int, int>, int>>> q;
	q.emplace(ret[st], st);
	while(q.size()) {
		auto my = q.top().ff;
		int x = q.top().ss;
		q.pop();
		if(my != ret[x]) continue;
		for(int y : g[x]) {
			auto nxt = my;
			mxx(nxt.ss, a[y]);
			nxt.ff = max(a[y], nxt.ff + 1);
			if(nxt < ret[y]) {
				ret[y] = nxt;
				q.emplace(ret[y], y);
			}
		}
	}
	return ret;
}

void go() {
	int m;
	cin >> n >> m;
	for(int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	for(int i = 1; i <= m; i++) {
		int x, y;
		cin >> x >> y;
		g[x].pb(y);
		g[y].pb(x);
	}
	auto d1 = bfs(1);
	auto d2 = bfs(n);
	int ans = inf;
	for(int i = 1; i <= n; i++) {
		if(d1[i].ss == a[i] && d2[i].ss == a[i]) mnn(ans, d1[i].ff + d2[i].ff);
	}
	cout << ans << endl;
}

signed main() {
	fast;
	int t = 1;
	// cin >> t;
	while(t--) {
		go();
	}
	return 0;
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Correct 56 ms 19288 KB Output is correct
3 Correct 63 ms 22696 KB Output is correct
4 Correct 71 ms 22864 KB Output is correct
5 Correct 65 ms 23288 KB Output is correct
6 Correct 79 ms 23448 KB Output is correct
7 Correct 61 ms 23424 KB Output is correct
8 Correct 2 ms 4952 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 3 ms 5212 KB Output is correct
7 Correct 3 ms 5176 KB Output is correct
8 Correct 2 ms 5208 KB Output is correct
9 Correct 3 ms 5468 KB Output is correct
10 Correct 3 ms 5256 KB Output is correct
11 Correct 3 ms 5408 KB Output is correct
12 Correct 2 ms 5176 KB Output is correct
13 Correct 2 ms 5172 KB Output is correct
14 Correct 3 ms 5212 KB Output is correct
15 Correct 3 ms 5224 KB Output is correct
16 Correct 3 ms 5468 KB Output is correct
17 Correct 3 ms 5468 KB Output is correct
18 Correct 1 ms 4956 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 3 ms 5212 KB Output is correct
7 Correct 3 ms 5176 KB Output is correct
8 Correct 2 ms 5208 KB Output is correct
9 Correct 3 ms 5468 KB Output is correct
10 Correct 3 ms 5256 KB Output is correct
11 Correct 3 ms 5408 KB Output is correct
12 Correct 2 ms 5176 KB Output is correct
13 Correct 2 ms 5172 KB Output is correct
14 Correct 3 ms 5212 KB Output is correct
15 Correct 3 ms 5224 KB Output is correct
16 Correct 3 ms 5468 KB Output is correct
17 Correct 3 ms 5468 KB Output is correct
18 Correct 1 ms 4956 KB Output is correct
19 Correct 3 ms 5212 KB Output is correct
20 Correct 3 ms 5212 KB Output is correct
21 Correct 3 ms 5224 KB Output is correct
22 Correct 3 ms 5212 KB Output is correct
23 Correct 2 ms 5212 KB Output is correct
24 Correct 2 ms 5212 KB Output is correct
25 Correct 3 ms 5208 KB Output is correct
26 Correct 2 ms 5208 KB Output is correct
27 Correct 3 ms 5216 KB Output is correct
28 Correct 3 ms 5468 KB Output is correct
29 Correct 3 ms 5468 KB Output is correct
30 Correct 3 ms 5468 KB Output is correct

Subtask #4
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Correct 56 ms 19288 KB Output is correct
3 Correct 63 ms 22696 KB Output is correct
4 Correct 71 ms 22864 KB Output is correct
5 Correct 65 ms 23288 KB Output is correct
6 Correct 79 ms 23448 KB Output is correct
7 Correct 61 ms 23424 KB Output is correct
8 Correct 2 ms 4952 KB Output is correct
9 Correct 1 ms 4956 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 1 ms 4956 KB Output is correct
12 Correct 1 ms 4956 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 3 ms 5212 KB Output is correct
15 Correct 3 ms 5176 KB Output is correct
16 Correct 2 ms 5208 KB Output is correct
17 Correct 3 ms 5468 KB Output is correct
18 Correct 3 ms 5256 KB Output is correct
19 Correct 3 ms 5408 KB Output is correct
20 Correct 2 ms 5176 KB Output is correct
21 Correct 2 ms 5172 KB Output is correct
22 Correct 3 ms 5212 KB Output is correct
23 Correct 3 ms 5224 KB Output is correct
24 Correct 3 ms 5468 KB Output is correct
25 Correct 3 ms 5468 KB Output is correct
26 Correct 1 ms 4956 KB Output is correct
27 Correct 3 ms 5212 KB Output is correct
28 Correct 3 ms 5212 KB Output is correct
29 Correct 3 ms 5224 KB Output is correct
30 Correct 3 ms 5212 KB Output is correct
31 Correct 2 ms 5212 KB Output is correct
32 Correct 2 ms 5212 KB Output is correct
33 Correct 3 ms 5208 KB Output is correct
34 Correct 2 ms 5208 KB Output is correct
35 Correct 3 ms 5216 KB Output is correct
36 Correct 3 ms 5468 KB Output is correct
37 Correct 3 ms 5468 KB Output is correct
38 Correct 3 ms 5468 KB Output is correct
39 Correct 248 ms 24504 KB Output is correct
40 Correct 161 ms 23856 KB Output is correct
41 Correct 137 ms 23652 KB Output is correct
42 Correct 128 ms 23528 KB Output is correct
43 Correct 164 ms 23648 KB Output is correct
44 Correct 161 ms 23840 KB Output is correct
45 Correct 136 ms 23452 KB Output is correct
46 Correct 142 ms 23680 KB Output is correct
47 Correct 146 ms 23736 KB Output is correct
48 Correct 200 ms 23616 KB Output is correct
49 Correct 285 ms 24444 KB Output is correct
50 Correct 308 ms 24364 KB Output is correct
51 Correct 223 ms 24268 KB Output is correct
52 Correct 362 ms 31548 KB Output is correct
53 Correct 310 ms 30188 KB Output is correct
54 Correct 382 ms 30212 KB Output is correct
55 Correct 350 ms 30488 KB Output is correct
56 Correct 438 ms 36008 KB Output is correct
57 Correct 327 ms 37656 KB Output is correct
58 Correct 377 ms 38440 KB Output is correct
59 Correct 297 ms 37828 KB Output is correct
60 Correct 362 ms 37196 KB Output is correct
61 Correct 377 ms 37128 KB Output is correct
62 Correct 387 ms 37124 KB Output is correct
63 Correct 337 ms 36004 KB Output is correct
64 Correct 390 ms 36628 KB Output is correct
65 Correct 370 ms 36772 KB Output is correct
66 Correct 369 ms 36160 KB Output is correct
67 Correct 363 ms 36304 KB Output is correct