oj.uz

Submission #110777

# Submission time Handle Problem Language Result Execution time Memory
110777 2019-05-12T08:12:56 Z MAMBA 007 (CEOI14_007) C++17
0 / 100
 408 ms 42112 KB 
#include <bits/stdc++.h> 

using namespace std;

#define rep(i , j , k) for (int i = j; i < (int)k; i++)
#define pb push_back
#define mt make_tuple
#define for_all(x) x.begin(),x.end()

typedef long long ll;
typedef pair<int , int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef long double ld;
typedef complex<ld> point;

inline void fileIO(string s) {
	freopen((s + ".in").c_str(), "r", stdin);
	freopen((s + ".out").c_str(), "w", stdout);
}

template<class T , class S>
inline bool smin(T &a, S b) { return (T)b < a ? a = b , 1 : 0; }
template<class T , class S>
inline bool smax(T &a, S b) { return a < (T)b ? a = b , 1 : 0; }

constexpr int N = 1e6 + 10;

constexpr int MOD = 1e9 + 7;

template<typename T>
inline T mod(T &v) { return v = (v % MOD + MOD) % MOD; }
template<typename S, typename T>
inline S add(S &l, T r) { return mod(l += r); }

ll po(ll v, ll u) { return u ? po(v * v % MOD , u >> 1) * (u & 1 ? v : 1) % MOD : 1; }

int n , m;
int s , t , a , b, dist[N];
vector<int> adj[N];
int L , R , Q[N];

void bfs(int so) {
	memset(dist , -1, sizeof(dist));
	dist[so] = 0;
	L = 0, R = 1;
	Q[0] = so;
	while (L < R) {
		int me = Q[L++];
		for (auto e : adj[me])
			if (!~dist[e]) {
				dist[e] = dist[me] + 1;
				Q[R++] = e;
			}
	}
}

int arr[N];

void dfs(int v,  int col) {
	arr[v] += col;
	for (auto e : adj[v])
		if (dist[e] + 1 == dist[v] && arr[e] < col) 
			dfs(e , col);
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);

#ifndef LOCAL
	//	fileIO("forbidden1");
#endif


	cin >> n >> m >> s >> t >> a >> b;
	rep(i , 0 , m) {
		int u , v;
		cin >> u >> v;
		adj[u].pb(v);
		adj[v].pb(u);
	}

	bfs(s);
	int A = dist[a];
	int B = dist[b];

	dfs(a , 1);
	dfs(b , 2);

	int alpha = 0;
	rep(i , 0 , n + 1)
		if (arr[i] == 3)
			smax(alpha , dist[i]);

	bfs(t);
	int C = dist[a];
	int D = dist[b];

	memset(arr , 0 , sizeof(arr));
	dfs(a , 1);
	dfs(b , 2);

	int beta = 0;
	rep(i , 0 , n + 1)
		if (arr[i] == 3)
			smax(beta , dist[i]);



	int res = min(C - A , D - B);
	if (res < 0) return cout << -1 << endl, 0;

	if (A == B && C == D) 
		res = C - (max(A - alpha , C - beta) + alpha); 
	cout << res << endl;


	return 0;
}

Subtask #1
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 31744 KB Output is correct
2 Correct 29 ms 31608 KB Output is correct
3 Correct 34 ms 31736 KB Output is correct
4 Incorrect 27 ms 31608 KB Output isn't correct
5 Incorrect 28 ms 31616 KB Output isn't correct
6 Correct 28 ms 31616 KB Output is correct
7 Correct 28 ms 31616 KB Output is correct
8 Incorrect 29 ms 31608 KB Output isn't correct
9 Correct 35 ms 31608 KB Output is correct
10 Correct 39 ms 31660 KB Output is correct
11 Correct 37 ms 31608 KB Output is correct
12 Incorrect 33 ms 31736 KB Output isn't correct
13 Correct 32 ms 31652 KB Output is correct
14 Incorrect 31 ms 31616 KB Output isn't correct
15 Partially correct 29 ms 31744 KB Partially correct
16 Incorrect 30 ms 31608 KB Output isn't correct
17 Incorrect 35 ms 31616 KB Output isn't correct
18 Incorrect 29 ms 31608 KB Output isn't correct
19 Correct 29 ms 31744 KB Output is correct
20 Incorrect 29 ms 31616 KB Output isn't correct
21 Correct 29 ms 31820 KB Output is correct
22 Incorrect 29 ms 31608 KB Output isn't correct
23 Correct 33 ms 31784 KB Output is correct
24 Incorrect 35 ms 31704 KB Output isn't correct

Subtask #2
0.0 / 70.0

# Verdict Execution time Memory Grader output
1 Partially correct 67 ms 33272 KB Partially correct
2 Incorrect 63 ms 34012 KB Output isn't correct
3 Correct 56 ms 33144 KB Output is correct
4 Incorrect 71 ms 34296 KB Output isn't correct
5 Correct 56 ms 33020 KB Output is correct
6 Correct 72 ms 33528 KB Output is correct
7 Incorrect 60 ms 33400 KB Output isn't correct
8 Incorrect 65 ms 33400 KB Output isn't correct
9 Incorrect 78 ms 33784 KB Output isn't correct
10 Correct 216 ms 38116 KB Output is correct
11 Incorrect 92 ms 34936 KB Output isn't correct
12 Correct 127 ms 35676 KB Output is correct
13 Incorrect 81 ms 35064 KB Output isn't correct
14 Correct 91 ms 34556 KB Output is correct
15 Partially correct 108 ms 35908 KB Partially correct
16 Correct 104 ms 35960 KB Output is correct
17 Incorrect 108 ms 35448 KB Output isn't correct
18 Incorrect 104 ms 35448 KB Output isn't correct
19 Correct 183 ms 36688 KB Output is correct
20 Incorrect 236 ms 39536 KB Output isn't correct
21 Incorrect 163 ms 38136 KB Output isn't correct
22 Correct 151 ms 36500 KB Output is correct
23 Correct 122 ms 37992 KB Output is correct
24 Correct 134 ms 37852 KB Output is correct
25 Incorrect 152 ms 36984 KB Output isn't correct
26 Correct 116 ms 36700 KB Output is correct
27 Incorrect 144 ms 37272 KB Output isn't correct
28 Incorrect 163 ms 37356 KB Output isn't correct
29 Correct 224 ms 38196 KB Output is correct
30 Incorrect 300 ms 40120 KB Output isn't correct
31 Incorrect 196 ms 39232 KB Output isn't correct
32 Correct 197 ms 37260 KB Output is correct
33 Correct 136 ms 37596 KB Output is correct
34 Incorrect 172 ms 37648 KB Output isn't correct
35 Incorrect 191 ms 38296 KB Output isn't correct
36 Incorrect 215 ms 38736 KB Output isn't correct
37 Correct 276 ms 38648 KB Output is correct
38 Incorrect 201 ms 38368 KB Output isn't correct
39 Incorrect 260 ms 38372 KB Output isn't correct
40 Incorrect 303 ms 40008 KB Output isn't correct
41 Correct 408 ms 42112 KB Output is correct