| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 110789 |
2019-05-12T08:27:05 Z |
MAMBA |
007 (CEOI14_007) |
C++17 |
|
346 ms |
42360 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 && (C - beta) < (A - alpha))
res--;
if (res < 0) res = -1;
cout << res << endl;
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
32 ms |
31616 KB |
Output is correct |
| 2 |
Correct |
31 ms |
31744 KB |
Output is correct |
| 3 |
Correct |
32 ms |
31616 KB |
Output is correct |
| 4 |
Correct |
35 ms |
31608 KB |
Output is correct |
| 5 |
Correct |
33 ms |
31608 KB |
Output is correct |
| 6 |
Correct |
32 ms |
31616 KB |
Output is correct |
| 7 |
Correct |
31 ms |
31616 KB |
Output is correct |
| 8 |
Correct |
33 ms |
31744 KB |
Output is correct |
| 9 |
Correct |
33 ms |
31736 KB |
Output is correct |
| 10 |
Correct |
33 ms |
31744 KB |
Output is correct |
| 11 |
Correct |
33 ms |
31616 KB |
Output is correct |
| 12 |
Correct |
36 ms |
31736 KB |
Output is correct |
| 13 |
Correct |
33 ms |
31736 KB |
Output is correct |
| 14 |
Correct |
36 ms |
31744 KB |
Output is correct |
| 15 |
Correct |
32 ms |
31744 KB |
Output is correct |
| 16 |
Correct |
34 ms |
31744 KB |
Output is correct |
| 17 |
Correct |
31 ms |
31736 KB |
Output is correct |
| 18 |
Correct |
35 ms |
31776 KB |
Output is correct |
| 19 |
Correct |
32 ms |
31744 KB |
Output is correct |
| 20 |
Correct |
34 ms |
31608 KB |
Output is correct |
| 21 |
Correct |
30 ms |
31720 KB |
Output is correct |
| 22 |
Correct |
31 ms |
31616 KB |
Output is correct |
| 23 |
Correct |
33 ms |
31608 KB |
Output is correct |
| 24 |
Correct |
32 ms |
31708 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
56 ms |
33092 KB |
Output is correct |
| 2 |
Correct |
68 ms |
34040 KB |
Output is correct |
| 3 |
Correct |
58 ms |
33144 KB |
Output is correct |
| 4 |
Correct |
66 ms |
34168 KB |
Output is correct |
| 5 |
Correct |
52 ms |
33060 KB |
Output is correct |
| 6 |
Correct |
61 ms |
33528 KB |
Output is correct |
| 7 |
Correct |
61 ms |
33400 KB |
Output is correct |
| 8 |
Correct |
62 ms |
33400 KB |
Output is correct |
| 9 |
Correct |
111 ms |
33784 KB |
Output is correct |
| 10 |
Correct |
218 ms |
38136 KB |
Output is correct |
| 11 |
Correct |
128 ms |
34936 KB |
Output is correct |
| 12 |
Correct |
134 ms |
35624 KB |
Output is correct |
| 13 |
Correct |
100 ms |
35064 KB |
Output is correct |
| 14 |
Correct |
83 ms |
34552 KB |
Output is correct |
| 15 |
Correct |
111 ms |
35820 KB |
Output is correct |
| 16 |
Correct |
133 ms |
36076 KB |
Output is correct |
| 17 |
Correct |
90 ms |
35540 KB |
Output is correct |
| 18 |
Correct |
119 ms |
35576 KB |
Output is correct |
| 19 |
Correct |
155 ms |
36752 KB |
Output is correct |
| 20 |
Correct |
280 ms |
39544 KB |
Output is correct |
| 21 |
Correct |
152 ms |
38136 KB |
Output is correct |
| 22 |
Correct |
169 ms |
36600 KB |
Output is correct |
| 23 |
Correct |
137 ms |
38008 KB |
Output is correct |
| 24 |
Correct |
170 ms |
37780 KB |
Output is correct |
| 25 |
Correct |
166 ms |
36988 KB |
Output is correct |
| 26 |
Correct |
145 ms |
36728 KB |
Output is correct |
| 27 |
Correct |
127 ms |
37368 KB |
Output is correct |
| 28 |
Correct |
146 ms |
37268 KB |
Output is correct |
| 29 |
Correct |
266 ms |
38148 KB |
Output is correct |
| 30 |
Correct |
301 ms |
40260 KB |
Output is correct |
| 31 |
Correct |
226 ms |
39288 KB |
Output is correct |
| 32 |
Correct |
191 ms |
37452 KB |
Output is correct |
| 33 |
Correct |
142 ms |
37596 KB |
Output is correct |
| 34 |
Correct |
155 ms |
37752 KB |
Output is correct |
| 35 |
Correct |
153 ms |
38264 KB |
Output is correct |
| 36 |
Correct |
162 ms |
38748 KB |
Output is correct |
| 37 |
Correct |
161 ms |
38680 KB |
Output is correct |
| 38 |
Correct |
173 ms |
38408 KB |
Output is correct |
| 39 |
Correct |
230 ms |
38356 KB |
Output is correct |
| 40 |
Correct |
268 ms |
40056 KB |
Output is correct |
| 41 |
Correct |
346 ms |
42360 KB |
Output is correct |
