Submission #7590944


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

# define REP(i,n) for (int i=0;i<(n);++i)
# define PER(i,n) for (int i=(N-1);i>=0;--i)
# define rep(i,a,b) for(int i=a;i<(b);++i)
# define p(s) std::cout << s ;
# define pl(s)  std::cout << s << endl;
# define printIf(j,s1,s2) cout << (j ? s1 : s2) << endl;
# define YES(j) cout << (j ? "YES" : "NO") << endl;
# define Yes(j) std::cout << (j ? "Yes" : "No") << endl;
# define yes(j) std::cout << (j ? "yes" : "no") << endl;
# define all(v) v.begin(),v.end()
# define showVector(v) REP(i,v.size()){p(v[i]);p(" ")} pl("")
template<class T> inline bool chmin(T &a, T b){ if(a > b) { a = b; return true;} return false;}
template<class T> inline bool chmax(T &a, T b){ if(a < b) { a = b; return true;} return false;}
typedef long long int ll;
typedef pair<ll,ll> P_ii;
typedef pair<double,double> P_dd;

// 行き先、容量、逆辺
struct edge {int to, cap, rev;};

const int MAX_V = 100005;
const int INF = 1e9 + 7;

vector<edge> G[MAX_V]; // グラフの隣接リスト表現
int level[MAX_V]; // Sからの距離
int iter[MAX_V]; // どこまで調べ終わったか

// fromからtoに向かう容量capの逆辺を追加する
void add_edge(int from, int to, int cap){
    G[from].push_back((edge){to, cap, (int)G[to].size()});
    G[to].push_back((edge){from, 0, (int)G[from].size() - 1});
}

// sからの最短距離をBFSで計算する
void bfs(int s){
    memset(level, -1, sizeof(level));
    queue<int> que;
    level[s] = 0;
    que.push(s);
    while(que.size()){
        int v = que.front(); que.pop();
        for(auto&& e : G[v]){
            if(e.cap > 0 && level[e.to] < 0){
                level[e.to] = level[v] + 1;
                que.push(e.to);
            }
        }
    }
}

// 増加パスをDFSで探す
int dfs(int v, int t, int f){
    if(v == t) return f;
    for(int &i = iter[v]; i < G[v].size(); i++){
        edge &e = G[v][i];
        if(e.cap > 0 && level[v] < level[e.to]){
            int d = dfs(e.to, t, min(f, e.cap));
            if(d > 0){
                e.cap -= d;
                G[e.to][e.rev].cap += d;
                return d;
            }
        }
    }
    return 0;
}

int max_flow(int s, int t){
    int flow = 0;
    while(true){
        bfs(s);
        if(level[t] < 0) return flow;
        memset(iter, 0, sizeof(iter));
        int f;
        while((f = dfs(s, t, INF)) > 0){
            flow += f;
        }
    }
}

int main(){
  int n, g, e;
  cin >> n >> g >> e;

  REP(i, g) {
      int p;
      cin >> p;
      add_edge(p, n, 1);    
  }


  REP(i, e){
    int a, b;
    cin >> a >> b;
    add_edge(a, b, 1);
    add_edge(b, a, 1);
  }

  cout << max_flow(0, n) << endl;

  return 0;
}

Submission Info

Submission Time
Task D - 浮気予防
User azz
Language C++14 (GCC 5.4.1)
Score 100
Code Size 2807 Byte
Status AC
Exec Time 5 ms
Memory 3712 KB

Judge Result

