結果

問題 No.5005 3-SAT
ユーザー tomeruntomerun
提出日時 2022-04-29 17:38:42
言語 Crystal
(1.11.2)
結果
AC  
実行時間 1,948 ms / 2,000 ms
コード長 5,378 bytes
コンパイル時間 19,639 ms
実行使用メモリ 10,524 KB
スコア 108,322
最終ジャッジ日時 2022-04-29 17:42:23
合計ジャッジ時間 214,930 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge13
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,923 ms
10,188 KB
testcase_01 AC 1,918 ms
10,452 KB
testcase_02 AC 1,910 ms
9,880 KB
testcase_03 AC 1,906 ms
9,608 KB
testcase_04 AC 1,912 ms
9,656 KB
testcase_05 AC 1,931 ms
9,988 KB
testcase_06 AC 1,923 ms
9,980 KB
testcase_07 AC 1,913 ms
9,684 KB
testcase_08 AC 1,917 ms
9,780 KB
testcase_09 AC 1,932 ms
9,620 KB
testcase_10 AC 1,908 ms
9,460 KB
testcase_11 AC 1,936 ms
9,492 KB
testcase_12 AC 1,931 ms
9,720 KB
testcase_13 AC 1,906 ms
10,048 KB
testcase_14 AC 1,912 ms
9,340 KB
testcase_15 AC 1,918 ms
9,928 KB
testcase_16 AC 1,918 ms
9,168 KB
testcase_17 AC 1,909 ms
9,412 KB
testcase_18 AC 1,911 ms
9,860 KB
testcase_19 AC 1,908 ms
9,644 KB
testcase_20 AC 1,906 ms
9,836 KB
testcase_21 AC 1,904 ms
10,288 KB
testcase_22 AC 1,932 ms
9,972 KB
testcase_23 AC 1,910 ms
10,232 KB
testcase_24 AC 1,924 ms
9,588 KB
testcase_25 AC 1,907 ms
9,932 KB
testcase_26 AC 1,907 ms
9,624 KB
testcase_27 AC 1,905 ms
10,172 KB
testcase_28 AC 1,912 ms
9,736 KB
testcase_29 AC 1,919 ms
10,064 KB
testcase_30 AC 1,906 ms
9,456 KB
testcase_31 AC 1,912 ms
9,576 KB
testcase_32 AC 1,905 ms
9,544 KB
testcase_33 AC 1,926 ms
9,328 KB
testcase_34 AC 1,936 ms
9,312 KB
testcase_35 AC 1,913 ms
9,704 KB
testcase_36 AC 1,911 ms
9,980 KB
testcase_37 AC 1,924 ms
9,536 KB
testcase_38 AC 1,924 ms
9,692 KB
testcase_39 AC 1,916 ms
9,360 KB
testcase_40 AC 1,910 ms
9,516 KB
testcase_41 AC 1,908 ms
9,580 KB
testcase_42 AC 1,927 ms
9,776 KB
testcase_43 AC 1,920 ms
9,492 KB
testcase_44 AC 1,924 ms
9,628 KB
testcase_45 AC 1,906 ms
9,184 KB
testcase_46 AC 1,907 ms
10,496 KB
testcase_47 AC 1,906 ms
9,920 KB
testcase_48 AC 1,927 ms
9,224 KB
testcase_49 AC 1,917 ms
9,584 KB
testcase_50 AC 1,926 ms
9,608 KB
testcase_51 AC 1,914 ms
10,372 KB
testcase_52 AC 1,920 ms
9,696 KB
testcase_53 AC 1,925 ms
9,268 KB
testcase_54 AC 1,905 ms
9,944 KB
testcase_55 AC 1,941 ms
9,652 KB
testcase_56 AC 1,931 ms
9,724 KB
testcase_57 AC 1,908 ms
9,596 KB
testcase_58 AC 1,914 ms
9,912 KB
testcase_59 AC 1,904 ms
9,812 KB
testcase_60 AC 1,919 ms
9,468 KB
testcase_61 AC 1,931 ms
9,492 KB
testcase_62 AC 1,935 ms
9,672 KB
testcase_63 AC 1,903 ms
9,152 KB
testcase_64 AC 1,948 ms
9,960 KB
testcase_65 AC 1,925 ms
9,844 KB
testcase_66 AC 1,913 ms
9,860 KB
testcase_67 AC 1,909 ms
9,512 KB
testcase_68 AC 1,906 ms
9,472 KB
testcase_69 AC 1,912 ms
9,364 KB
testcase_70 AC 1,904 ms
9,452 KB
testcase_71 AC 1,915 ms
9,672 KB
testcase_72 AC 1,918 ms
9,760 KB
testcase_73 AC 1,915 ms
9,444 KB
testcase_74 AC 1,930 ms
9,292 KB
testcase_75 AC 1,909 ms
10,236 KB
testcase_76 AC 1,938 ms
9,592 KB
testcase_77 AC 1,915 ms
9,928 KB
testcase_78 AC 1,913 ms
9,808 KB
testcase_79 AC 1,909 ms
9,596 KB
testcase_80 AC 1,925 ms
9,364 KB
testcase_81 AC 1,915 ms
9,256 KB
testcase_82 AC 1,924 ms
9,724 KB
testcase_83 AC 1,923 ms
9,624 KB
testcase_84 AC 1,922 ms
10,212 KB
testcase_85 AC 1,921 ms
9,776 KB
testcase_86 AC 1,914 ms
9,128 KB
testcase_87 AC 1,909 ms
9,804 KB
testcase_88 AC 1,933 ms
9,864 KB
testcase_89 AC 1,921 ms
9,380 KB
testcase_90 AC 1,907 ms
9,700 KB
testcase_91 AC 1,913 ms
9,736 KB
testcase_92 AC 1,925 ms
9,580 KB
testcase_93 AC 1,934 ms
10,524 KB
testcase_94 AC 1,908 ms
9,932 KB
testcase_95 AC 1,905 ms
9,444 KB
testcase_96 AC 1,927 ms
9,996 KB
testcase_97 AC 1,908 ms
9,844 KB
testcase_98 AC 1,911 ms
9,916 KB
testcase_99 AC 1,908 ms
9,408 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

