Submission #29812

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
29812	2017-07-21T07:41:59 Z	cdemirer	007 (CEOI14_007)	C++14	30 / 100	899 ms	26580 KB

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> llp;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
#define mp(x, y) make_pair(x, y)
#define pb(x) push_back(x)

int N, M;
int Z, D, SV1, SV2;
vvi edges;
int Ddists[200000], Zdists[200000];
int Dparents[200000];

void dijsktra(int *dists, int s) {
	set<ii> S;
	for (int i = 0; i < N; i++) {
		if (i == s) {
			dists[i] = 0;
			S.insert(mp(dists[i], i));
			continue;
		}
		dists[i] = (int)1e9;
		S.insert(mp(dists[i], i));
	}
	while ( ! S.empty() ) {
		ii x = *S.begin();
		S.erase(S.begin());
		for (int i = 0; i < edges[x.second].size(); i++) {
			if (dists[x.second] + 1 < dists[edges[x.second][i]]) {
				S.erase(mp(dists[edges[x.second][i]], edges[x.second][i]));
				dists[edges[x.second][i]] = dists[x.second] + 1;
				if (s == D) Dparents[edges[x.second][i]] = x.second;
				S.insert(mp(dists[edges[x.second][i]], edges[x.second][i]));
			}
		}
	}
}

int main(int argc, char **argv) {

	//freopen("input", "r", stdin);
	//freopen("output", "w", stdout);

	scanf("%d%d", &N, &M);
	scanf("%d%d%d%d", &Z, &D, &SV1, &SV2);
	Z--; D--; SV1--; SV2--;
	edges.resize(N);
	for (int i = 0; i < M; i++) {
		int a, b; scanf("%d%d", &a, &b);
		a--, b--;
		edges[a].pb(b);
		edges[b].pb(a);
	}
	Dparents[D] = -1;
	dijsktra(Ddists, D);
	dijsktra(Zdists, Z);

	int best1 = -1;
	int best2 = -1;
	int x = SV1;
	while (x != -1) {
		//if (x) cerr << x << endl;
		int fark = Ddists[x] - Zdists[x];
		best1 = max(best1, fark);
		x = Dparents[x];
	}
	x = SV2;
	while (x != -1) {
		int fark = Ddists[x] - Zdists[x];
		best2 = max(best2, fark);
		x = Dparents[x];
	}
	int ans = min(best1, best2);
	if (Dparents[SV1] == SV2) ans = best2;
	if (Dparents[SV2] == SV1) ans = best1;
	printf("%d\n", (ans!=-1?ans-1:-1));

	return 0;
}

Compilation message

007.cpp: In function 'void dijsktra(int*, int)':
007.cpp:33:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < edges[x.second].size(); i++) {
                     ^
007.cpp: In function 'int main(int, char**)':
007.cpp:49:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &N, &M);
                       ^
007.cpp:50:39: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d%d", &Z, &D, &SV1, &SV2);
                                       ^
007.cpp:54:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int a, b; scanf("%d%d", &a, &b);
                                  ^

Subtask #1
9.0 / 30.0

#	Verdict	Memory	Grader output
1	Partially correct	4368 KB	Partially correct
2	Partially correct	4368 KB	Partially correct
3	Partially correct	4368 KB	Partially correct
4	Correct	4368 KB	Output is correct
5	Correct	4368 KB	Output is correct
6	Partially correct	4368 KB	Partially correct
7	Partially correct	4368 KB	Partially correct
8	Correct	4368 KB	Output is correct
9	Partially correct	4368 KB	Partially correct
10	Partially correct	4368 KB	Partially correct
11	Partially correct	4368 KB	Partially correct
12	Correct	4368 KB	Output is correct
13	Partially correct	4500 KB	Partially correct
14	Correct	4368 KB	Output is correct
15	Partially correct	4368 KB	Partially correct
16	Correct	4368 KB	Output is correct
17	Correct	4500 KB	Output is correct
18	Correct	4500 KB	Output is correct
19	Partially correct	4500 KB	Partially correct
20	Partially correct	4500 KB	Partially correct
21	Partially correct	4500 KB	Partially correct
22	Partially correct	4500 KB	Partially correct
23	Partially correct	4500 KB	Partially correct
24	Correct	4500 KB	Output is correct

Subtask #2
21.0 / 70.0

#	Verdict	Execution time	Memory	Grader output
1	Partially correct	89 ms	8492 KB	Partially correct
2	Correct	159 ms	10380 KB	Output is correct
3	Partially correct	99 ms	8808 KB	Partially correct
4	Correct	136 ms	10564 KB	Output is correct
5	Partially correct	116 ms	8312 KB	Partially correct
6	Partially correct	126 ms	8984 KB	Partially correct
7	Partially correct	99 ms	9348 KB	Partially correct
8	Partially correct	163 ms	9348 KB	Partially correct
9	Correct	169 ms	9900 KB	Output is correct
10	Partially correct	419 ms	14780 KB	Partially correct
11	Correct	346 ms	13620 KB	Output is correct
12	Partially correct	463 ms	15860 KB	Partially correct
13	Correct	349 ms	14308 KB	Output is correct
14	Correct	199 ms	12768 KB	Output is correct
15	Partially correct	526 ms	16192 KB	Partially correct
16	Partially correct	489 ms	16736 KB	Partially correct
17	Partially correct	376 ms	15508 KB	Partially correct
18	Correct	429 ms	15508 KB	Output is correct
19	Partially correct	466 ms	16740 KB	Partially correct
20	Correct	686 ms	19736 KB	Output is correct
21	Correct	433 ms	20680 KB	Output is correct
22	Partially correct	599 ms	18444 KB	Partially correct
23	Partially correct	569 ms	20488 KB	Partially correct
24	Partially correct	503 ms	20324 KB	Partially correct
25	Correct	643 ms	19464 KB	Output is correct
26	Partially correct	579 ms	18628 KB	Partially correct
27	Partially correct	706 ms	20664 KB	Partially correct
28	Partially correct	599 ms	20668 KB	Partially correct
29	Partially correct	619 ms	19916 KB	Partially correct
30	Correct	719 ms	21412 KB	Output is correct
31	Correct	743 ms	23084 KB	Output is correct
32	Partially correct	729 ms	20480 KB	Partially correct
33	Partially correct	616 ms	21024 KB	Partially correct
34	Correct	666 ms	21852 KB	Output is correct
35	Correct	523 ms	21188 KB	Output is correct
36	Correct	646 ms	21864 KB	Output is correct
37	Partially correct	719 ms	24112 KB	Partially correct
38	Partially correct	663 ms	23744 KB	Partially correct
39	Partially correct	853 ms	23748 KB	Partially correct
40	Correct	729 ms	24720 KB	Output is correct
41	Partially correct	899 ms	26580 KB	Partially correct

Submission #29812

Compilation message

Subtask #1 9.0 / 30.0

Subtask #2 21.0 / 70.0

Subtask #1
9.0 / 30.0

Subtask #2
21.0 / 70.0