Submission #1612679

---

Source Code Expand

 
#
#include<iostream>
#include<algorithm>
#include<set>
#include<unordered_set>
#include<math.h>
#include<vector>
#include<sstream>
#include<queue>
#include<functional>
#include<bitset>
#include<cstdio>
#include<iomanip>
#include<stack>
#include <cstring>
#include <climits>
#include<string>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
struct edge { int to, cap, rev; };
vector<edge>E[200];
bool used[200];
void add_edge(int from, int to, int cap) {
 
	E[from].push_back({ to,cap,(int)E[to].size() });
	E[to].push_back({ from,0,(int)E[from].size() - 1 });
}
int dfs(int v, int t, int f) {
	if (v == t)return f;
	used[v] = true;
	for (edge&e : E[v]) {
		if (!used[e.to] && e.cap > 0) {
			int d = dfs(e.to, t, min(f, e.cap));
			if (d > 0) {
				e.cap -= d;
				E[e.to][e.rev].cap += d;
				return d;
			}
		}
	}
	return 0;
}
int main() {
	int n, g, e; scanf("%d%d%d", &n, &g, &e);
	rep(i, g) {
		int p; scanf("%d", &p);
		add_edge(p, n, 1);
	}
	rep(i, e) {
		int a, b; scanf("%d%d", &a, &b);
		add_edge(a, b, 1); add_edge(b, a, 1);
	}
	int ans = 0;
	while (1) {
		memset(used, 0, sizeof(used));
		int f = dfs(0, n, INT_MAX);
		if (f == 0)break;
		ans += f;
	}
	printf("%d\n", ans);
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:45:42: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  int n, g, e; scanf("%d%d%d", &n, &g, &e);
                                          ^
./Main.cpp:47:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   int p; scanf("%d", &p);
                         ^
./Main.cpp:51:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   int a, b; scanf("%d%d", &a, &b);
                                  ^

Judge Result