結果
問題 | No.2267 群の公理 |
ユーザー | ktr216 |
提出日時 | 2023-04-14 21:48:25 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 4 ms / 2,000 ms |
コード長 | 3,522 bytes |
コンパイル時間 | 1,889 ms |
コンパイル使用メモリ | 182,228 KB |
実行使用メモリ | 6,016 KB |
最終ジャッジ日時 | 2024-10-10 12:30:59 |
合計ジャッジ時間 | 3,540 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 3 ms
5,760 KB |
testcase_01 | AC | 3 ms
5,760 KB |
testcase_02 | AC | 3 ms
5,888 KB |
testcase_03 | AC | 3 ms
5,760 KB |
testcase_04 | AC | 3 ms
5,888 KB |
testcase_05 | AC | 3 ms
5,760 KB |
testcase_06 | AC | 3 ms
5,760 KB |
testcase_07 | AC | 3 ms
5,888 KB |
testcase_08 | AC | 3 ms
5,888 KB |
testcase_09 | AC | 4 ms
5,760 KB |
testcase_10 | AC | 4 ms
5,760 KB |
testcase_11 | AC | 4 ms
5,760 KB |
testcase_12 | AC | 3 ms
5,888 KB |
testcase_13 | AC | 3 ms
5,888 KB |
testcase_14 | AC | 3 ms
5,888 KB |
testcase_15 | AC | 3 ms
6,016 KB |
testcase_16 | AC | 3 ms
5,888 KB |
testcase_17 | AC | 3 ms
5,760 KB |
testcase_18 | AC | 4 ms
6,016 KB |
testcase_19 | AC | 4 ms
5,760 KB |
testcase_20 | AC | 4 ms
6,016 KB |
testcase_21 | AC | 3 ms
6,016 KB |
testcase_22 | AC | 3 ms
5,760 KB |
testcase_23 | AC | 4 ms
6,016 KB |
testcase_24 | AC | 3 ms
5,760 KB |
testcase_25 | AC | 4 ms
6,016 KB |
testcase_26 | AC | 3 ms
5,888 KB |
testcase_27 | AC | 3 ms
5,760 KB |
testcase_28 | AC | 3 ms
5,888 KB |
testcase_29 | AC | 3 ms
5,888 KB |
testcase_30 | AC | 3 ms
5,888 KB |
testcase_31 | AC | 3 ms
5,888 KB |
testcase_32 | AC | 3 ms
5,888 KB |
testcase_33 | AC | 4 ms
5,888 KB |
testcase_34 | AC | 3 ms
5,888 KB |
testcase_35 | AC | 3 ms
6,016 KB |
testcase_36 | AC | 4 ms
5,888 KB |
testcase_37 | AC | 4 ms
5,888 KB |
testcase_38 | AC | 3 ms
5,760 KB |
testcase_39 | AC | 4 ms
5,888 KB |
testcase_40 | AC | 3 ms
5,760 KB |
testcase_41 | AC | 4 ms
6,016 KB |
testcase_42 | AC | 3 ms
5,888 KB |
testcase_43 | AC | 3 ms
6,016 KB |
testcase_44 | AC | 3 ms
5,888 KB |
testcase_45 | AC | 4 ms
5,888 KB |
testcase_46 | AC | 4 ms
5,888 KB |
testcase_47 | AC | 4 ms
5,888 KB |
testcase_48 | AC | 4 ms
5,888 KB |
testcase_49 | AC | 4 ms
5,888 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define double long double using ll = long long; using VB = vector<bool>; using VVB = vector<VB>; using VVVB = vector<VVB>; using VC = vector<char>; using VVC = vector<VC>; using VI = vector<int>; using VVI = vector<VI>; using VVVI = vector<VVI>; using VVVVI = vector<VVVI>; using VL = vector<ll>; using VVL = vector<VL>; using VVVL = vector<VVL>; using VVVVL = vector<VVVL>; using VD = vector<double>; using VVD = vector<VD>; using VVVD = vector<VVD>; //using P = pair<int, int>; #define REP(i, n) for (ll i = 0; i < (int)(n); i++) #define FOR(i, a, b) for (ll i = a; i < (ll)(b); i++) #define ALL(a) (a).begin(),(a).end() constexpr int INF = 1001001001; constexpr ll LINF = 1001001001001001001ll; constexpr int DX[] = {2, 1, -1, -2, -2, -1, 1, 2}; constexpr int DY[] = {1, 2, 2, 1, -1, -2, -2, -1}; template< typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true); } template< typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true); } const ll MOD = 998244353; const int MAX_N = 400010; int par[MAX_N]; int rnk[MAX_N]; int siz[MAX_N]; void init(int n) { REP(i,n) { par[i] = i; rnk[i] = 0; siz[i] = 1; } } int find(int x) { if (par[x] == x) { return x; } else { return par[x] = find(par[x]); } } void unite(int x, int y) { x = find(x); y = find(y); if (x == y) return; int s = siz[x] + siz[y]; if (rnk[x] < rnk[y]) { par[x] = y; } else { par[y] = x; if (rnk[x] == rnk[y]) rnk[x]++; } siz[find(x)] = s; } bool same(int x, int y) { return find(x) == find(y); } int size(int x) { return siz[find(x)]; } ll mod_pow(ll x, ll n, ll mod) { ll res = 1; x %= mod; while (n > 0) { if (n & 1) res = res * x % mod; x = x * x % mod; n >>= 1; } return res; } ll gcd(ll x, ll y) { if (y == 0) return x; return gcd(y, x % y); } typedef pair<ll, int> P0; struct edge { int to; ll cost; }; const int MAX_V = 100000; //const ll LINF = 1LL<<60; int V; vector<edge> G[MAX_V]; ll d[MAX_V]; void dijkstra(ll s) { priority_queue<P0, vector<P0>, greater<P0> > que; fill(d, d + V, LINF); d[s] = 0; que.push(P0(0, s)); while (!que.empty()) { P0 p = que.top(); que.pop(); int v = p.second; if (d[v] < p.first) continue; for (edge e : G[v]) { if (d[e.to] > d[v] + e.cost) { d[e.to] = d[v] + e.cost; que.push(P0(d[e.to], e.to)); } } } } /* VL f(400010, 1); ll C(ll n, ll k) { return f[n] * mod_pow(f[k], MOD - 2, MOD) % MOD * mod_pow(f[n - k], MOD - 2, MOD) % MOD; } */ int main() { ios::sync_with_stdio(false); std::cin.tie(nullptr); //REP(i, 400009) f[i + 1] = f[i] * (i + 1) % MOD; int N; cin >> N; VVI A(N, VI(N)); REP(i, N) REP(j, N) cin >> A[i][j]; REP(i, N) REP(j, N) REP(k, N) { if (A[A[i][j]][k] != A[i][A[j][k]]) { cout << "No\n"; return 0; } } REP(e, N) { bool f = false; REP(i, N) { if (A[e][i] != i || A[i][e] != i) f = true; } if (f) continue; VB g(N, false); REP(i, N) REP(j, N) if (A[i][j] == e) g[i] = true; f = true; REP(i, N) f &= g[i]; if (f) { cout << "Yes\n"; return 0; } } cout << "No\n"; }