Submission #110769

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
110769	2019-05-12T08:02:19 Z	ckodser	Pipes (BOI13_pipes)	C++14	74.0741 / 100	203 ms	14768 KB

pipes

#include<bits/stdc++.h>
#define pb push_back
using namespace std;
typedef long long ll;
const int N = 100005;
int n, m, cv, cu, A[N], B[N], M[N], P[N], R[N];
ll C[N], D[N];
vector < int > Adj[N];
void DFSC(int v, int p)
{
	M[v] = 1;
	for (int id : Adj[v])
		if (id != p)
		{
			int u = A[id] ^ B[id] ^ v;
			if (M[u])
				cv = v, cu = u;
			if (!M[u])
				P[u] = v, DFSC(u, id);
		}
}
void DFS(int v, int p)
{
	for (int id : Adj[v])
		if (id != p)
			DFS(A[id] ^ B[id] ^ v, id);
	int par = A[p] ^ B[p] ^ v;
	D[p] += C[v] + C[v];
	C[par] -= C[v];
	C[v] = 0;
}
void DFS2(int v, int p)
{
	M[v] = 2;
	P[v] = p;
	R[v] = Adj[v][0] ^ Adj[v][1] ^ p;
	int u = A[R[v]] ^ B[R[v]] ^ v;
	if (M[u] != 2)
		DFS2(u, R[v]);
}
int main()
{
	scanf("%d%d", &n, &m);
	if (m > n) return !printf("0\n");
	for (int i = 1; i <= n; i++)
		scanf("%lld", &C[i]);
	for (int i = 1; i <= m; i++)
	{
		scanf("%d%d", &A[i], &B[i]);
		Adj[A[i]].pb(i);
		Adj[B[i]].pb(i);
	}
	DFSC(1, 0);
	if (!cv)
		cv = cu = 1;
	vector < int > vec;
	vec.pb(cu);
	while (cv != cu)
		cu = P[cu], vec.pb(cu);
	if ((int)vec.size() % 2 == 0)
		return !printf("0\n");
	memset(M, 0, sizeof(M));
	for (int v : vec)
		M[v] = 1;
	for (int v : vec)
		for (int id : Adj[v])
		{
			int u = A[id] ^ B[id] ^ v;
			if (!M[u]) DFS(u, id);
		}
	if (vec.size() > 1)
	{
		for (int v : vec)
			for (int i = 0; i < (int)Adj[v].size(); i++)
			{
				int id = Adj[v][i];
				if (!M[A[id] ^ B[id] ^ v])
					swap(Adj[v][i], Adj[v].back()), Adj[v].pop_back(), i --;
			}
		int idd = Adj[vec[0]][0];
		if ((A[idd] ^ B[idd] ^ vec[0]) != vec[1])
			DFS2(vec[0], Adj[vec[0]][0]);
		else
			DFS2(vec[0], Adj[vec[0]][1]);
		vector < ll > Df(vec.size(), 0);
		for (int i = 2; i != 0; i = (i + 2) % (int)vec.size())
		{
			int p1 = i - 1;
			int p2 = i - 2;
			if (p1 < 0)
				p1 += (int)vec.size();
			if (p2 < 0)
				p2 += (int)vec.size();
			Df[i] = Df[p2] - C[vec[p2]] + C[vec[p1]];
		}
		ll sum = 0;
		for (int i = 0; i < (int)vec.size(); i++)
			sum += C[vec[i]];
		sum /= 2;
		for (int i = 0; i < (int)vec.size(); i++)
			sum -= Df[i];
		sum /= (int)vec.size();
		for (int i = 0; i < (int)vec.size(); i++)
			D[P[vec[i]]] += sum + Df[i];
	}
	for (int i = 1; i <= m; i++)
		printf("%lld\n", D[i]);
	return 0;
}

Compilation message

pipes.cpp: In function 'int main()':
pipes.cpp:43:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &m);
  ~~~~~^~~~~~~~~~~~~~~~
pipes.cpp:46:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld", &C[i]);
   ~~~~~^~~~~~~~~~~~~~~
