結果
問題 | No.1669 パズル作成 |
ユーザー | penguinman |
提出日時 | 2021-04-27 23:18:48 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 849 ms / 2,000 ms |
コード長 | 2,894 bytes |
コンパイル時間 | 969 ms |
コンパイル使用メモリ | 87,256 KB |
実行使用メモリ | 80,756 KB |
最終ジャッジ日時 | 2023-08-21 18:49:16 |
合計ジャッジ時間 | 16,244 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 72 ms
71,408 KB |
testcase_01 | AC | 72 ms
71,368 KB |
testcase_02 | AC | 70 ms
71,412 KB |
testcase_03 | AC | 94 ms
76,228 KB |
testcase_04 | AC | 94 ms
76,220 KB |
testcase_05 | AC | 92 ms
76,644 KB |
testcase_06 | AC | 152 ms
78,660 KB |
testcase_07 | AC | 808 ms
78,264 KB |
testcase_08 | AC | 194 ms
80,756 KB |
testcase_09 | AC | 849 ms
78,300 KB |
testcase_10 | AC | 596 ms
79,108 KB |
testcase_11 | AC | 735 ms
79,028 KB |
testcase_12 | AC | 191 ms
80,672 KB |
testcase_13 | AC | 194 ms
80,320 KB |
testcase_14 | AC | 193 ms
80,480 KB |
testcase_15 | AC | 590 ms
78,944 KB |
testcase_16 | AC | 810 ms
78,676 KB |
testcase_17 | AC | 314 ms
79,880 KB |
testcase_18 | AC | 828 ms
78,260 KB |
testcase_19 | AC | 847 ms
78,524 KB |
testcase_20 | AC | 742 ms
78,924 KB |
testcase_21 | AC | 736 ms
78,884 KB |
testcase_22 | AC | 649 ms
79,248 KB |
testcase_23 | AC | 580 ms
79,488 KB |
testcase_24 | AC | 512 ms
79,772 KB |
testcase_25 | AC | 463 ms
79,412 KB |
testcase_26 | AC | 315 ms
80,048 KB |
testcase_27 | AC | 798 ms
78,868 KB |
testcase_28 | AC | 765 ms
79,272 KB |
testcase_29 | AC | 358 ms
79,840 KB |
testcase_30 | AC | 165 ms
79,344 KB |
testcase_31 | AC | 169 ms
79,460 KB |
ソースコード
# Reference: https://github.com/shakayami/ACL-for-python class dsu(): n=1 parent_or_size=[-1 for i in range(n)] def __init__(self,N): self.n=N self.parent_or_size=[-1 for i in range(N)] def merge(self,a,b): assert 0<=a<self.n, "0<=a<n,a={0},n={1}".format(a,self.n) assert 0<=b<self.n, "0<=b<n,b={0},n={1}".format(b,self.n) x=self.leader(a) y=self.leader(b) if x==y: return x if (-self.parent_or_size[x]<-self.parent_or_size[y]): x,y=y,x self.parent_or_size[x]+=self.parent_or_size[y] self.parent_or_size[y]=x return x def same(self,a,b): assert 0<=a<self.n, "0<=a<n,a={0},n={1}".format(a,self.n) assert 0<=b<self.n, "0<=b<n,b={0},n={1}".format(b,self.n) return self.leader(a)==self.leader(b) def leader(self,a): assert 0<=a<self.n, "0<=a<n,a={0},n={1}".format(a,self.n) if (self.parent_or_size[a]<0): return a self.parent_or_size[a]=self.leader(self.parent_or_size[a]) return self.parent_or_size[a] def size(self,a): assert 0<=a<self.n, "0<=a<n,a={0},n={1}".format(a,self.n) return -self.parent_or_size[self.leader(a)] def groups(self): leader_buf=[0 for i in range(self.n)] group_size=[0 for i in range(self.n)] for i in range(self.n): leader_buf[i]=self.leader(i) group_size[leader_buf[i]]+=1 result=[[] for i in range(self.n)] for i in range(self.n): result[leader_buf[i]].append(i) result2=[] for i in range(self.n): if len(result[i])>0: result2.append(result[i]) return result2 N, M = map(int, input().split()) tree = dsu(N) mem = [[]for i in range(N)] for i in range(M): r, c = map(int, input().split()) mem[r-1].append(c-1) for i in range(N): for j in range(1,len(mem[i])): tree.merge(mem[i][j], mem[i][j-1]) cnt = [0]*N x = [] y = [] for i in range(N): if len(mem[i]) == 0: x.append(1) y.append(0) else: cnt[tree.leader(mem[i][0])] += 1 for i in range(N): if tree.leader(i) == i: x.append(cnt[i]) y.append(tree.size(i)) inf = int(1e18) ans = inf K = len(x) dp = [inf]*(N+1) dp[0] = 0 for i in range(K): for j in reversed(range(N+1)): if j < x[i]: break dp[j] = min(dp[j], dp[j-x[i]]+y[i]) for i in range(N+1): if dp[i] == inf: continue ans = min(ans, N*N+2*i*dp[i]-dp[i]*N-i*N-M) for i in range(K): x[i], y[i] = y[i], x[i] dp = [inf]*(N+1) dp[0] = 0 for i in range(K): for j in reversed(range(N+1)): if j < x[i]: break dp[j] = min(dp[j], dp[j-x[i]]+y[i]) for i in range(N+1): if dp[i] == inf: continue ans = min(ans, N*N+2*i*dp[i]-dp[i]*N-i*N-M) print(ans)