oj.uz

Submission #886206

# Submission time Handle Problem Language Result Execution time Memory
886206 2023-12-11T15:02:28 Z vjudge1 Airplane (NOI23_airplane) C++17
0 / 100
 71 ms 32080 KB 
#include <bits/stdc++.h>
using namespace std;
#define fileio() freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#define fastio() cin.tie(0), ios_base::sync_with_stdio(0)
#define sp " "
#define endl "\n"
#define pii pair<int, int>
#define st first
#define nd second
#define pb push_back
#define N 300005
#define int long long

const int INF = 1e9 + 7;

pii d[2][N];
vector<int> adj[N];
int arr[N], maks[2][N];

int32_t main(){
	//fileio();
	fastio();

	int n, m;
	cin>>n>>m;
	for (int i = 1; i <= n; i++){
		cin>>arr[i];
	}

	for (int i = 1; i <= m; i++){
		int u, v;
		cin>>u>>v;
		adj[u].pb(v);
		adj[v].pb(u);
	}

	int root = 1;
	for (int i = 0; i < 2; i++){
		priority_queue<array<int, 3>> q;
		q.push({0, -arr[root], root});
		for (int j = 1; j <= n; j++){
			d[i][j] = {INF, INF};
			maks[i][j] = INF;
		}
		d[i][root] = {0, -arr[root]};
		while(!q.empty()){
			int top = q.top()[2];
			int dd = -q.top()[0];
			int m = -q.top()[1];
			q.pop();
			for (auto j : adj[top]){
				pii dist = {max(arr[j], dd + 1), max(m, arr[j])};
				if (d[i][j] > dist){
					d[i][j] = dist;
					q.push({-dist.st, -dist.nd, j});
				}
				if (m <= arr[j] && maks[i][j] > dist.st){
					maks[i][j] = dist.st;
					q.push({-dist.st, -arr[j], j});
				}
			}
		}
		root = n;
	}

	int ans = INF;
	for (int i = 1; i <= n; i++){
		ans = min(ans, maks[0][i] + maks[1][i]);
		//cout<<i<<sp<<d[0][i]<<sp<<d[1][i]<<endl;
	}
	cout<<ans<<endl;
	cerr<<"time taken : "<<(float)clock() / CLOCKS_PER_SEC<<" seconds\n";
}

Subtask #1
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14776 KB Output is correct
2 Correct 61 ms 29268 KB Output is correct
3 Correct 64 ms 31568 KB Output is correct
4 Correct 71 ms 31568 KB Output is correct
5 Correct 65 ms 31952 KB Output is correct
6 Correct 67 ms 32080 KB Output is correct
7 Correct 68 ms 31824 KB Output is correct
8 Incorrect 3 ms 14680 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14680 KB Output is correct
2 Correct 2 ms 14680 KB Output is correct
3 Incorrect 2 ms 14680 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 14680 KB Output is correct
2 Correct 2 ms 14680 KB Output is correct
3 Incorrect 2 ms 14680 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14776 KB Output is correct
2 Correct 61 ms 29268 KB Output is correct
3 Correct 64 ms 31568 KB Output is correct
4 Correct 71 ms 31568 KB Output is correct
5 Correct 65 ms 31952 KB Output is correct
6 Correct 67 ms 32080 KB Output is correct
7 Correct 68 ms 31824 KB Output is correct
8 Incorrect 3 ms 14680 KB Output isn't correct
9 Halted 0 ms 0 KB -