BOJ 9169번 나는 9999번 문제를 풀 수 있다

https://www.acmicpc.net/problem/9169

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9+7;
const int INF = 0x3c3c3c3c;
const long long INFL = 0x3c3c3c3c3c3c3c3c;
struct edge{int to, cap, rev;};
vector<edge> G[303];
void connect(int from, int to, int cap){
    G[from].push_back({to, cap, (int)G[to].size()});
    G[to].push_back({from, 0, (int)G[from].size()-1});
}
int N, M, T;
int think[303];
int main() {
    ios_base::sync_with_stdio(false),cin.tie(NULL);
    int src = 0, sink = 1;
    while(1){
        for(int i = 0 ; i < 303; i++) G[i].clear();
        cin >> N >> M;
        if(!N && !M) break;
        for(int i = 0 ; i < N; i++) cin >> think[i];
        for(int i = 0 ; i < M; i++){
            int a,b;
            cin >> a >> b;
            if(think[a-1] == think[b-1]) {
                connect(a + 1, b + 1, 1);
                connect(b + 1, a + 1, 1);
                continue;
            }
            if(think[a-1]) swap(a, b);
            connect(a + 1, b + 1, 1);
        }
        for(int i = 0 ; i < N; i++){
            if(think[i]) connect(i + 2, sink, 1);
            else connect(src, i + 2, 1);
        }
        Dinic dinic(G, 303, src, sink);
        cout << dinic.getMaxflow() << endl;
    }
    return 0;
}