#956243 (C++17) No.241 出席番号(1)

• 問題: No.241 出席番号(1)
• ユーザー: 曉立花
• 提出日時: 2024-02-28 15:37:03
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 2 ms / 2,000 ms
• コード長: 5,265 bytes
• コンパイル時間: 2,408 ms
• コンパイル使用メモリ: 216,372 KB
• 実行使用メモリ: 6,820 KB
• 最終ジャッジ日時: 2024-09-29 12:23:24
• 合計ジャッジ時間: 3,550 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,816 KB
testcase_01	AC	2 ms; 6,816 KB
testcase_02	AC	2 ms; 6,816 KB
testcase_03	AC	2 ms; 6,820 KB
testcase_04	AC	2 ms; 6,820 KB
testcase_05	AC	2 ms; 6,816 KB
testcase_06	AC	2 ms; 6,816 KB
testcase_07	AC	2 ms; 6,820 KB
testcase_08	AC	2 ms; 6,816 KB
testcase_09	AC	2 ms; 6,816 KB
testcase_10	AC	0 ms; 6,816 KB
testcase_11	AC	2 ms; 6,820 KB
testcase_12	AC	2 ms; 6,816 KB
testcase_13	AC	2 ms; 6,820 KB
testcase_14	AC	2 ms; 6,820 KB
testcase_15	AC	2 ms; 6,816 KB
testcase_16	AC	2 ms; 6,816 KB
testcase_17	AC	2 ms; 6,820 KB
testcase_18	AC	2 ms; 6,820 KB
testcase_19	AC	2 ms; 6,816 KB
testcase_20	AC	2 ms; 6,816 KB
testcase_21	AC	2 ms; 6,816 KB
testcase_22	AC	1 ms; 6,820 KB
testcase_23	AC	2 ms; 6,820 KB
testcase_24	AC	2 ms; 6,816 KB
testcase_25	AC	2 ms; 6,820 KB
testcase_26	AC	2 ms; 6,816 KB
testcase_27	AC	2 ms; 6,820 KB
testcase_28	AC	2 ms; 6,820 KB
testcase_29	AC	2 ms; 6,816 KB
testcase_30	AC	2 ms; 6,820 KB
testcase_31	AC	2 ms; 6,820 KB

ソースコード

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

namespace internal {

template <class T> struct simple_queue {
    std::vector<T> payload;
    int pos = 0;
    void reserve(int n) { payload.reserve(n); }
    int size() const { return int(payload.size()) - pos; }
    bool empty() const { return pos == int(payload.size()); }
    void push(const T& t) { payload.push_back(t); }
    T& front() { return payload[pos]; }
    void clear() {
        payload.clear();
        pos = 0;
    }
    void pop() { pos++; }
};

}

template <class Cap> struct mf_graph {
  public:
    mf_graph() : _n(0) {}
    mf_graph(int n) : _n(n), g(n) {}

    int add_edge(int from, int to, Cap cap) {
        assert(0 <= from && from < _n);
        assert(0 <= to && to < _n);
        assert(0 <= cap);
        int m = int(pos.size());
        pos.push_back({from, int(g[from].size())});
        int from_id = int(g[from].size());
        int to_id = int(g[to].size());
        if (from == to) to_id++;
        g[from].push_back(_edge{to, to_id, cap});
        g[to].push_back(_edge{from, from_id, 0});
        return m;
    }

    struct edge {
        int from, to;
        Cap cap, flow;
    };

    edge get_edge(int i) {
        int m = int(pos.size());
        assert(0 <= i && i < m);
        auto _e = g[pos[i].first][pos[i].second];
        auto _re = g[_e.to][_e.rev];
        return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap};
    }
    std::vector<edge> edges() {
        int m = int(pos.size());
        std::vector<edge> result;
        for (int i = 0; i < m; i++) {
            result.push_back(get_edge(i));
        }
        return result;
    }
    void change_edge(int i, Cap new_cap, Cap new_flow) {
        int m = int(pos.size());
        assert(0 <= i && i < m);
        assert(0 <= new_flow && new_flow <= new_cap);
        auto& _e = g[pos[i].first][pos[i].second];
        auto& _re = g[_e.to][_e.rev];
        _e.cap = new_cap - new_flow;
        _re.cap = new_flow;
    }

    Cap flow(int s, int t) {
        return flow(s, t, std::numeric_limits<Cap>::max());
    }
    Cap flow(int s, int t, Cap flow_limit) {
        assert(0 <= s && s < _n);
        assert(0 <= t && t < _n);
        assert(s != t);

        std::vector<int> level(_n), iter(_n);
        internal::simple_queue<int> que;

        auto bfs = [&]() {
            std::fill(level.begin(), level.end(), -1);
            level[s] = 0;
            que.clear();
            que.push(s);
            while (!que.empty()) {
                int v = que.front();
                que.pop();
                for (auto e : g[v]) {
                    if (e.cap == 0 || level[e.to] >= 0) continue;
                    level[e.to] = level[v] + 1;
                    if (e.to == t) return;
                    que.push(e.to);
                }
            }
        };
        auto dfs = [&](auto self, int v, Cap up) {
            if (v == s) return up;
            Cap res = 0;
            int level_v = level[v];
            for (int& i = iter[v]; i < int(g[v].size()); i++) {
                _edge& e = g[v][i];
                if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0) continue;
                Cap d =
                    self(self, e.to, std::min(up - res, g[e.to][e.rev].cap));
                if (d <= 0) continue;
                g[v][i].cap += d;
                g[e.to][e.rev].cap -= d;
                res += d;
                if (res == up) break;
            }
            return res;
        };

        Cap flow = 0;
        while (flow < flow_limit) {
            bfs();
            if (level[t] == -1) break;
            std::fill(iter.begin(), iter.end(), 0);
            while (flow < flow_limit) {
                Cap f = dfs(dfs, t, flow_limit - flow);
                if (!f) break;
                flow += f;
            }
        }
        return flow;
    }

    std::vector<bool> min_cut(int s) {
        std::vector<bool> visited(_n);
        internal::simple_queue<int> que;
        que.push(s);
        while (!que.empty()) {
            int p = que.front();
            que.pop();
            visited[p] = true;
            for (auto e : g[p]) {
                if (e.cap && !visited[e.to]) {
                    visited[e.to] = true;
                    que.push(e.to);
                }
            }
        }
        return visited;
    }

  private:
    int _n;
    struct _edge {
        int to, rev;
        Cap cap;
    };
    std::vector<std::pair<int, int>> pos;
    std::vector<std::vector<_edge>> g;
};

int main(){
    mf_graph<int>mfg(106);
    int N;
    cin>>N;
    for(int i=1;i<=N;i++)
    {
        mfg.add_edge(0,i,1);
        mfg.add_edge(i+N,2*N+1,1);
    }
    for(int i=1;i<=N;i++)
    {
        int temp;
        cin>>temp;
        for(int j=1;j<=N;j++)
        if(j!=temp+1)
        {
        mfg.add_edge(i,N+j,1);
        }
    }
    mfg.flow(0,2*N+1);
    vector<int>ans(N+1,0);
    for(const auto&elem:mfg.edges())
    {
        if(elem.from>=1&&elem.from<=N&&elem.to>N&&elem.flow>0)
        ans[elem.from]=elem.to-N;
    }
    for(int i=1;i<=N;i++)
    {
        if(ans[i]==0)
        {
            cout<<-1<<endl;
            return 0;
        }
    }
    for(int i=1;i<=N;i++)
    cout<<ans[i]-1<<endl;
    return 0;
}