Submission #2215439

---

Source Code Expand

#include <bits/stdc++.h>
// #include "ane.cpp"

const int INF  = 1e9;
const long long INFLL = 1e18;
const int NMAX = 105;
const int MMAX = 10005;
const int KMAX = 1005;
const int MOD  = 1e9 + 7;
using namespace std;

// comment to disable debug functions
// #define DEBUG

// frequently used macros

#if __cplusplus >= 201103L
#define ALL(v) begin(v),end(v)
#define SORT(v) sort(begin(v), end(v))
#define FIND(v,x) find(begin(v), end(v), (x))
#else
#define ALL(v) (v).begin(),(v).end()
#define SORT(v) sort(v.begin(), v.end())
#define FIND(v,x) find(v.begin(), v.end(), (x))
#endif

#define fi first
#define se second

#define MEMNEXT(from, to) do{ memmove((to), (from), sizeof(from)); \
memset((from), 0, sizeof(from)); } while(0)
#ifdef DEBUG
#define DUMP(x) do{ std::cerr << (#x) << ": " << x << std::endl; }while(0)
#else
#define DUMP(x) do{}while(0)
#endif

// frequent used aliases
typedef long long ll;
typedef pair<int, int> p;
typedef pair<ll, int> lp;
typedef pair<ll, ll> llp;
typedef vector<int> vec;
typedef vector<ll> vecll;
typedef vector<vec> mat;
typedef vector<vecll> matll;

// frequently used constants
static const int di[] = {-1, 0, 1, -1, 1, -1, 0, 1};
static const int dj[] = {-1, -1, -1, 0, 0, 1, 1, 1};

// frequently used structs
struct edge{
  int to,rev,cap;
};

// printf for debug
#ifndef DEBUG
void debug(const char* format, ...){}
#else
void debug(const char* format, ...){
  va_list arg;
  va_start(arg, format);
  vprintf(format, arg);
  va_end(arg);
}
#endif

// dump vector
#ifdef DEBUG
#define DUMPV(v, c) do{       \
  printf("%s: ", #v);         \
  for (int i = 0; i < (c); ++i) \
  {                           \
  cout << (v)[i] << " ";      \
  }                           \
  cout << endl;               \
} while(0)
#else
#define DUMPV(v,c)
#endif

// std::fill of multi dimensions
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
  std::fill( (T*)array, (T*)(array+N), val );
}

// binary search
ll BSearch(ll _begin, ll _end, bool (*f)(ll)){
  ll mid;
  while(_end - _begin > 1LL) {
  mid = _begin + (_end - _begin) / 2LL;
  if(f(mid)) {
    debug("BSearch: f(%d) == true\n", mid);
    _end = mid;
  }
  else
  {
    debug("BSearch: f(%d) == false\n", mid);
    _begin = mid;
  }
  }
  return _end;
}

ll NUM_TEST_CASE = 1;

ll N,M,E;
bool used[NMAX];
vector<edge> G[NMAX];

ll ans = {};

void add_edge(int from, int to, int cap){
  G[from].push_back(edge{to, (int)G[to].size(), cap});
  G[to].push_back(edge{from, (int)G[from].size() - 1, 0});
}
int dfs(int i, int t, int f){
  debug("dfs(%d, %d, %d)\n" ,i, t, f);
  used[i] = true;
  if (i == t || f == 0) return f;
  for(auto&& e : G[i]) {
    if(used[e.to]) continue;
    if(ll ff = dfs(e.to, t, min(f, e.cap)) > 0)
    {
      e.cap -= ff;
      G[e.to][e.rev].cap += ff;
      return ff;
    }
  }
  return 0;
}

ll max_flow(int s, int t){
  ll ret = 0;
  while(true) {
    memset(used,false, NMAX);
    int f = dfs(s, t, INF);
    if(f == 0){
      return ret;
    }
    ret += f;
  }
}

void solve(){
  // main algorithm
  ans = max_flow(0, N);
}
void debug(){
  // output debug information
  for (int i = 0; i < N+1; ++i)
  {
    printf("G[%d]: ", i);
    for(auto&& e : G[i]) {
      printf("%d(<->G[%d][%d]):%d) ", e.to, i, e.rev, e.cap);
    }
    cout << endl;
  }
}
void answer(){
  // output answer
  cout << ans << endl;
}
void init(){
  // Fill(dp, -1);
}
int main(int argc, char const *argv[])
{
  // operate inputs
  // cin >> NUM_TEST_CASE;

  for (int test_case = 0; test_case < NUM_TEST_CASE; ++test_case)
  {
    init();

    cin >> N >> M >> E;
    for (int i = 0; i < M; ++i)
    {
      int x;
      scanf("%d", &x);
      add_edge(x, N, 1);
    }
    for (int i = 0; i < E; ++i)
    {
      int a,b;
      scanf("%d%d", &a, &b);
      add_edge(a, b, 1);
      add_edge(b, a, 1);
    }
    solve();
    #ifdef DEBUG
    debug();
    #endif
    answer();
  }

  return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main(int, const char**)’:
./Main.cpp:182:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
       scanf("%d", &x);
                      ^
./Main.cpp:188:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
       scanf("%d%d", &a, &b);
                            ^

Judge Result