oj.uz

답안 #110787

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
110787 2019-05-12T08:24:10 Z MAMBA 007 (CEOI14_007) C++17
0 / 100
 369 ms 42388 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 - (A - alpha + max(alpha , beta));
	if (res < 0) res = -1;
	cout << res << endl;


	return 0;
}

Subtask #1
0.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 31744 KB Output is correct
2 Correct 35 ms 31608 KB Output is correct
3 Correct 38 ms 31608 KB Output is correct
4 Partially correct 30 ms 31608 KB Partially correct
5 Partially correct 28 ms 31744 KB Partially correct
6 Incorrect 28 ms 31616 KB Output isn't correct
7 Incorrect 28 ms 31580 KB Output isn't correct
8 Partially correct 32 ms 31744 KB Partially correct
9 Incorrect 29 ms 31744 KB Output isn't correct
10 Correct 29 ms 31608 KB Output is correct
11 Correct 27 ms 31744 KB Output is correct
12 Incorrect 34 ms 31744 KB Output isn't correct
13 Incorrect 29 ms 31616 KB Output isn't correct
14 Incorrect 31 ms 31708 KB Output isn't correct
15 Incorrect 29 ms 31616 KB Output isn't correct
16 Incorrect 29 ms 31608 KB Output isn't correct
17 Incorrect 28 ms 31744 KB Output isn't correct
18 Incorrect 29 ms 31616 KB Output isn't correct
19 Incorrect 30 ms 31744 KB Output isn't correct
20 Incorrect 32 ms 31608 KB Output isn't correct
21 Correct 32 ms 31744 KB Output is correct
22 Partially correct 31 ms 31644 KB Partially correct
23 Incorrect 33 ms 31744 KB Output isn't correct
24 Partially correct 32 ms 31736 KB Partially correct

Subtask #2
0.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 67 ms 33084 KB Output isn't correct
2 Incorrect 80 ms 34064 KB Output isn't correct
3 Incorrect 66 ms 33272 KB Output isn't correct
4 Incorrect 85 ms 34140 KB Output isn't correct
5 Correct 59 ms 33012 KB Output is correct
6 Correct 74 ms 33460 KB Output is correct
7 Incorrect 58 ms 33372 KB Output isn't correct
8 Correct 61 ms 33400 KB Output is correct
9 Incorrect 75 ms 33784 KB Output isn't correct
10 Incorrect 225 ms 38200 KB Output isn't correct
11 Incorrect 92 ms 35012 KB Output isn't correct
12 Incorrect 98 ms 35576 KB Output isn't correct
13 Incorrect 95 ms 35060 KB Output isn't correct
14 Correct 94 ms 34552 KB Output is correct
15 Incorrect 101 ms 35832 KB Output isn't correct
16 Correct 96 ms 36088 KB Output is correct
17 Correct 83 ms 35448 KB Output is correct
18 Incorrect 93 ms 35468 KB Output isn't correct
19 Incorrect 132 ms 36656 KB Output isn't correct
20 Incorrect 332 ms 39464 KB Output isn't correct
21 Incorrect 151 ms 38156 KB Output isn't correct
22 Incorrect 152 ms 36600 KB Output isn't correct
23 Correct 145 ms 37880 KB Output is correct
24 Incorrect 178 ms 37968 KB Output isn't correct
25 Incorrect 123 ms 36984 KB Output isn't correct
26 Correct 103 ms 36704 KB Output is correct
27 Correct 148 ms 37368 KB Output is correct
28 Correct 176 ms 37344 KB Output is correct
29 Incorrect 260 ms 38128 KB Output isn't correct
30 Incorrect 351 ms 40056 KB Output isn't correct
31 Incorrect 187 ms 39288 KB Output isn't correct
32 Incorrect 153 ms 37240 KB Output isn't correct
33 Correct 193 ms 37628 KB Output is correct
34 Incorrect 182 ms 37884 KB Output isn't correct
35 Incorrect 171 ms 38392 KB Output isn't correct
36 Incorrect 216 ms 38776 KB Output isn't correct
37 Correct 274 ms 38864 KB Output is correct
38 Correct 180 ms 38392 KB Output is correct
39 Correct 186 ms 38336 KB Output is correct
40 Incorrect 273 ms 40136 KB Output isn't correct
41 Incorrect 369 ms 42388 KB Output isn't correct