Submission #47306674

---

Source Code Expand

<?php
// 近いうちに動かすところにはできるだけ載せない
// 近いうちに動かすところの評価を非線形にする
// まとめて全部移動させるのではなく近いうちに動かす必要のあるものは分割して移動する
// 得点計算して乱択する
// さらに高速化する。累計で７倍ぐらい速くなった。
[$N, $M] = ints();
for($i = 0; $i < $M; $i++){
    $row = ints();
    $_stacks[] = $row;
    foreach($row as $c => $v){
        $_pos[$v] = [$i, $c];
    }
}
$ansArray = []; $powArray = [];
$time = microtime(true);
for($i = 0; $i < 200; $i++){
    $pi[$i] = 0.88 ** $i;
}
for($x = 0; microtime(true)-$time < 1.9; $x++){
    $stacks = $_stacks;
    $pos = $_pos;
    $pow = 0;
    $ans = [];
    $splitLimit = random_int(15, 20);// 17;
    for($i = 1; $i <= $N; $i++){
        [$r, $c] = $pos[$i];
        if(count($stacks[$r])!=$c+1){
            // 末尾の要素でなければ後ろのものを別のところによける
            $removeArray = [];
            $removeArray[] = $stacks[$r][$c+1];
            $pow++;
            $pow += count($stacks[$r])-$c-1;
            for($j = $c+2, $J = count($stacks[$r])-1; $j < $J; ++$j){
                if($stacks[$r][$j] < $i+$splitLimit){
                    $removeArray[] = $stacks[$r][$j+1];
                    $pow++;
                }
            }

            $removeArray = array_reverse($removeArray);
            foreach($removeArray as $remove){
                $counts = [];
                $I = [];
                for($j = 0; $j < 10; $j++){
                    $counts[$j] = random_int(0,100)*0.001;
                    $I[$j] = $j;
                }
                $D = 100;
                for($j = $i+1, $J = min($i+$D,$N); $j <= $J; ++$j){
                    $counts[$pos[$j][0]]+=$pi[$j-$i];
                }
                array_multisort($counts, $I);
                $j = $I[$I[0]==$r];
                $ans[] = [$remove, $j+1];
                $removed = array_splice($stacks[$r], $pos[$remove][1]);
                foreach($removed as $p => $num){
                    $pos[$num] = [$j, count($stacks[$j])+$p];
                }
                $stacks[$j] = array_merge($stacks[$j], $removed);
            }
        }
        array_pop($stacks[$r]);
        $ans[] = [$i, 0];
    }
    $ansArray[] = $ans;
    $powArray[] = $pow;
}
array_multisort($powArray, $ansArray);
foreach($ansArray[0] as $row){
    echo implode(" ", $row),"\n";
}
error_log("$x");

function qfind($n){
    global $pos;
    return $pos[$n];
}

function str(){return trim(fgets(STDIN));}
function ints($n = false){
  if($n===false){
    $str = trim(fgets(STDIN));if($str == '')return [];
    return array_map('intval',explode(' ',$str));
  }else{$ret = [];for($i = 0; $i < $n; $i++)foreach(array_map('intval',explode(' ',trim(fgets(STDIN)))) as $j => $v)$ret[$j][] = $v;return $ret;}
}
function int(){return intval(trim(fgets(STDIN)));}
function chmax(&$a,$b){if($a<$b){$a=$b;return 1;}return 0;}
function chmin(&$a,$b){if($a>$b){$a=$b;return 1;}return 0;}
function isqrt($n):int{$res=intval(sqrt($n))+1;while($res*$res>$n)$res--;return $res;}
function popcount($x){$c=0;while($x){$x&=$x-1;++$c;}return$c;}
function swap(&$a,&$b){$tmp=$a;$a=$b;$b=$tmp;}
function o(...$val){
  if(count($val)==1)$val=array_shift($val);
  echo debug_backtrace()[0]['line'].")";
  if(is_array($val)){
    if(count($val) == 0)echo "empty array\n";
    elseif(!is_array(current($val)))echo "array: ",implode(" ", addIndex($val)),"\n";
    else{
      echo "array:array\n";
      if(isCleanArray($val))foreach($val as $row)echo implode(" ", addIndex($row)),"\n";
      else foreach($val as $i => $row)echo "[".$i."] ".implode(" ", addIndex($row)),"\n";
    }
  }else echo $val."\n";
}
function addIndex($val){if(!isCleanArray($val)){$val = array_map(function($k, $v){return $k.":".$v;}, array_keys($val), $val);}return $val;}
function isCleanArray($array){$clean=true;$i = 0;foreach($array as $k=>$v){if($k != $i++)$clean = false;}return $clean;}
// 座圧対象の配列 -> [圧縮された配列,復元用のMap,圧縮用のMap]
function atsu($array){$a = array_flip($array);$fuku=array_flip($a);sort($fuku);$atsu = array_flip($fuku);foreach($array as $i=>$val)$array[$i]=$atsu[$val];return [$array, $fuku, $atsu];}
function atsu1($array){$a=array_flip($array);$fuku=array_flip($a);sort($fuku);array_unshift($fuku,0);array_unshift($fuku,0);unset($fuku[0]);$atsu=array_flip($fuku);foreach($array as $i=>$val)$array[$i]=$atsu[$val];return [$array, $fuku, $atsu];}
function median($a){sort($a);$n=count($a);return $n%2?$a[($n-1)/2]:($a[$n/2-1]+$a[$n/2])/2;}
function gcdAll($array){$gcd=$array[0];for($i=1,$I=count($array);$i<$I;++$i){$gcd=gcd($gcd,$array[$i]);}return $gcd;}
function gcd($m, $n){if(!$n)return $m;return gcd($n, $m % $n);}
function lcmAll($array){$lcm=$array[0];for($i=1,$I=count($array);$i<$I;++$i){$lcm=lcm($lcm,$array[$i]);}return $lcm;}
function lcm($a, $b) {return $a / gcd($a, $b) * $b;}
function loadTree($N = false){
  if($N === false)$N = $GLOBALS['N'];
  return loadGraph($N, $N-1);
}
function loadGraph($N = false, $M = false, $both = true){
  if($N === false)$N = $GLOBALS['N'];
  if($M === false)$M = $GLOBALS['M'];
  $G = array_fill(1, $N, []);
  for($i = 0; $i < $M; $i++){
    $values = ints();
    if(count($values) == 2){
      list($a, $b) = $values;
      if($both == 0){
        $G[$a][] = $b;
      }elseif($both == 1){
        $G[$a][] = $b;
        $G[$b][] = $a;
      }else{
        $G[$b][] = $a;
      }
    }else{
      list($a, $b, $d) = $values;
      if($both == 0){
        $G[$a][] = [$b, $d];
      }elseif($both == 1){
        $G[$a][] = [$b, $d];
        $G[$b][] = [$a, $d];
      }else{
        $G[$b][] = [$a, $d];
      }
    }
  }
  return $G;
}

Submission Info

Judge Result