Submission #2711884


Source Code Expand

#include <bits/stdc++.h>
#define F(i,a,b) for(int i=(a);i<=(b);++i)
#define F_(i,a,b) for(int i=(a);i>=(b);--i)
#define G(i,u) for(int i=head[u];i;i=nxt[i])

typedef long long ll;

const int N = 100005;

template<typename T> inline T min(T& a, T b) {return a<b?a:a=b;}

int head[N], to[N<<1], nxt[N<<1], a[N], b[N], r[N], g[N], son[N], ecnt;
void add(int u, int v) { to[++ecnt] = v; nxt[ecnt] = head[u]; head[u] = ecnt; }
bool cmp(const int& x, const int& y) { return a[x] < a[y]; }
int find(int x) { return g[x] == x? x: g[x] = find(g[x]); }
ll f[N], sum[N];
int main() {
	#ifndef ONLINE_JUDGE
	freopen("in.txt", "r", stdin);
	freopen("out.txt", "w", stdout);
	#endif
	int n, m;
	scanf("%d%d", &n, &m);
	F(i,1,n) {
		scanf("%d%d", &a[i], &b[i]);
		a[i] = std::max(a[i]-b[i],0); 
		r[i] = i;
	}
	F(i,1,m) {
		int u, v;
		scanf("%d%d", &u, &v);
		add(u,v); add(v,u);
	}
	std::sort(r+1,r+n+1,cmp);
	F(i,1,n) {
		int x = r[i], tot = 0; g[x] = x; sum[x] = b[x];
		G(j,x) {
			int v = to[j], p = find(v);
			if(!p || p == x) continue;
			son[++tot] = p;
			sum[x] += sum[p];
			g[p] = x;
		}
		f[x] = a[x] + sum[x];
		F(j,1,tot) min(f[x],sum[x]-sum[son[j]]+std::max(f[son[j]],1ll*a[x]));
	}
	printf("%lld\n", f[r[n]]);
	return 0;
} 

Submission Info

Submission Time
Task F - Donation
User Jeff_Lee
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1275 Byte
Status WA
Exec Time 2 ms
Memory 2304 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:19:31: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
  freopen("in.txt", "r", stdin);
                               ^
./Main.cpp:20:33: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
  freopen("out.txt", "w", stdout);
                                 ^
./Main.cpp:23: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:25:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &a[i], &b[i]);
                              ^
./Main.cpp:31:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused...

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1000
Status
WA × 3
WA × 54
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt, subtask_1_29.txt, subtask_1_30.txt, subtask_1_31.txt, subtask_1_32.txt, subtask_1_33.txt, subtask_1_34.txt, subtask_1_35.txt, subtask_1_36.txt, subtask_1_37.txt, subtask_1_38.txt, subtask_1_39.txt, subtask_1_40.txt, subtask_1_41.txt, subtask_1_42.txt, subtask_1_43.txt, subtask_1_44.txt, subtask_1_45.txt, subtask_1_46.txt, subtask_1_47.txt, subtask_1_48.txt
Case Name Status Exec Time Memory
sample_01.txt WA 2 ms 2304 KB
sample_02.txt WA 1 ms 2304 KB
sample_03.txt WA 2 ms 2304 KB
subtask_1_01.txt WA 2 ms 2304 KB
subtask_1_02.txt WA 2 ms 2304 KB
subtask_1_03.txt WA 2 ms 2304 KB
subtask_1_04.txt WA 2 ms 2304 KB
subtask_1_05.txt WA 2 ms 2304 KB
subtask_1_06.txt WA 2 ms 2304 KB
subtask_1_07.txt WA 2 ms 2304 KB
subtask_1_08.txt WA 2 ms 2304 KB
subtask_1_09.txt WA 2 ms 2304 KB
subtask_1_10.txt WA 2 ms 2304 KB
subtask_1_11.txt WA 2 ms 2304 KB
subtask_1_12.txt WA 2 ms 2304 KB
subtask_1_13.txt WA 2 ms 2304 KB
subtask_1_14.txt WA 1 ms 2304 KB
subtask_1_15.txt WA 2 ms 2304 KB
subtask_1_16.txt WA 2 ms 2304 KB
subtask_1_17.txt WA 2 ms 2304 KB
subtask_1_18.txt WA 2 ms 2304 KB
subtask_1_19.txt WA 1 ms 2304 KB
subtask_1_20.txt WA 2 ms 2304 KB
subtask_1_21.txt WA 2 ms 2304 KB
subtask_1_22.txt WA 2 ms 2304 KB
subtask_1_23.txt WA 2 ms 2304 KB
subtask_1_24.txt WA 2 ms 2304 KB
subtask_1_25.txt WA 1 ms 2304 KB
subtask_1_26.txt WA 2 ms 2304 KB
subtask_1_27.txt WA 2 ms 2304 KB
subtask_1_28.txt WA 2 ms 2304 KB
subtask_1_29.txt WA 2 ms 2304 KB
subtask_1_30.txt WA 2 ms 2304 KB
subtask_1_31.txt WA 2 ms 2304 KB
subtask_1_32.txt WA 2 ms 2304 KB
subtask_1_33.txt WA 2 ms 2304 KB
subtask_1_34.txt WA 2 ms 2304 KB
subtask_1_35.txt WA 2 ms 2304 KB
subtask_1_36.txt WA 2 ms 2304 KB
subtask_1_37.txt WA 2 ms 2304 KB
subtask_1_38.txt WA 2 ms 2304 KB
subtask_1_39.txt WA 2 ms 2304 KB
subtask_1_40.txt WA 2 ms 2304 KB
subtask_1_41.txt WA 2 ms 2304 KB
subtask_1_42.txt WA 2 ms 2304 KB
subtask_1_43.txt WA 2 ms 2304 KB
subtask_1_44.txt WA 2 ms 2304 KB
subtask_1_45.txt WA 2 ms 2304 KB
subtask_1_46.txt WA 2 ms 2304 KB
subtask_1_47.txt WA 2 ms 2304 KB
subtask_1_48.txt WA 2 ms 2304 KB