Submission #9039681

---

Source Code Expand

#include <cstdio>
#include <algorithm>
#include <vector>

typedef long long LL;
const LL Infll = 0x3f3f3f3f3f3f3f3f;
const int MN = 100005;

int N, M, A[MN], B[MN], P[MN], vis[MN];
std::vector<int> G[MN], T[MN];

int fa[MN];
inline int ff(int x) { return fa[x] ? fa[x] = ff(fa[x]) : x; }

LL f[MN], s[MN];

void DFS(int u) {
	s[u] = B[u], f[u] = Infll;
	for (auto v : T[u]) DFS(v), s[u] += s[v];
	for (auto v : T[u]) f[u] = std::min(f[u], s[u] - s[v] + std::max((LL)A[u], f[v]));
	if (T[u].empty()) f[u] = A[u] + B[u];
}

int main() {
	scanf("%d%d", &N, &M);
	for (int i = 1; i <= N; ++i)
		scanf("%d%d", &A[i], &B[i]),
		A[i] = std::max(A[i] - B[i], 0),
		P[i] = i;
	for (int i = 1, x, y; i <= M; ++i)
		scanf("%d%d", &x, &y),
		G[x].push_back(y),
		G[y].push_back(x);
	std::sort(P + 1, P + N + 1, [](int i, int j) { return A[i] < A[j]; });
	for (int i = 1; i <= N; ++i) {
		int u = P[i];
		for (auto v : G[u])
			if (vis[v] && ff(v) != u)
				T[u].push_back(ff(v)),
				fa[ff(v)] = u;
		vis[u] = 1;
	}
	DFS(P[N]);
	printf("%lld\n", f[P[N]]);
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:25:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &N, &M);
                       ^
./Main.cpp:29:11: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   P[i] = i;
           ^
./Main.cpp:33:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   G[y].push_back(x);
                    ^

Judge Result