oj.uz

답안 #555867

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
555867 2022-05-01T18:22:35 Z blue Pipes (BOI13_pipes) C++17
67.5926 / 100
 76 ms 21292 KB 
#include <iostream>
#include <vector>
#include <queue>
using namespace std;

using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;
using vpii = vector<pii>;
using vll = vector<ll>;
#define sz(x) int(x.size())

const int mx = 100'000;

int N, M;
vpii edge[1+mx];
vll c(1+mx);


vll x(1+mx);

void dfs(int u, int p)
{
	for(pii vp : edge[u])
	{
		int v = vp.first;
		int e = vp.second;

		if(v == p) continue;
		dfs(v, u);

		x[e] = 2*c[v];

		c[u] -= c[v];
		c[v] = 0;
	}
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	int N, M;
	cin >> N >> M;

	if(M > N)
	{
		cout << "0\n";
		return 0;
	}

	for(int i = 1; i <= N; i++) cin >> c[i];

	for(int j = 1; j <= M; j++)
	{
		int u, v;
		cin >> u >> v;
		edge[u].push_back({v, j});
		edge[v].push_back({u, j});
	}

	if(M == N-1)
	{
		dfs(1, 0);
	}
	else
	{
		queue<int> tbv;
		vi visit(1+N, 0);

		vi deg(1+N);
		for(int i = 1; i <= N; i++)
		{
			deg[i] = sz(edge[i]);
			if(deg[i] == 1)
			{
				tbv.push(i);
				visit[i] = 1;
			}
		}

		cerr << "A\n";


		while(!tbv.empty())
		{
			int u = tbv.front();
			tbv.pop();

			for(auto vp : edge[u])
			{
				int v = vp.first;
				int e = vp.second;

				if(visit[v]) continue;

				deg[v]--;

				x[e] = 2*c[v];
				c[v] -= c[u];
				c[u] = 0;

				if(!deg[v])
				{
					tbv.push(v);
					visit[v] = 1;
				}
			}
		}

		cerr << "B\n";

		int U = 1;
		while(visit[U])
			U++;

		int viscount = 0;
		for(int u = 1; u <= N; u++)
			viscount += visit[u];

		vi edgevis(1+N, 0);

		cerr << "C\n";

		vi nodes, edges;
		for(int z = 1; z <= N - viscount; z++)
		{
			for(auto vp : edge[U])
			{
				int v = vp.first;
				int e = vp.second;

				if(visit[v]) continue;
				if(edgevis[e]) continue;

				edgevis[e] = 1;


				nodes.push_back(U);
				edges.push_back(e);

				U = v;
			}
		}
		// cerr << "D\n";

		int Z = N - viscount;

		// cerr << "Z = " << Z << '\n';

		// for(int z = 0; z < Z; z++) cerr << nodes[z] << ' ' << edges[z] << '\n';

		if(Z % 2 == 0)
		{
			cout << "0\n";
			return 0;
		}

		vll a(Z), b(Z);
		a[0] = 1;
		b[0] = 0;

		for(int i = 1; i < Z; i++)
		{
			a[i] = -a[i-1];
			b[i] = c[nodes[i]] - b[i-1];
		}

		//(a.back() + a[0]) * x  +  (b.back() + b[0]) == c[nodes[0]]
		//x = (c[nodes[0]] - (b.back() + b[0])) / (a.back() + a[0])

		for(int i = 0; i < Z; i++)
		{
			x[edges[i]] = (2LL * a[i] * (c[nodes[0]] - (b.back() + b[0]))) / (a.back() + a[0]) + b[i];
		}
	}

	for(int e = 1; e <= M; e++) 
		cout << x[e] << '\n';
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4180 KB Output is correct
2 Correct 2 ms 4180 KB Output is correct
3 Correct 2 ms 4180 KB Output is correct
4 Correct 71 ms 8300 KB Output is correct
5 Correct 3 ms 4180 KB Output is correct
6 Correct 2 ms 4180 KB Output is correct
7 Correct 2 ms 4180 KB Output is correct
8 Correct 2 ms 4180 KB Output is correct
9 Correct 3 ms 4180 KB Output is correct
10 Correct 2 ms 4180 KB Output is correct
11 Correct 2 ms 4180 KB Output is correct
12 Correct 3 ms 4308 KB Output is correct
13 Correct 38 ms 7500 KB Output is correct
14 Correct 46 ms 8164 KB Output is correct
15 Correct 51 ms 8396 KB Output is correct
16 Correct 39 ms 7664 KB Output is correct
17 Correct 50 ms 8384 KB Output is correct
18 Correct 52 ms 8368 KB Output is correct
19 Correct 73 ms 11676 KB Output is correct
20 Correct 2 ms 4180 KB Output is correct
21 Correct 3 ms 4180 KB Output is correct
22 Correct 50 ms 8360 KB Output is correct
23 Correct 36 ms 7500 KB Output is correct
24 Correct 48 ms 8352 KB Output is correct
25 Correct 44 ms 7636 KB Output is correct

Subtask #2
37.5925925926 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 4180 KB Output isn't correct
2 Incorrect 2 ms 4180 KB Output isn't correct
3 Runtime error 63 ms 19668 KB Execution killed with signal 11
4 Correct 2 ms 4180 KB Output is correct
5 Correct 2 ms 4180 KB Output is correct
6 Correct 2 ms 4180 KB Output is correct
7 Incorrect 2 ms 4180 KB Output isn't correct
8 Incorrect 2 ms 4180 KB Output isn't correct
9 Runtime error 6 ms 8404 KB Execution killed with signal 6
10 Correct 2 ms 4180 KB Output is correct
11 Correct 2 ms 4180 KB Output is correct
12 Correct 2 ms 4180 KB Output is correct
13 Correct 2 ms 4180 KB Output is correct
14 Incorrect 2 ms 4180 KB Output isn't correct
15 Incorrect 3 ms 4180 KB Output isn't correct
16 Runtime error 7 ms 8552 KB Execution killed with signal 6
17 Correct 3 ms 4180 KB Output is correct
18 Correct 2 ms 4180 KB Output is correct
19 Correct 2 ms 4180 KB Output is correct
20 Correct 2 ms 4180 KB Output is correct
21 Correct 2 ms 4180 KB Output is correct
22 Incorrect 2 ms 4312 KB Output isn't correct
23 Runtime error 42 ms 18144 KB Execution killed with signal 11
24 Runtime error 76 ms 21092 KB Execution killed with signal 11
25 Runtime error 48 ms 19660 KB Execution killed with signal 11
26 Correct 2 ms 4180 KB Output is correct
27 Correct 2 ms 4180 KB Output is correct
28 Correct 3 ms 4180 KB Output is correct
29 Correct 2 ms 4180 KB Output is correct
30 Runtime error 46 ms 20160 KB Execution killed with signal 11
31 Runtime error 46 ms 20276 KB Execution killed with signal 11
32 Incorrect 40 ms 9164 KB Output isn't correct
33 Runtime error 53 ms 20928 KB Execution killed with signal 11
34 Correct 3 ms 4180 KB Output is correct
35 Correct 3 ms 4180 KB Output is correct
36 Correct 3 ms 4180 KB Output is correct
37 Correct 3 ms 4180 KB Output is correct
38 Runtime error 62 ms 21292 KB Execution killed with signal 11
39 Runtime error 46 ms 20248 KB Execution killed with signal 11
40 Runtime error 56 ms 21224 KB Execution killed with signal 11
41 Runtime error 43 ms 20280 KB Execution killed with signal 11
42 Correct 2 ms 4180 KB Output is correct
43 Correct 2 ms 4180 KB Output is correct
44 Correct 2 ms 4180 KB Output is correct
45 Correct 2 ms 4180 KB Output is correct
46 Incorrect 54 ms 8460 KB Output isn't correct
47 Incorrect 46 ms 9292 KB Output isn't correct
48 Incorrect 37 ms 8680 KB Output isn't correct
49 Correct 37 ms 8908 KB Output is correct
50 Correct 2 ms 4180 KB Output is correct
51 Correct 2 ms 4180 KB Output is correct
52 Correct 2 ms 4180 KB Output is correct
53 Correct 2 ms 4180 KB Output is correct
54 Runtime error 47 ms 20820 KB Execution killed with signal 11