結果
問題 | No.1370 置換門松列 |
ユーザー | ansain |
提出日時 | 2021-01-29 22:10:57 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 443 ms / 2,000 ms |
コード長 | 3,640 bytes |
コンパイル時間 | 77 ms |
コンパイル使用メモリ | 11,076 KB |
実行使用メモリ | 50,040 KB |
最終ジャッジ日時 | 2023-10-12 21:02:00 |
合計ジャッジ時間 | 5,004 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 20 ms
8,760 KB |
testcase_01 | AC | 20 ms
8,832 KB |
testcase_02 | AC | 20 ms
8,800 KB |
testcase_03 | AC | 20 ms
8,748 KB |
testcase_04 | AC | 20 ms
8,800 KB |
testcase_05 | AC | 19 ms
8,856 KB |
testcase_06 | AC | 19 ms
8,808 KB |
testcase_07 | AC | 20 ms
8,756 KB |
testcase_08 | AC | 20 ms
8,812 KB |
testcase_09 | AC | 20 ms
8,752 KB |
testcase_10 | AC | 20 ms
8,800 KB |
testcase_11 | AC | 19 ms
8,876 KB |
testcase_12 | AC | 19 ms
8,896 KB |
testcase_13 | AC | 20 ms
8,664 KB |
testcase_14 | AC | 19 ms
8,748 KB |
testcase_15 | AC | 20 ms
8,840 KB |
testcase_16 | AC | 20 ms
8,728 KB |
testcase_17 | AC | 20 ms
8,856 KB |
testcase_18 | AC | 20 ms
8,932 KB |
testcase_19 | AC | 19 ms
8,844 KB |
testcase_20 | AC | 19 ms
8,824 KB |
testcase_21 | AC | 346 ms
50,040 KB |
testcase_22 | AC | 293 ms
48,136 KB |
testcase_23 | AC | 338 ms
49,272 KB |
testcase_24 | AC | 151 ms
18,004 KB |
testcase_25 | AC | 430 ms
49,996 KB |
testcase_26 | AC | 443 ms
50,020 KB |
testcase_27 | AC | 316 ms
46,144 KB |
testcase_28 | AC | 320 ms
46,368 KB |
testcase_29 | AC | 179 ms
23,892 KB |
ソースコード
import sys from collections import defaultdict, Counter, deque from itertools import permutations, combinations, product, combinations_with_replacement, groupby, accumulate import operator #from math import sqrt,isqrt #from bisect import bisect_left,bisect_right #from functools import lru_cache,reduce #import heapq #import numpy as np #import networkx as nx # from numba import njit, b1, i1, i4, i8, f8 # numba例 @njit(i1(i4[:], i8[:, :]),cache=True) 引数i4配列、i8 2次元配列,戻り値i1 def input(): return sys.stdin.readline().rstrip() def divceil(n, k): return 1+(n-1)//k # n/kの切り上げを返す class scc_graph: def __init__(self, N): self.N = N self.edges = [] def csr(self): self.start = [0]*(self.N+1) self.elist = [0]*len(self.edges) for e in self.edges: self.start[e[0]+1] += 1 for i in range(1, self.N+1): self.start[i] += self.start[i-1] counter = self.start[:] for e in self.edges: self.elist[counter[e[0]]] = e[1] counter[e[0]] += 1 def add_edge(self, v, w): self.edges.append((v, w)) def scc_ids(self): self.csr() N = self.N now_ord = group_num = 0 visited = [] low = [0]*N order = [-1]*N ids = [0]*N parent = [-1]*N stack = [] for i in range(N): if order[i] == -1: stack.append(i) stack.append(i) while stack: v = stack.pop() if order[v] == -1: low[v] = order[v] = now_ord now_ord += 1 visited.append(v) for i in range(self.start[v], self.start[v+1]): to = self.elist[i] if order[to] == -1: stack.append(to) stack.append(to) parent[to] = v else: low[v] = min(low[v], order[to]) else: if low[v] == order[v]: while True: u = visited.pop() order[u] = N ids[u] = group_num if u == v: break group_num += 1 if parent[v] != -1: low[parent[v]] = min(low[parent[v]], low[v]) for i, x in enumerate(ids): ids[i] = group_num-1-x return group_num, ids def scc(self): group_num, ids = self.scc_ids() groups = [[] for _ in range(group_num)] for i, x in enumerate(ids): groups[x].append(i) return groups def main(): mod = 10**9+7 mod2 = 998244353 n, m = map(int, input().split()) A = list(map(int, input().split())) sc = scc_graph(m) for i in range(n-1): if i!=n-2: if A[i] == A[i+2]: print('No') return if A[i] == A[i+1]: print('No') return if i % 2 == 0: sc.add_edge(A[i]-1, A[i+1]-1) else: sc.add_edge(A[i+1]-1, A[i]-1) points = sc.scc() if len(points) != m: print('No') return ans = [0]*m for i in range(m): ans[points[i][0]] = i+1 print('Yes') print(*ans) if __name__ == '__main__': main()