Submission #110759

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
110759	2019-05-12T07:53:32 Z	ckodser	Pipes (BOI13_pipes)	C++14	74.0741 / 100	180 ms	14520 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() - 1;
			if (p2 < 0)
				p2 = (int)vec.size() - 1;
			Df[i] = Df[i] - 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	6 ms	3072 KB	Output is correct
2	Correct	5 ms	3072 KB	Output is correct
3	Correct	5 ms	3200 KB	Output is correct
4	Correct	143 ms	9476 KB	Output is correct
5	Correct	9 ms	3072 KB	Output is correct
6	Correct	5 ms	3072 KB	Output is correct
7	Correct	6 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	5 ms	3200 KB	Output is correct
11	Correct	6 ms	3072 KB	Output is correct
12	Correct	6 ms	3200 KB	Output is correct
13	Correct	96 ms	8112 KB	Output is correct
14	Correct	112 ms	9208 KB	Output is correct
15	Correct	145 ms	9464 KB	Output is correct
16	Correct	100 ms	8440 KB	Output is correct
17	Correct	119 ms	9508 KB	Output is correct
18	Correct	118 ms	9448 KB	Output is correct
19	Correct	159 ms	11652 KB	Output is correct
20	Correct	4 ms	3072 KB	Output is correct
21	Correct	5 ms	3072 KB	Output is correct
22	Correct	134 ms	9472 KB	Output is correct
23	Correct	89 ms	8144 KB	Output is correct
24	Correct	142 ms	9464 KB	Output is correct
25	Correct	86 ms	8484 KB	Output is correct

Subtask #2

44.0740740741 / 70.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	5 ms	3072 KB	Output isn't correct
2	Incorrect	5 ms	3228 KB	Output isn't correct
3	Correct	94 ms	10336 KB	Output is correct
4	Correct	5 ms	2688 KB	Output is correct
5	Correct	4 ms	2688 KB	Output is correct
6	Correct	4 ms	2660 KB	Output is correct
7	Incorrect	5 ms	3200 KB	Output isn't correct
8	Incorrect	5 ms	3116 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	3 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	6 ms	3200 KB	Output isn't correct
17	Correct	4 ms	2816 KB	Output is correct
18	Correct	4 ms	2688 KB	Output is correct
19	Correct	4 ms	2688 KB	Output is correct
20	Correct	4 ms	2688 KB	Output is correct
21	Correct	4 ms	2688 KB	Output is correct
22	Incorrect	5 ms	3200 KB	Output isn't correct
23	Incorrect	123 ms	11352 KB	Output isn't correct
24	Incorrect	154 ms	12632 KB	Output isn't correct
25	Correct	90 ms	10352 KB	Output is correct
26	Correct	4 ms	2688 KB	Output is correct
27	Correct	4 ms	2688 KB	Output is correct
28	Correct	4 ms	2688 KB	Output is correct
29	Correct	5 ms	2688 KB	Output is correct
30	Incorrect	169 ms	14016 KB	Output isn't correct
31	Incorrect	180 ms	14520 KB	Output isn't correct
32	Incorrect	153 ms	10868 KB	Output isn't correct
33	Correct	105 ms	11224 KB	Output is correct
34	Correct	4 ms	2688 KB	Output is correct
35	Correct	4 ms	2688 KB	Output is correct
36	Correct	4 ms	2604 KB	Output is correct
37	Correct	5 ms	2688 KB	Output is correct
38	Incorrect	167 ms	13592 KB	Output isn't correct
39	Incorrect	124 ms	10488 KB	Output isn't correct
40	Incorrect	161 ms	12340 KB	Output isn't correct
41	Correct	124 ms	12884 KB	Output is correct
42	Correct	4 ms	2688 KB	Output is correct
43	Correct	5 ms	2688 KB	Output is correct
44	Correct	4 ms	2688 KB	Output is correct
45	Correct	5 ms	2688 KB	Output is correct
46	Incorrect	173 ms	14488 KB	Output isn't correct
47	Incorrect	163 ms	12592 KB	Output isn't correct
48	Incorrect	141 ms	14416 KB	Output isn't correct
49	Correct	82 ms	8796 KB	Output is correct
50	Correct	3 ms	2688 KB	Output is correct
51	Correct	4 ms	2688 KB	Output is correct
52	Correct	3 ms	2688 KB	Output is correct
53	Correct	4 ms	2688 KB	Output is correct
54	Incorrect	155 ms	13188 KB	Output isn't correct