START_TIME = Time.utc.to_unix_ms
TL         = 1900
N          = 1400
M          =  256
INF        = 1 << 29
RND        = Random.new(2)

macro debug(msg)
  {% if flag?(:trace) %}
    STDERR.puts({{msg}})
  {% end %}
end

macro debugf(format_string, *args)
  {% if flag?(:trace) %}
    STDERR.printf({{format_string}}, {{*args}})
  {% end %}
end

class IndexSet
  getter :upper

  def initialize(@upper : Int32)
    @que = [] of Int32
    @pos = Array(Int32).new(@upper, -1)
  end

  def add(v)
    if @pos[v] == -1
      @pos[v] = @que.size
      @que << v
    end
  end

  def remove(v)
    p = @pos[v]
    b = @que[-1]
    @que[p] = b
    @que.pop
    @pos[b] = p
    @pos[v] = -1
  end

  def get_random
    @que[RND.rand(@que.size)]
  end

  def size
    @que.size
  end

  def to_s(io)
    @que.to_s(io)
  end
end

class Result
  property :bits, :score

  def initialize(@bits : Array(Int32), @score : Int32)
  end

  def to_s(io)
    io << @bits.map { |v| v == -1 ? 0 : v }.reverse.join
  end
end

struct Cond
  getter :var, :val

  def initialize(@var : Int32, @val : Int32)
  end
end

alias Term = Tuple(Cond, Cond, Cond)

