<div id="readability-page-1" class="page"><article id="mainContent">
                                <div>
                                    <p><a href="/m/category/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98"><span>알고리즘</span></a></p><h3>[백준 / javascript] 13305번 주유소</h3>
                                </div>
                                <p><cite>Suhyeon Lee</cite>
                                    <span> 2023. 4. 10. 17:35</span>
                                </p>
                                
                            <div>
                                <p data-ke-size="size16"><a href="https://www.acmicpc.net/problem/13305">https://www.acmicpc.net/problem/13305</a></p>
<pre><code>// 13305 : 주유소

const readFile = process.platform === 'linux' ? '/dev/stdin' : 't.txt';

let [n, d, price] = require('fs')
  .readFileSync(readFile)
  .toString()
  .trim()
  .split('\\n');

n = Number(n);

// n의 최댓값이 10^5, 거리와 가격은 10^9로 매우 크므로, BigInt를 사용
d = d.split(' ').map((i) =&gt; BigInt(i));
price = price.split(' ').map((i) =&gt; BigInt(i));

let curPrice = price[0];
let cost = 0n;

for (let i = 0; i &lt; n - 1; i++) {
  cost += curPrice * d[i];
  if (curPrice &gt; price[i + 1]) {
    curPrice = price[i + 1];
  }
}

console.log(String(cost));
</code></pre>
            
            
                </div>
            


<ins data-ad-client="ca-pub-9527582522912841" data-ad-slot="3250933968" data-ad-format="auto" data-full-width-responsive="true" data-ad-type="inventory"></ins>


                                            
            
                            </article></div>

공부 기록하는 블로그

Suhyeon Lee

https://www.acmicpc.net/problem/13305
// 13305 : 주유소
const readFile = process.platform === 'linux' ? '/dev/stdin' : 't.txt';
let [n, d, price] = require('fs')
  .readFileSync(readFile)
  .toString()
  .trim()
  .split('\\n');
n = Number(n);
// n의 최댓값이 10^5, 거리와 가격은 10^9로 매우 크므로, BigInt를 사용
d = d.split(' ').map((i) => BigInt(i));
price = price.split(' ').map((i) => BigInt(i));
let curPrice = price[0];
let cost = 0n;
for (let i = 0; i < n - 1; i++) {
  cost += curPrice * d[i];
  if (curPrice > price[i + 1]) {
    curPrice = price[i + 1];
  }
}
console.log(String(cost));

[백준 / javascript] 13305번 주유소

댓글