結果
| 問題 | No.968 引き算をして門松列（その３） |
| ユーザー |
 Oland
|
| 提出日時 | 2020-01-13 23:02:11 |
| 言語 | Java21 (openjdk 21) |
| 結果 |
AC
|
| 実行時間 | 148 ms / 2,000 ms |
| コード長 | 7,445 bytes |
| コンパイル時間 | 3,195 ms |
| コンパイル使用メモリ | 74,724 KB |
| 実行使用メモリ | 54,072 KB |
| 最終ジャッジ日時 | 2023-08-24 19:01:35 |
| 合計ジャッジ時間 | 4,606 ms |
|
ジャッジサーバーID （参考情報） |
judge11 / judge13 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 46 ms
49,568 KB |
| testcase_01 | AC | 50 ms
49,496 KB |
| testcase_02 | AC | 47 ms
49,304 KB |
| testcase_03 | AC | 108 ms
53,040 KB |
| testcase_04 | AC | 111 ms
53,320 KB |
| testcase_05 | AC | 115 ms
53,892 KB |
| testcase_06 | AC | 110 ms
53,704 KB |
| testcase_07 | AC | 109 ms
52,748 KB |
| testcase_08 | AC | 140 ms
53,504 KB |
| testcase_09 | AC | 148 ms
54,072 KB |
| testcase_10 | AC | 145 ms
53,808 KB |
| testcase_11 | AC | 138 ms
53,772 KB |
ソースコード
import java.io.*;
import java.util.*;
@SuppressWarnings("unused")
public class Main {
FastScanner in;
PrintWriter out;
int MOD = (int)1e9+7;
long ceil(long a, long b){return (a + b - 1) / b;}
long gcd(long a, long b){return b == 0 ? a : gcd(b, a % b);}
long lcm(long a, long b){return a / gcd(a, b) * b;}
void solve() {
int T = in.nextInt();
for(int i = 0; i < T; i++){
int A = in.nextInt(), B = in.nextInt(), C = in.nextInt();
int Z = in.nextInt(), X = in.nextInt(), Y = in.nextInt();
long ans = Long.MAX_VALUE;
ans = Math.min(ans, cost(B, A, C, Y, X, Z));
ans = Math.min(ans, cost(C, A, B, Z, X, Y));
ans = Math.min(ans, cost(A, C, B, X, Z, Y));
ans = Math.min(ans, cost(B, C, A, Y, Z, X));
if(ans == Long.MAX_VALUE) ans = -1;
out.println(ans);
}
}
long cost(int num1, int num2, int num3, int cost1, int cost2, int cost3){
long res = 0, d = 0;
if(num2 <= num3){
res += (long)((num3 + 1) - num2) * cost2;
d += (long)((num3 + 1) - num2);
num2 = num3 + 1;
}
if(num1 <= num2){
res += (long)((num2 + 1) - num1) * cost1;
d += (long)((num2 + 1) - num1);
num1 = num2 + 1;
}
num3 -= d;
return num3 > 0 ? res : Long.MAX_VALUE;
}
public static void main(String[] args) {
new Main().m();
}
private void m() {
in = new FastScanner(System.in);
out = new PrintWriter(System.out);
/*
try {
String path = "input.txt";
out = new PrintWriter(new BufferedWriter(new FileWriter(new File(path))));
}catch (IOException e){
e.printStackTrace();
}
*/
solve();
out.flush();
in.close();
out.close();
}
static class FastScanner {
private Reader input;
public FastScanner() {this(System.in);}
public FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}
public void close() {
try {
this.input.close();
} catch (IOException e) {
e.printStackTrace();
}
}
public int nextInt() {return (int) nextLong();}
public long nextLong() {
try {
int sign = 1;
int b = input.read();
while ((b < '0' || '9' < b) && b != '-' && b != '+') {
b = input.read();
}
if (b == '-') {
sign = -1;
b = input.read();
} else if (b == '+') {
b = input.read();
}
long ret = b - '0';
while (true) {
b = input.read();
if (b < '0' || '9' < b) return ret * sign;
ret *= 10;
ret += b - '0';
}
} catch (IOException e) {
e.printStackTrace();
return -1;
}
}
public double nextDouble() {
try {
double sign = 1;
int b = input.read();
while ((b < '0' || '9' < b) && b != '-' && b != '+') {
b = input.read();
}
if (b == '-') {
sign = -1;
b = input.read();
} else if (b == '+') {
b = input.read();
}
double ret = b - '0';
while (true) {
b = input.read();
if (b < '0' || '9' < b) break;
ret *= 10;
ret += b - '0';
}
if (b != '.') return sign * ret;
double div = 1;
b = input.read();
while ('0' <= b && b <= '9') {
ret *= 10;
ret += b - '0';
div *= 10;
b = input.read();
}
return sign * ret / div;
} catch (IOException e) {
e.printStackTrace();
return Double.NaN;
}
}
public char nextChar() {
try {
int b = input.read();
while (Character.isWhitespace(b)) {
b = input.read();
}
return (char) b;
} catch (IOException e) {
e.printStackTrace();
return 0;
}
}
public String nextStr() {
try {
StringBuilder sb = new StringBuilder();
int b = input.read();
while (Character.isWhitespace(b)) {
b = input.read();
}
while (b != -1 && !Character.isWhitespace(b)) {
sb.append((char) b);
b = input.read();
}
return sb.toString();
} catch (IOException e) {
e.printStackTrace();
return "";
}
}
public String nextLine() {
try {
StringBuilder sb = new StringBuilder();
int b = input.read();
while (b != -1 && b != '\n') {
sb.append((char) b);
b = input.read();
}
return sb.toString();
} catch (IOException e) {
e.printStackTrace();
return "";
}
}
public int[] nextIntArray(int n) {
int[] res = new int[n];
for (int i = 0; i < n; i++) {
res[i] = nextInt();
}
return res;
}
public int[] nextIntArrayDec(int n) {
int[] res = new int[n];
for (int i = 0; i < n; i++) {
res[i] = nextInt() - 1;
}
return res;
}
public int[] nextIntArray1Index(int n) {
int[] res = new int[n + 1];
for (int i = 0; i < n; i++) {
res[i + 1] = nextInt();
}
return res;
}
public long[] nextLongArray(int n) {
long[] res = new long[n];
for (int i = 0; i < n; i++) {
res[i] = nextLong();
}
return res;
}
public long[] nextLongArrayDec(int n) {
long[] res = new long[n];
for (int i = 0; i < n; i++) {
res[i] = nextLong() - 1;
}
return res;
}
public long[] nextLongArray1Index(int n) {
long[] res = new long[n + 1];
for (int i = 0; i < n; i++) {
res[i + 1] = nextLong();
}
return res;
}
public double[] nextDoubleArray(int n) {
double[] res = new double[n];
for (int i = 0; i < n; i++) {
res[i] = nextDouble();
}
return res;
}
}
}