pipes.cpp:49:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &A[i], &B[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1

30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	3072 KB	Output is correct
2	Correct	4 ms	3072 KB	Output is correct
3	Correct	5 ms	3200 KB	Output is correct
4	Correct	126 ms	9396 KB	Output is correct
5	Correct	5 ms	3072 KB	Output is correct
6	Correct	6 ms	3072 KB	Output is correct
7	Correct	5 ms	3072 KB	Output is correct
8	Correct	5 ms	3072 KB	Output is correct
9	Correct	6 ms	3072 KB	Output is correct
10	Correct	6 ms	3200 KB	Output is correct
11	Correct	5 ms	3072 KB	Output is correct
12	Correct	7 ms	3200 KB	Output is correct
13	Correct	138 ms	8184 KB	Output is correct
14	Correct	83 ms	9112 KB	Output is correct
15	Correct	94 ms	9540 KB	Output is correct
16	Correct	76 ms	8440 KB	Output is correct
17	Correct	129 ms	9532 KB	Output is correct
18	Correct	128 ms	9592 KB	Output is correct
19	Correct	179 ms	11640 KB	Output is correct
20	Correct	5 ms	3072 KB	Output is correct
21	Correct	5 ms	3072 KB	Output is correct
22	Correct	132 ms	9464 KB	Output is correct
23	Correct	148 ms	8084 KB	Output is correct
24	Correct	129 ms	9448 KB	Output is correct
25	Correct	86 ms	8480 KB	Output is correct

Subtask #2

44.0740740741 / 70.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	4 ms	3072 KB	Output isn't correct
2	Incorrect	5 ms	3200 KB	Output isn't correct
3	Correct	97 ms	10416 KB	Output is correct
4	Correct	4 ms	2688 KB	Output is correct
5	Correct	5 ms	2688 KB	Output is correct
6	Correct	4 ms	2688 KB	Output is correct
7	Incorrect	5 ms	3072 KB	Output isn't correct
8	Incorrect	5 ms	3072 KB	Output isn't correct
9	Correct	5 ms	2688 KB	Output is correct
10	Correct	4 ms	2688 KB	Output is correct
11	Correct	4 ms	2688 KB	Output is correct
12	Correct	4 ms	2688 KB	Output is correct
13	Correct	4 ms	2688 KB	Output is correct
14	Incorrect	4 ms	3072 KB	Output isn't correct
15	Incorrect	6 ms	3200 KB	Output isn't correct
16	Incorrect	5 ms	3200 KB	Output isn't correct
17	Correct	5 ms	2816 KB	Output is correct
18	Correct	5 ms	2688 KB	Output is correct
19	Correct	5 ms	2684 KB	Output is correct
20	Correct	5 ms	2688 KB	Output is correct
21	Correct	3 ms	2688 KB	Output is correct
22	Incorrect	5 ms	3200 KB	Output isn't correct
23	Incorrect	122 ms	11384 KB	Output isn't correct
24	Incorrect	163 ms	12788 KB	Output isn't correct
25	Correct	103 ms	10388 KB	Output is correct
26	Correct	4 ms	2688 KB	Output is correct
27	Correct	5 ms	2688 KB	Output is correct
28	Correct	5 ms	2688 KB	Output is correct
29	Correct	5 ms	2688 KB	Output is correct
30	Incorrect	154 ms	13984 KB	Output isn't correct
31	Incorrect	203 ms	14768 KB	Output isn't correct
32	Incorrect	126 ms	10868 KB	Output isn't correct
33	Correct	114 ms	11216 KB	Output is correct
34	Correct	5 ms	2688 KB	Output is correct
35	Correct	4 ms	2688 KB	Output is correct
36	Correct	5 ms	2688 KB	Output is correct
37	Correct	5 ms	2688 KB	Output is correct
38	Incorrect	170 ms	13608 KB	Output isn't correct
39	Incorrect	103 ms	10688 KB	Output isn't correct
40	Incorrect	153 ms	12536 KB	Output isn't correct
41	Correct	103 ms	12916 KB	Output is correct
42	Correct	4 ms	2688 KB	Output is correct
43	Correct	5 ms	2688 KB	Output is correct
44	Correct	5 ms	2688 KB	Output is correct
45	Correct	4 ms	2688 KB	Output is correct
46	Incorrect	152 ms	14520 KB	Output isn't correct
47	Incorrect	171 ms	12628 KB	Output isn't correct
48	Incorrect	126 ms	14452 KB	Output isn't correct
49	Correct	71 ms	8700 KB	Output is correct
50	Correct	4 ms	2688 KB	Output is correct
51	Correct	4 ms	2688 KB	Output is correct
52	Correct	4 ms	2688 KB	Output is correct
53	Correct	4 ms	2688 KB	Output is correct
54	Incorrect	165 ms	12988 KB	Output isn't correct