Submission #3879114

---

Source Code Expand

#include <stdio.h>  
#include <algorithm>  
#include <assert.h>
#include <bitset>
#include <cmath>  
#include <complex>  
#include <deque>  
#include <functional>  
#include <iostream>  
#include <limits.h>  
#include <map>  
#include <math.h>  
#include <queue>  
#include <set>  
#include <stdlib.h>  
#include <string.h>  
#include <string>  
#include <time.h>  
#include <unordered_map>  
#include <unordered_set>  
#include <vector>  

#pragma warning(disable:4996)  
#pragma comment(linker, "/STACK:336777216")  
using namespace std;

#define mp make_pair  
#define Fi first  
#define Se second  
#define pb(x) push_back(x)  
#define szz(x) ((int)(x).size())  
#define rep(i, n) for(int i=0;i<n;i++)  
#define all(x) (x).begin(), (x).end()  
#define ldb ldouble  

typedef unsigned int uint;
typedef tuple<int, int, int> t3;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef pair <ll, int> pli;
typedef pair <db, db> pdd;

int IT_MAX = 1 << 19;
const ll MOD = 1000000007;
const int INF = 0x3f3f3f3f;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
const db PI = acos(-1);
const db ERR = 1e-10;

const int MX = 200005;

struct UF{
	int t[MX];
	ll ans[MX], tB[MX];
	int find(int x){ return t[x] ? t[x] = find(t[x]) : x; }
	int merge(int a, int b){ // a <- b
		a = find(a), b = find(b);
		if(a == b) return false;
		t[b] = a; tB[a] += tB[b]; return true;
	}
}uf;

int N, M;
pii D[MX];
vector<int> G[MX];
int P[MX], chk[MX];

int main()
{
	scanf("%d%d", &N, &M);
	for(int i = 1; i <= N; i++) scanf("%d%d", &D[i].first, &D[i].second);
	for(int i = 1; i <= M; i++){
		int a, b;
		scanf("%d%d", &a, &b);
		G[a].push_back(b);
		G[b].push_back(a);
	}
	for(int i = 1; i <= N; i++) P[i] = i;
	sort(P+1, P+N+1, [](int l, int r){ 
		return D[l].first - D[l].second < D[r].first - D[r].second;
	});
	for(int i = 1; i <= N; i++) uf.tB[i] = D[i].second;
	for(int i = 1; i <= N; i++){
		int cur = P[i], A = D[cur].first, B = D[cur].second;
		ll ans = max(A-B, 0);
		for(int c : G[cur]){
			if(!chk[c]) continue;
			int u = uf.find(c);
			ans = min(ans, max(uf.ans[u], A - (B+uf.tB[u])));
		}
		uf.ans[cur] = ans;
		for(int c : G[cur]) if(chk[c]) uf.merge(cur, c);
		chk[cur] = 1;
	}
	int p = uf.find(1);
	printf("%lld\n", uf.ans[p] + uf.tB[p]);
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:74: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:75:70: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for(int i = 1; i <= N; i++) scanf("%d%d", &D[i].first, &D[i].second);
                                                                      ^
./Main.cpp:78:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &a, &b);
                        ^

Judge Result