Set Name part All
Score / Max Score 99 / 99 1 / 1
Status
AC × 27
AC × 61
Set Name Test Cases
part test_01_AB.txt, test_02_AB.txt, test_03_AB.txt, test_04_AB.txt, test_05_AB.txt, test_06_AB.txt, test_07_AB.txt, test_08_AB.txt, test_09_AB.txt, test_10_AB.txt, test_11_AB.txt, test_12_AB.txt, test_13_AB.txt, test_14_AB.txt, test_15_AB.txt, test_16_AB.txt, test_17_AB.txt, test_18_AB.txt, test_19_AB.txt, test_20_AB.txt, test_21_AB.txt, test_22_AB.txt, test_23_AB.txt, test_24_AB.txt, test_25_AB.txt, test_41_AB.txt, test_47_AB.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sample_05.txt, sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sample_05.txt, test_01_AB.txt, test_02_AB.txt, test_03_AB.txt, test_04_AB.txt, test_05_AB.txt, test_06_AB.txt, test_07_AB.txt, test_08_AB.txt, test_09_AB.txt, test_10_AB.txt, test_11_AB.txt, test_12_AB.txt, test_13_AB.txt, test_14_AB.txt, test_15_AB.txt, test_16_AB.txt, test_17_AB.txt, test_18_AB.txt, test_19_AB.txt, test_20_AB.txt, test_21_AB.txt, test_22_AB.txt, test_23_AB.txt, test_24_AB.txt, test_25_AB.txt, test_26_A.txt, test_27_A.txt, test_28_A.txt, test_29_A.txt, test_30_A.txt, test_31_A.txt, test_32_A.txt, test_33_A.txt, test_34_A.txt, test_35_A.txt, test_36_A.txt, test_37_A.txt, test_38_A.txt, test_39_A.txt, test_40_A.txt, test_41_AB.txt, test_42_A.txt, test_43_A.txt, test_44_A.txt, test_45_A.txt, test_46_A.txt, test_47_AB.txt, test_48_A.txt, test_49_A.txt, test_50_A.txt, test_51_A.txt
Case Name Status Exec Time Memory
sample_01.txt AC 3 ms 3328 KB
sample_02.txt AC 3 ms 3328 KB
sample_03.txt AC 3 ms 3328 KB
sample_04.txt AC 3 ms 3328 KB
sample_05.txt AC 3 ms 2944 KB
test_01_AB.txt AC 3 ms 2944 KB
test_02_AB.txt AC 3 ms 3328 KB
test_03_AB.txt AC 3 ms 3328 KB
test_04_AB.txt AC 3 ms 3328 KB
test_05_AB.txt AC 3 ms 3328 KB
test_06_AB.txt AC 3 ms 2944 KB
test_07_AB.txt AC 3 ms 2944 KB
test_08_AB.txt AC 3 ms 2944 KB
test_09_AB.txt AC 3 ms 2944 KB
test_10_AB.txt AC 2 ms 2944 KB
test_11_AB.txt AC 3 ms 3328 KB
test_12_AB.txt AC 2 ms 2944 KB
test_13_AB.txt AC 3 ms 2944 KB
test_14_AB.txt AC 3 ms 2944 KB
test_15_AB.txt AC 3 ms 2944 KB
test_16_AB.txt AC 2 ms 2944 KB
test_17_AB.txt AC 3 ms 2944 KB
test_18_AB.txt AC 2 ms 2944 KB
test_19_AB.txt AC 2 ms 2944 KB
test_20_AB.txt AC 3 ms 2944 KB
test_21_AB.txt AC 3 ms 2944 KB
test_22_AB.txt AC 2 ms 3328 KB
test_23_AB.txt AC 2 ms 2944 KB
test_24_AB.txt AC 3 ms 2944 KB
test_25_AB.txt AC 3 ms 2944 KB
test_26_A.txt AC 5 ms 3712 KB
test_27_A.txt AC 5 ms 3712 KB
test_28_A.txt AC 5 ms 3712 KB
test_29_A.txt AC 5 ms 3712 KB
test_30_A.txt AC 5 ms 3712 KB
test_31_A.txt AC 5 ms 3712 KB
test_32_A.txt AC 3 ms 3456 KB
test_33_A.txt AC 4 ms 3584 KB
test_34_A.txt AC 3 ms 3456 KB
test_35_A.txt AC 3 ms 3456 KB
test_36_A.txt AC 3 ms 3456 KB
test_37_A.txt AC 4 ms 3456 KB
test_38_A.txt AC 3 ms 3328 KB
test_39_A.txt AC 3 ms 3328 KB
test_40_A.txt AC 3 ms 3328 KB
test_41_AB.txt AC 3 ms 2944 KB
test_42_A.txt AC 4 ms 3456 KB
test_43_A.txt AC 3 ms 3328 KB
test_44_A.txt AC 3 ms 3456 KB
test_45_A.txt AC 3 ms 3328 KB
test_46_A.txt AC 3 ms 3328 KB
test_47_AB.txt AC 3 ms 3328 KB
test_48_A.txt AC 3 ms 3328 KB
test_49_A.txt AC 3 ms 3328 KB
test_50_A.txt AC 2 ms 3328 KB
test_51_A.txt AC 3 ms 3328 KB