oj.uz

Submission #126339

# Submission time Handle Problem Language Result Execution time Memory
126339 2019-07-07T12:22:49 Z eriksuenderhauf 007 (CEOI14_007) C++11
0 / 100
 412 ms 49300 KB 
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define mem(a,v) memset((a), (v), sizeof (a))
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%lld", &(n))
#define nai(a, n) for (int i = 0; i < (n); i++) ni(a[i])
#define nal(a, n) for (int i = 0; i < (n); i++) nl(a[i])
#define pri(n) printf("%d\n", (n))
#define prl(n) printf("%lld\n", (n))
#define pii pair<int, int>
#define pil pair<int, long long>
#define pll pair<long long, long long>
#define vii vector<pii>
#define vil vector<pil>
#define vll vector<pll>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef cc_hash_table<int,int,hash<int>> ht;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> oset;
const double pi = acos(-1);
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const int MAXN = 1e6 + 5;
const double eps = 1e-9;
int n, m, dp[4][MAXN];
vi adj[MAXN];

pii bfs(int src, int x, int y, int p) {
	deque<int> pq;
	mem(dp[p], 0x3f);
	dp[p][src] = 0;
	pq.pb(src);
	while (!pq.empty()) {
		int u = pq.front(); pq.pop_front();
		for (int v: adj[u]) {
			if (dp[p][v] != 1061109567)
				continue;
			dp[p][v] = dp[p][u] + 1;
			pq.pb(v);
		}
	}
	return mp(dp[p][x], dp[p][y]);
}

int main() {
	int s, d, a, b;
	scanf("%d %d %d %d %d %d", &n, &m, &s, &d, &a, &b);
	for (int i = 1; i <= m; i++) {
		int u, v;
		scanf("%d %d", &u, &v);
		adj[u].pb(v);
		adj[v].pb(u);
	}
	pii a1 = bfs(s, a, b, 0);
	pii a2 = bfs(d, a, b, 1);
	pii a3 = bfs(a, a, b, 2);
	pii a4 = bfs(b, a, b, 3);
	//cerr << a1.fi << "/" << a2.fi << " | " << a1.se << "/" << a2.se << "\n";
	int ans = min(a2.fi - a1.fi, a2.se - a1.se);
	if (a2.fi == a2.se) {
		int mi = INF, ind = 1;
		for (int i = 1; i <= n; i++) {
			if (dp[2][i] != dp[3][i])
				continue;
			if (mi > dp[2][i])
				ind = i;
			mi = min(mi, dp[2][i]);
		}
		if (dp[0][ind] < dp[1][ind])
			ans--;
	}
	
	if (ans < 0) ans = -1;
	pri(ans);
    return 0;
}

Compilation message

007.cpp: In function 'int main()':
007.cpp:68:6: warning: variable 'a3' set but not used [-Wunused-but-set-variable]
  pii a3 = bfs(a, a, b, 2);
      ^~
007.cpp:69:6: warning: variable 'a4' set but not used [-Wunused-but-set-variable]
  pii a4 = bfs(b, a, b, 3);
      ^~
007.cpp:59:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %d %d %d %d", &n, &m, &s, &d, &a, &b);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
007.cpp:62:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &u, &v);
   ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 39416 KB Output is correct
2 Correct 37 ms 39444 KB Output is correct
3 Correct 44 ms 39416 KB Output is correct
4 Incorrect 37 ms 39416 KB Output isn't correct
5 Incorrect 44 ms 39416 KB Output isn't correct
6 Partially correct 44 ms 39544 KB Partially correct
7 Correct 45 ms 39416 KB Output is correct
8 Incorrect 37 ms 39428 KB Output isn't correct
9 Partially correct 44 ms 39420 KB Partially correct
10 Partially correct 37 ms 39416 KB Partially correct
11 Correct 37 ms 39416 KB Output is correct
12 Incorrect 37 ms 39544 KB Output isn't correct
13 Partially correct 37 ms 39544 KB Partially correct
14 Incorrect 39 ms 39388 KB Output isn't correct
15 Partially correct 41 ms 39544 KB Partially correct
16 Correct 38 ms 39512 KB Output is correct
17 Incorrect 39 ms 39544 KB Output isn't correct
18 Correct 37 ms 39544 KB Output is correct
19 Partially correct 37 ms 39416 KB Partially correct
20 Partially correct 44 ms 39544 KB Partially correct
21 Correct 37 ms 39416 KB Output is correct
22 Partially correct 37 ms 39416 KB Partially correct
23 Partially correct 37 ms 39420 KB Partially correct
24 Correct 38 ms 39520 KB Output is correct

Subtask #2
0.0 / 70.0

# Verdict Execution time Memory Grader output
1 Partially correct 67 ms 40696 KB Partially correct
2 Incorrect 89 ms 41392 KB Output isn't correct
3 Partially correct 70 ms 40824 KB Partially correct
4 Incorrect 84 ms 41424 KB Output isn't correct
5 Correct 68 ms 40752 KB Output is correct
6 Correct 73 ms 40828 KB Output is correct
7 Partially correct 77 ms 41020 KB Partially correct
8 Partially correct 76 ms 40952 KB Partially correct
9 Correct 87 ms 41464 KB Output is correct
10 Partially correct 229 ms 45724 KB Partially correct
11 Incorrect 134 ms 42268 KB Output isn't correct
12 Partially correct 141 ms 42972 KB Partially correct
13 Incorrect 124 ms 42488 KB Output isn't correct
14 Correct 114 ms 41952 KB Output is correct
15 Partially correct 153 ms 43128 KB Partially correct
16 Correct 173 ms 43364 KB Output is correct
17 Partially correct 148 ms 42912 KB Partially correct
18 Incorrect 154 ms 42844 KB Output isn't correct
19 Partially correct 187 ms 44168 KB Partially correct
20 Correct 293 ms 46804 KB Output is correct
21 Correct 203 ms 44536 KB Output is correct
22 Partially correct 199 ms 43768 KB Partially correct
23 Correct 201 ms 44384 KB Output is correct
24 Partially correct 211 ms 44408 KB Partially correct
25 Correct 195 ms 44152 KB Output is correct
26 Correct 182 ms 43952 KB Output is correct
27 Partially correct 223 ms 44452 KB Partially correct
28 Correct 238 ms 44408 KB Output is correct
29 Partially correct 234 ms 45264 KB Partially correct
30 Correct 329 ms 47360 KB Output is correct
31 Incorrect 263 ms 45304 KB Output isn't correct
32 Partially correct 234 ms 44568 KB Partially correct
33 Correct 238 ms 44664 KB Output is correct
34 Correct 243 ms 44792 KB Output is correct
35 Correct 216 ms 44664 KB Output is correct
36 Incorrect 231 ms 44892 KB Output isn't correct
37 Correct 262 ms 45564 KB Output is correct
38 Partially correct 256 ms 45436 KB Partially correct
39 Partially correct 284 ms 45560 KB Partially correct
40 Correct 313 ms 47228 KB Output is correct
41 Partially correct 412 ms 49300 KB Partially correct