結果
| 問題 | No.3534 Make Many Fences |
| コンテスト | |
| ユーザー |
tenten
|
| 提出日時 | 2026-05-21 10:55:39 |
| 言語 | Java (openjdk 25.0.2) |
| 結果 |
AC
|
| 実行時間 | 125 ms / 1,000 ms |
| コード長 | 3,305 bytes |
| 記録 | |
| コンパイル時間 | 3,836 ms |
| コンパイル使用メモリ | 83,572 KB |
| 実行使用メモリ | 44,484 KB |
| 最終ジャッジ日時 | 2026-05-21 10:55:45 |
| 合計ジャッジ時間 | 4,375 ms |
|
ジャッジサーバーID (参考情報) |
judge2_1 / judge3_0 |
| 純コード判定待ち |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 9 |
ソースコード
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 t = sc.nextInt();
StringBuilder sb = new StringBuilder();
while (t-- > 0) {
sb.append(calc(sc.nextInt(), sc.nextInt())).append("\n");
}
System.out.print(sb);
}
static long calc(int n, int m) {
int count = Math.min(n / 4, m / 2);
n -= count * 4;
m -= count * 2;
int ans = count;
ans += n / 10 * 2;
n %= 10;
if (n >= 6) {
ans++;
}
return (long)ans * 3;
}
}
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