class Solver
  def initialize(@timelimit : Int64)
    @terms = Array(Term).new(N) do
      a, b, c, p, q, r = read_line.split.map(&.to_i)
      {Cond.new(a, p), Cond.new(b, q), Cond.new(c, r)}
    end
    @var_pos = Array(Array(Tuple(Int32, Int32))).new(M) { [] of Tuple(Int32, Int32) }
    N.times do |i|
      3.times do |j|
        term = @terms[i][j]
        @var_pos[term.var] << {i, term.val}
      end
    end
    @best_result = Result.new(Array.new(M, -1), 0)
    @ans = Array(Int32).new(M, -1)
    @search_order = [0, 1, 2]
    @dfs_count = 0
    @eval = Array(Int32).new(3, 0)
    @ok_count = Array(Int32).new(N, 0)
    @ng_count = Array(Int32).new(N, 0)
    @pass = Array(Bool).new(N) do |i|
      ts = @terms[i]
      [[0, 1], [1, 2], [2, 0]].any? { |ps| ts[ps[0]].var == ts[ps[1]].var && ts[ps[0]].var != ts[ps[1]].var }
    end
  end

  def solve
    solve_single()
    turn = 0
    while true
      if Time.utc.to_unix_ms > @timelimit
        break
      end
      solve_single()
      turn += 1
    end
    {% if flag?(:local) %}
      STDERR.puts("validate_score:#{score(@best_result.bits)}")
    {% end %}
    return @best_result
  end

  def solve_single
    @ans.fill(-1)
    @dfs_count = 0
    @ok_count.fill(0)
    # @ng_count.fill(0)
    pos = 0
    while pos < N
      if try_next(pos)
        while pos < N && @ok_count[pos] > 0
          pos += 1
        end
        if pos > @best_result.score
          @best_result.score = pos
          @best_result.bits[0, M] = @ans
          debug("best_score:#{pos}")
        end
        # if score(@ans) != pos
        #   debug("validate_score:#{score(@ans)} score:#{pos}")
        #   exit
        # end
      else
        break
      end
      if Time.utc.to_unix_ms > @timelimit
        break
      end
    end
  end

  def try_next(pos)
    shuffle(@search_order)
    3.times do |i|
      t = @terms[pos][@search_order[i]]
      if @ans[t.var] == -1
        @ans[t.var] = t.val
        @var_pos[t.var].each do |ps|
          p, v = ps
          if v == t.val
            @ok_count[p] += 1
            # else
            #   @ng_count[p] += 1
          end
        end
        return true
      end
    end
    10.times do
      set = IndexSet.new(N)
      set.add(pos)
      @dfs_count = 0
      if try_dfs(pos, set, -1)
        return true
      end
      if Time.utc.to_unix_ms > @timelimit
        break
      end
    end
    return false
  end

  def try_dfs(pos, set, prev_var)
    # debug("try_dfs:#{pos} #{set}")
    if set.size == 0
      return true
    end
    if @dfs_count > 10000 || set.size > 7
      return false
    end
    cur = set.get_random
    shuffle(@search_order)
    tc = 0
    3.times do |i|
      t = @terms[cur][@search_order[i]]
      next if t.var == prev_var
      old = @ans[t.var]
      @ans[t.var] = t.val
      @var_pos[t.var].each do |ps|
        p, v = ps
        if v == t.val
          @ok_count[p] += 1
          # @ng_count[p] -= 1
          if p <= pos && @ok_count[p] == 1
            set.remove(p)
          end
        elsif old != -1
          @ok_count[p] -= 1
          # @ng_count[p] += 1
          if p <= pos && @ok_count[p] == 0
            set.add(p)
          end
        end
      end
      tc += 1
      if tc == 2
        @dfs_count += 1
      end
      if try_dfs(pos, set, t.var)
        return true
      end
      @ans[t.var] = old
      @var_pos[t.var].each do |ps|
        p, v = ps
        if v == t.val
          @ok_count[p] -= 1
          # @ng_count[p] += 1
          if p <= pos && @ok_count[p] == 0
            set.add(p)
          end
        elsif old != -1
          @ok_count[p] += 1
          # @ng_count[p] -= 1
          if p <= pos && @ok_count[p] == 1
            set.remove(p)
          end
        end
      end
    end
    return false
  end

  def shuffle(a)
    (a.size - 1).times do |i|
      pos = RND.rand(a.size - i) + i
      a[i], a[pos] = a[pos], a[i]
    end
  end

  def score(ans)
    N.times do |i|
      if @terms[i].all? { |t| ans[t.var] != t.val }
        return i
      end
    end
    return N
  end
end

def main
  solver = Solver.new(START_TIME + TL)
  res = solver.solve
  puts res
  {% if flag?(:local) %}
    STDERR.puts("final_score:#{res.score}")
  {% end %}
end

main
0