Submission #1612678
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
Submission Time
2017-09-23 06:56:18+0900
Task
C - 浮気調査
User
iroha168
Language
C++14 (GCC 5.4.1)
Score
0
Code Size
1261 Byte
Status
RE
Exec Time
96 ms
Memory
256 KB
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
Set Name
All
Score / Max Score
0 / 100
Status
Set Name
Test Cases
All
sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt
Case Name
Status
Exec Time
Memory
sample_01.txt
WA
1 ms
256 KB
sample_02.txt
WA
1 ms
256 KB
sample_03.txt
WA
1 ms
256 KB
sample_04.txt
WA
1 ms
256 KB
test_01.txt
RE
96 ms
256 KB
test_02.txt
RE
95 ms
256 KB
test_03.txt
RE
94 ms
256 KB
test_04.txt
RE
95 ms
256 KB
test_05.txt
RE
95 ms
256 KB
test_06.txt
RE
95 ms
256 KB
test_07.txt
RE
95 ms
256 KB
test_08.txt
RE
94 ms
256 KB
test_09.txt
RE
94 ms
256 KB
test_10.txt
RE
95 ms
256 KB
test_11.txt
RE
95 ms
256 KB
test_12.txt
RE
95 ms
256 KB
test_13.txt
RE
95 ms
256 KB
test_14.txt
RE
94 ms
256 KB
test_15.txt
RE
95 ms
256 KB
test_16.txt
RE
94 ms
256 KB
test_17.txt
RE
95 ms
256 KB
test_18.txt
RE
95 ms
256 KB
test_19.txt
RE
94 ms
256 KB
test_20.txt
RE
95 ms
256 KB
test_21.txt
RE
94 ms
256 KB
test_22.txt
RE
95 ms
256 KB
test_23.txt
RE
95 ms
256 KB
test_24.txt
RE
95 ms
256 KB
test_25.txt
RE
94 ms
256 KB
test_26.txt
RE
95 ms
256 KB
test_27.txt
RE
96 ms
256 KB
test_28.txt
RE
96 ms
256 KB
test_29.txt
RE
95 ms
256 KB
test_30.txt
RE
95 ms
256 KB
test_31.txt
RE
94 ms
256 KB