結果

問題 No.2424 Josouzai
ユーザー Yoichiro NishimuraYoichiro Nishimura
提出日時 2023-12-21 09:56:46
言語 PHP
(8.3.4)
結果
AC  
実行時間 120 ms / 2,000 ms
コード長 3,365 bytes
コンパイル時間 1,465 ms
コンパイル使用メモリ 32,528 KB
実行使用メモリ 57,016 KB
最終ジャッジ日時 2024-09-27 10:51:49
合計ジャッジ時間 6,734 ms
ジャッジサーバーID
(参考情報)
judge1 / judge5
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 41 ms
32,400 KB
testcase_01 AC 41 ms
32,404 KB
testcase_02 AC 41 ms
32,404 KB
testcase_03 AC 41 ms
32,404 KB
testcase_04 AC 63 ms
38,968 KB
testcase_05 AC 120 ms
57,016 KB
testcase_06 AC 119 ms
54,968 KB
testcase_07 AC 118 ms
55,096 KB
testcase_08 AC 120 ms
57,016 KB
testcase_09 AC 43 ms
32,528 KB
testcase_10 AC 59 ms
38,840 KB
testcase_11 AC 92 ms
50,748 KB
testcase_12 AC 79 ms
48,828 KB
testcase_13 AC 64 ms
38,844 KB
testcase_14 AC 82 ms
43,108 KB
testcase_15 AC 47 ms
34,488 KB
testcase_16 AC 110 ms
52,796 KB
testcase_17 AC 59 ms
38,456 KB
testcase_18 AC 63 ms
38,716 KB
testcase_19 AC 79 ms
42,680 KB
testcase_20 AC 110 ms
52,924 KB
testcase_21 AC 93 ms
50,876 KB
testcase_22 AC 63 ms
38,712 KB
testcase_23 AC 69 ms
42,556 KB
testcase_24 AC 54 ms
36,280 KB
testcase_25 AC 113 ms
53,048 KB
testcase_26 AC 94 ms
50,876 KB
testcase_27 AC 116 ms
52,920 KB
testcase_28 AC 107 ms
52,920 KB
testcase_29 AC 100 ms
51,000 KB
testcase_30 AC 56 ms
38,456 KB
testcase_31 AC 77 ms
42,424 KB
testcase_32 AC 116 ms
52,924 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
No syntax errors detected in Main.php

ソースコード

diff #
プレゼンテーションモードにする

<?php
[$N, $K] = ints();
$A = ints();
sort($A);
$ans = 0;
foreach($A as $a){
if($K >= $a){
$K-=$a;
$ans++;
}
}
echo "$ans $K";
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);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;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0