結果
| 問題 | No.241 出席番号(1) |
| ユーザー |
 heno239
|
| 提出日時 | 2020-08-16 01:24:16 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 5 ms / 2,000 ms |
| コード長 | 3,605 bytes |
| コンパイル時間 | 1,151 ms |
| コンパイル使用メモリ | 117,216 KB |
| 実行使用メモリ | 6,824 KB |
| 最終ジャッジ日時 | 2024-10-11 10:21:50 |
| 合計ジャッジ時間 | 2,624 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 29 |
ソースコード
#include<iostream>#include<string>#include<cstdio>#include<vector>#include<cmath>#include<algorithm>#include<functional>#include<iomanip>#include<queue>#include<ciso646>#include<random>#include<map>#include<set>#include<bitset>#include<stack>#include<unordered_map>#include<utility>#include<cassert>#include<complex>#include<numeric>using namespace std;//#define int long longtypedef long long ll;typedef unsigned long long ul;typedef unsigned int ui;constexpr ll mod = 1000000007;const ll INF = mod * mod;typedef pair<int, int>P;#define stop char nyaa;cin>>nyaa;#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,sta,n) for(int i=sta;i<n;i++)#define rep1(i,n) for(int i=1;i<=n;i++)#define per1(i,n) for(int i=n;i>=1;i--)#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)#define all(v) (v).begin(),(v).end()typedef pair<ll, ll> LP;typedef double ld;typedef pair<ld, ld> LDP;const ld eps = 1e-12;const ld pi = acos(-1.0);ll mod_pow(ll x, ll n, ll m = mod) {ll res = 1;while (n) {if (n & 1)res = res * x % m;x = x * x % m; n >>= 1;}return res;}struct modint {ll n;modint() :n(0) { ; }modint(ll m) :n(m) {if (n >= mod)n %= mod;else if (n < 0)n = (n % mod + mod) % mod;}operator int() { return n; }};bool operator==(modint a, modint b) { return a.n == b.n; }modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }modint operator+(modint a, modint b) { return a += b; }modint operator-(modint a, modint b) { return a -= b; }modint operator*(modint a, modint b) { return a *= b; }modint operator^(modint a, ll n) {if (n == 0)return modint(1);modint res = (a * a) ^ (n / 2);if (n % 2)res = res * a;return res;}ll inv(ll a, ll p) {return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);}modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }ll gcd(ll a, ll b) {if (a < b)swap(a, b);while (b) {ll r = a % b; a = b; b = r;}return a;}#include<cstring>struct edge { int to, cap, rev; };vector<edge> G[100000];bool used[100000];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 });}int dfs(int v, int t, int f) {if (v == t)return f;used[v] = true;for (int i = 0; i < (int)G[v].size(); i++) {edge& e = G[v][i];if (!used[e.to] && e.cap > 0) {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;for (;;) {memset(used, 0, sizeof(used));int f = dfs(s, t, mod);if (f == 0)return flow;flow += f;}}void solve() {int n; cin >> n;vector<int> a(n); rep(i, n)cin >> a[i];int s = 2 * n; int t = s + 1;rep(i, n)rep(j, n) {if (j == a[i])continue;add_edge(i, j + n, 1);}rep(i, n) {add_edge(s, i, 1);add_edge(i + n, t, 1);}int f = max_flow(s, t);if (f!=n) {cout << -1 << "\n"; return;}vector<int> ans(n);rep(i, n) {for (edge e : G[i]) {if (e.to == s)continue;if (e.cap == 0) {ans[i] = e.to - n;}}}rep(i, n)cout << ans[i] << "\n";}signed main() {ios::sync_with_stdio(false);cin.tie(0);//cout << fixed << setprecision(15);//init_f();//init();//expr();//int t; cin >> t; rep(i, t)solve();return 0;}