oj.uz

답안 #126346

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
126346 2019-07-07T12:29:26 Z eriksuenderhauf 007 (CEOI14_007) C++11
27 / 100
 404 ms 49272 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 && a1.fi == a2.fi) {
		return -1;
		int mi = INF, i1 = 1;
		for (int i = 1; i <= n; i++) {
			if (dp[2][i] != dp[3][i])
				continue;
			if (dp[2][i] + dp[1][i] != a2.fi)
				continue;
			cerr << i << " " << dp[2][i] << " " << dp[1][i] << " " << dp[0][i] << "\n";
			if (mi > dp[2][i])
				i1 = i;
			mi = min(mi, dp[2][i]);
		}
		mi = INF, i1 = 1;
		for (int i = 1; i <= n; i++) {
			if (dp[2][i] != dp[3][i])
				continue;
			if (dp[2][i] + dp[0][i] != a1.fi)
				continue;
			cerr << i << " " << dp[2][i] << " " << dp[1][i] << " " << dp[0][i] << "\n";
			if (mi > dp[2][i])
				i1 = i;
			mi = min(mi, dp[2][i]);
		}
	}
	if (a2.fi == a2.se) ans--;
	if (ans < 0) ans = -1;
	pri(ans);
    return 0;
}

Compilation message

007.cpp: In function 'int main()':
007.cpp:74:17: warning: variable 'i1' set but not used [-Wunused-but-set-variable]
   int mi = INF, i1 = 1;
                 ^~
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
6.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 36 ms 39416 KB Execution failed because the return code was nonzero
2 Correct 36 ms 39416 KB Output is correct
3 Runtime error 36 ms 39432 KB Execution failed because the return code was nonzero
4 Correct 36 ms 39428 KB Output is correct
5 Correct 37 ms 39416 KB Output is correct
6 Partially correct 37 ms 39488 KB Partially correct
7 Partially correct 36 ms 39416 KB Partially correct
8 Correct 36 ms 39544 KB Output is correct
9 Partially correct 36 ms 39416 KB Partially correct
10 Partially correct 36 ms 39420 KB Partially correct
11 Correct 36 ms 39388 KB Output is correct
12 Correct 36 ms 39416 KB Output is correct
13 Partially correct 42 ms 39516 KB Partially correct
14 Correct 36 ms 39416 KB Output is correct
15 Partially correct 36 ms 39416 KB Partially correct
16 Correct 37 ms 39544 KB Output is correct
17 Correct 37 ms 39416 KB Output is correct
18 Correct 37 ms 39544 KB Output is correct
19 Partially correct 37 ms 39412 KB Partially correct
20 Partially correct 37 ms 39420 KB Partially correct
21 Correct 37 ms 39544 KB Output is correct
22 Partially correct 37 ms 39544 KB Partially correct
23 Partially correct 37 ms 39516 KB Partially correct
24 Correct 38 ms 39544 KB Output is correct

Subtask #2
21.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 68 ms 40696 KB Partially correct
2 Correct 81 ms 41464 KB Output is correct
3 Partially correct 69 ms 40824 KB Partially correct
4 Correct 83 ms 41336 KB Output is correct
5 Correct 67 ms 40648 KB Output is correct
6 Correct 67 ms 40856 KB Output is correct
7 Partially correct 72 ms 40952 KB Partially correct
8 Partially correct 74 ms 40952 KB Partially correct
9 Correct 88 ms 41464 KB Output is correct
10 Partially correct 229 ms 45660 KB Partially correct
11 Correct 130 ms 42232 KB Output is correct
12 Partially correct 150 ms 43004 KB Partially correct
13 Correct 141 ms 42488 KB Output is correct
14 Correct 109 ms 41976 KB Output is correct
15 Partially correct 141 ms 43128 KB Partially correct
16 Correct 162 ms 43256 KB Output is correct
17 Partially correct 171 ms 42872 KB Partially correct
18 Correct 146 ms 42844 KB Output is correct
19 Partially correct 190 ms 44052 KB Partially correct
20 Correct 306 ms 46924 KB Output is correct
21 Correct 223 ms 44576 KB Output is correct
22 Partially correct 196 ms 43860 KB Partially correct
23 Correct 208 ms 44408 KB Output is correct
24 Partially correct 201 ms 44340 KB Partially correct
25 Correct 202 ms 44152 KB Output is correct
26 Correct 202 ms 43916 KB Output is correct
27 Partially correct 236 ms 44680 KB Partially correct
28 Partially correct 231 ms 44536 KB Partially correct
29 Partially correct 255 ms 45304 KB Partially correct
30 Correct 311 ms 47480 KB Output is correct
31 Correct 261 ms 45376 KB Output is correct
32 Partially correct 221 ms 44408 KB Partially correct
33 Correct 243 ms 44792 KB Output is correct
34 Correct 232 ms 44792 KB Output is correct
35 Correct 211 ms 44664 KB Output is correct
36 Correct 208 ms 44920 KB Output is correct
37 Correct 256 ms 45580 KB Output is correct
38 Partially correct 325 ms 45468 KB Partially correct
39 Partially correct 331 ms 45560 KB Partially correct
40 Correct 296 ms 47224 KB Output is correct
41 Partially correct 404 ms 49272 KB Partially correct