結果
| 問題 |
No.3281 Pacific White-sided Dolphin vs Monster
|
| コンテスト | |
| ユーザー |
tenten
|
| 提出日時 | 2025-10-01 16:17:25 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 848 ms / 2,000 ms |
| コード長 | 3,754 bytes |
| コンパイル時間 | 6,559 ms |
| コンパイル使用メモリ | 90,556 KB |
| 実行使用メモリ | 54,764 KB |
| 最終ジャッジ日時 | 2025-10-03 17:39:15 |
| 合計ジャッジ時間 | 20,940 ms |
|
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 51 |
ソースコード
import java.io.*;
import java.util.*;
import java.util.function.*;
import java.util.stream.*;
import java.math.*;
public class Main {
public static void main(String[] args) throws Exception {
FastScanner sc = new FastScanner();
int n = sc.nextInt();
List<Long> list = new ArrayList<>();
for (int i = 0; i < n; i++) {
list.add(sc.nextLong());
}
int left = -1;
int right = 60 + n;
while (right - left > 1) {
int m = (left + right) / 2;
PriorityQueue<Long> queue = new PriorityQueue<>((a, b) -> Long.compare(b, a));
queue.addAll(list);
int x = m;
while (queue.size() > 0 && x >= 0) {
if (x >= 60) {
queue.poll();
} else {
long y = queue.poll();
if (y > (1L << x)) {
queue.add(y - (1L << x));
}
}
x--;
}
if (queue.size() > 0) {
left = m;
} else {
right = m;
}
}
System.out.println(right + 1);
}
}
class FastScanner {
private DataInputStream din;
private byte[] buffer;
private int bufferPointer, bytesRead;
private static final int BUFFER_SIZE = 1 << 16; // 65,536 バイト
public FastScanner() {
din = new DataInputStream(System.in);
buffer = new byte[BUFFER_SIZE];
bufferPointer = bytesRead = 0;
}
private byte read() {
try {
if (bufferPointer == bytesRead) {
bytesRead = din.read(buffer, 0, BUFFER_SIZE);
if (bytesRead == -1) return -1;
bufferPointer = 0;
}
return buffer[bufferPointer++];
} catch (IOException e) {
throw new RuntimeException(e);
}
}
public String next() {
byte b = read();
// 空白文字を読み飛ばす
while (isSpaceChar(b)) {
b = read();
}
StringBuilder sb = new StringBuilder();
while (!isSpaceChar(b)) {
sb.append((char) b);
b = read();
}
return sb.toString();
}
public int nextInt() {
int ret = 0;
byte c = read();
while (isSpaceChar(c)) c = read();
boolean neg = (c == '-');
if (neg) c = read();
do {
ret = ret * 10 + c - '0';
c = read();
} while (!isSpaceChar(c));
return neg ? -ret : ret;
}
public long nextLong() {
long ret = 0;
byte c = read();
while (isSpaceChar(c)) c = read();
boolean neg = (c == '-');
if (neg) c = read();
do {
ret = ret * 10L + c - '0';
c = read();
} while (!isSpaceChar(c));
return neg ? -ret : ret;
}
public double nextDouble() {
double ret = 0, div = 1;
byte c = read();
while (isSpaceChar(c)) c = read();
boolean neg = (c == '-');
if (neg) c = read();
do {
ret = ret * 10 + c - '0';
c = read();
} while (!isSpaceChar(c) && c != '.');
if (c == '.') {
while (!isSpaceChar(c = read())) {
ret += (c - '0') / (div *= 10);
}
}
return neg ? -ret : ret;
}
private boolean isSpaceChar(byte c) {
return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
}
public void close() {
try {
if (din != null) din.close();
} catch (IOException e) {
throw new RuntimeException(e);
}
}
}
tenten