@@ -90,7 +90,7 @@ public boolean satisfiable()
 ### answer
 
 ```java
-public java.util.BitSet answer()
+public boolean[] answer()
 ```
 
 `satisfiable` を最後に呼んだ時点での、クローズを満たす割当を返す。割当が存在しなかった場合は `null` を返す。
@@ -107,4 +107,4 @@ $O(n)$
 
 ## 使用例
 
-[AtCoder Library Practice Contest H - Two SAT](https://atcoder.jp/contests/practice2/submissions/16603939)
+[AtCoder Library Practice Contest H - Two SAT](https://atcoder.jp/contests/practice2/submissions/16647102)
@@ -1,15 +1,18 @@
+/**
+ * @verified https://atcoder.jp/contests/practice2/submissions/16647102
+ */
 class TwoSAT {
     private final int n;
     private final InternalSCC scc;
-    private final java.util.BitSet answer;
+    private final boolean[] answer;
 
     private boolean hasCalledSatisfiable = false;
     private boolean existsAnswer = false;
 
     public TwoSAT(int n) {
         this.n = n;
         this.scc = new InternalSCC(2 * n);
-        this.answer = new java.util.BitSet(n);
+        this.answer = new boolean[n];
     }
 
     public void addClause(int x, boolean f, int y, boolean g) {
@@ -30,12 +33,12 @@ public boolean satisfiable() {
         int[] ids = scc.ids();
         for (int i = 0; i < n; i++) {
             if (ids[i << 1 | 0] == ids[i << 1 | 1]) return existsAnswer = false;
-            answer.set(i, ids[i << 1 | 0] < ids[i << 1 | 1]);
+            answer[i] = ids[i << 1 | 0] < ids[i << 1 | 1];
         }
         return existsAnswer = true;
     }
 
-    public java.util.BitSet answer() {
+    public boolean[] answer() {
         if (!hasCalledSatisfiable) {
             throw new UnsupportedOperationException(
                 "Call TwoSAT#satisfiable at least once before TwoSAT#answer."