結果

問題 No.2099 [Cherry Alpha B] Time Machine
ユーザー CuriousFairy315CuriousFairy315
提出日時 2022-10-14 22:31:40
言語 Java21
(openjdk 21)
結果
AC  
実行時間 372 ms / 2,000 ms
コード長 9,065 bytes
コンパイル時間 2,452 ms
コンパイル使用メモリ 81,708 KB
実行使用メモリ 37,736 KB
最終ジャッジ日時 2024-06-26 15:52:49
合計ジャッジ時間 25,767 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 297 ms
37,440 KB
testcase_01 AC 303 ms
37,476 KB
testcase_02 AC 302 ms
37,592 KB
testcase_03 AC 299 ms
37,620 KB
testcase_04 AC 199 ms
37,444 KB
testcase_05 AC 292 ms
37,596 KB
testcase_06 AC 300 ms
37,604 KB
testcase_07 AC 292 ms
37,496 KB
testcase_08 AC 298 ms
37,288 KB
testcase_09 AC 298 ms
37,432 KB
testcase_10 AC 298 ms
37,556 KB
testcase_11 AC 292 ms
37,456 KB
testcase_12 AC 295 ms
37,604 KB
testcase_13 AC 302 ms
37,368 KB
testcase_14 AC 205 ms
37,396 KB
testcase_15 AC 295 ms
37,592 KB
testcase_16 AC 306 ms
37,432 KB
testcase_17 AC 300 ms
37,544 KB
testcase_18 AC 362 ms
37,504 KB
testcase_19 AC 372 ms
37,416 KB
testcase_20 AC 316 ms
37,616 KB
testcase_21 AC 303 ms
37,624 KB
testcase_22 AC 296 ms
37,496 KB
testcase_23 AC 293 ms
37,584 KB
testcase_24 AC 355 ms
37,260 KB
testcase_25 AC 299 ms
37,312 KB
testcase_26 AC 292 ms
37,608 KB
testcase_27 AC 299 ms
37,408 KB
testcase_28 AC 295 ms
37,444 KB
testcase_29 AC 198 ms
37,604 KB
testcase_30 AC 296 ms
37,632 KB
testcase_31 AC 297 ms
37,416 KB
testcase_32 AC 291 ms
37,620 KB
testcase_33 AC 288 ms
37,396 KB
testcase_34 AC 194 ms
37,632 KB
testcase_35 AC 290 ms
37,620 KB
testcase_36 AC 286 ms
37,460 KB
testcase_37 AC 289 ms
37,396 KB
testcase_38 AC 290 ms
37,556 KB
testcase_39 AC 285 ms
37,532 KB
testcase_40 AC 290 ms
37,488 KB
testcase_41 AC 294 ms
37,704 KB
testcase_42 AC 305 ms
37,584 KB
testcase_43 AC 296 ms
37,540 KB
testcase_44 AC 298 ms
37,580 KB
testcase_45 AC 307 ms
37,692 KB
testcase_46 AC 290 ms
37,704 KB
testcase_47 AC 296 ms
37,432 KB
testcase_48 AC 293 ms
37,496 KB
testcase_49 AC 199 ms
37,620 KB
testcase_50 AC 293 ms
37,492 KB
testcase_51 AC 292 ms
37,736 KB
testcase_52 AC 300 ms
37,412 KB
testcase_53 AC 201 ms
37,396 KB
testcase_54 AC 256 ms
37,592 KB
testcase_55 AC 311 ms
37,624 KB
testcase_56 AC 292 ms
37,432 KB
testcase_57 AC 291 ms
37,632 KB
testcase_58 AC 296 ms
37,456 KB
testcase_59 AC 292 ms
37,464 KB
testcase_60 AC 293 ms
37,256 KB
testcase_61 AC 296 ms
37,584 KB
testcase_62 AC 293 ms
37,560 KB
testcase_63 AC 294 ms
37,496 KB
testcase_64 AC 296 ms
37,592 KB
testcase_65 AC 302 ms
37,632 KB
testcase_66 AC 290 ms
37,496 KB
testcase_67 AC 301 ms
37,592 KB
testcase_68 AC 294 ms
37,460 KB
testcase_69 AC 296 ms
37,604 KB
testcase_70 AC 294 ms
37,632 KB
testcase_71 AC 301 ms
37,520 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 



public class Main {

	public static void main(String[] args) {
		new Main();
	}

	public Main() {
		FastScanner fs = new FastScanner();
		java.io.PrintWriter out = new java.io.PrintWriter(System.out);
		solve(fs, out);
		out.flush();
	}

	public void solve(FastScanner fs, java.io.PrintWriter out) {
		int T = fs.nextInt();
		int X = fs.nextInt(), A = fs.nextInt();
		int Y = fs.nextInt(), B = fs.nextInt();
		long ans = Long.MAX_VALUE;
		for (long i = 0;i <= 20000000;++ i) {
			long tmp = i * Y;
			long day = -B * (long)i;
			if (day > T) continue;
			tmp += (T - day) / A * X;
			tmp += (T - day) % A;
			ans = Math.min(ans, tmp);
		}
		out.println(ans);
	}

	final int MOD = 998_244_353;
	int plus(int n, int m) {
		int sum = n + m;
		if (sum >= MOD) sum -= MOD;
		return sum;
	}
	int minus(int n, int m) {
		int sum = n - m;
		if (sum < 0) sum += MOD;
		return sum;
	}
	int times(int n, int m) {
		return (int)((long)n * m % MOD);
	}
	int divide(int n, int m) {
		return times(n, IntMath.pow(m, MOD - 2, MOD));
	}
	int[] fact, invf;
	void calc(int len) {
		len += 2;
		fact = new int[len];
		invf = new int[len];
		fact[0] = fact[1] = invf[0] = invf[1] = 1;
		for (int i = 2;i < fact.length;++ i) fact[i] = times(fact[i - 1], i);
		invf[len - 1] = divide(1, fact[len - 1]);
		for (int i = len - 1;i > 1;-- i) invf[i - 1] = times(i, invf[i]);
	}
	int comb(int n, int m) {
		if (n < m) return 0;
		return times(fact[n], times(invf[n - m], invf[m]));
	}
}

class FastScanner {

	private final java.io.InputStream in = System.in;
	private final byte[] buffer = new byte[8192];
	private int ptr = 0;
	private int buflen = 0;

	private boolean hasNextByte() {
		if (ptr < buflen) return true;
		ptr = 0;
		try {
			buflen = in.read(buffer);
		} catch (java.io.IOException e) {
			e.printStackTrace();
		}
		return buflen > 0;
	}

	private byte readByte() {
		return hasNextByte() ? buffer[ptr++ ] : -1;
	}

	private static boolean isPrintableChar(byte c) {
		return 32 < c || c < 0;
	}

	private static boolean isNumber(int c) {
		return '0' <= c && c <= '9';
	}

	public boolean hasNext() {
		while (hasNextByte() && !isPrintableChar(buffer[ptr]))
			ptr++ ;
		return hasNextByte();
	}

	public String next() {
		if (!hasNext()) throw new java.util.NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		byte b;
		while (isPrintableChar(b = readByte()))
			sb.appendCodePoint(b);
		return sb.toString();
	}

	public final char nextChar() {
		if (!hasNext()) throw new java.util.NoSuchElementException();
		return (char)readByte();
	}

	public final long nextLong() {
		if (!hasNext()) throw new java.util.NoSuchElementException();
		long n = 0;
		try {
			byte b = readByte();
			if (b == '-') {
				while (isNumber(b = readByte()))
					n = n * 10 + '0' - b;
				return n;
			} else if (!isNumber(b)) throw new NumberFormatException();
			do
				n = n * 10 + b - '0';
			while (isNumber(b = readByte()));
		} catch (java.util.NoSuchElementException e) {}
		return n;
	}

	public final int nextInt() {
		if (!hasNext()) throw new java.util.NoSuchElementException();
		int n = 0;
		try {
			byte b = readByte();
			if (b == '-') {
				while (isNumber(b = readByte()))
					n = n * 10 + '0' - b;
				return n;
			} else if (!isNumber(b)) throw new NumberFormatException();
			do
				n = n * 10 + b - '0';
			while (isNumber(b = readByte()));
		} catch (java.util.NoSuchElementException e) {}
		return n;
	}

	public double nextDouble() {
		return Double.parseDouble(next());
	}
}

class Arrays {

	public static void sort(final int[] array) {
		sort(array, 0, array.length);
	}

	public static void sort(final int[] array, int fromIndex, int toIndex) {
		if (toIndex - fromIndex  <= 512) {
			java.util.Arrays.sort(array, fromIndex, toIndex);
			return;
		}
		sort(array, fromIndex, toIndex, 0, new int[array.length]);
	}

	private static final void sort(int[] a, final int from, final int to, final int l, final int[] bucket) {
		if (to - from  <= 512) {
			java.util.Arrays.sort(a, from, to);
			return;
		}
		final int BUCKET_SIZE = 256;
		final int INT_RECURSION = 4;
		final int MASK = 0xff;
		final int shift = l << 3;
		final int[] cnt = new int[BUCKET_SIZE + 1];
		final int[] put = new int[BUCKET_SIZE];
		for (int i = from; i < to; i++) ++ cnt[(a[i] >>> shift & MASK) + 1];
		for (int i = 0; i < BUCKET_SIZE; i++) cnt[i + 1] += cnt[i];
		for (int i = from; i < to; i++) {
			int bi = a[i] >>> shift & MASK;
			bucket[cnt[bi] + put[bi]++] = a[i];
		}
		for (int i = BUCKET_SIZE - 1, idx = from; i >= 0; i--) {
			int begin = cnt[i];
			int len = cnt[i + 1] - begin;
			System.arraycopy(bucket, begin, a, idx, len);
			idx += len;
	    }
		final int nxtL = l + 1;
		if (nxtL < INT_RECURSION) {
			sort(a, from, to, nxtL, bucket);
			if (l == 0) {
				int lft, rgt;
				lft = from - 1; rgt = to;
				while (rgt - lft > 1) {
					int mid = lft + rgt >> 1;
					if (a[mid] < 0) lft = mid;
					else rgt = mid;
				}
				reverse(a, from, rgt);
				reverse(a, rgt, to);
	        }
	    }
	}

	public static void sort(final long[] array) {
		sort(array, 0, array.length);
	}

	public static void sort(final long[] array, int fromIndex, int toIndex) {
		if (toIndex - fromIndex  <= 512) {
			java.util.Arrays.sort(array, fromIndex, toIndex);
			return;
		}
		sort(array, fromIndex, toIndex, 0, new long[array.length]);
	}

	private static final void sort(long[] a, final int from, final int to, final int l, final long[] bucket) {
		final int BUCKET_SIZE = 256;
		final int LONG_RECURSION = 8;
		final int MASK = 0xff;
		final int shift = l << 3;
		final int[] cnt = new int[BUCKET_SIZE + 1];
		final int[] put = new int[BUCKET_SIZE];
		for (int i = from; i < to; i++) ++ cnt[(int) ((a[i] >>> shift & MASK) + 1)];
		for (int i = 0; i < BUCKET_SIZE; i++) cnt[i + 1] += cnt[i];
		for (int i = from; i < to; i++) {
			int bi = (int) (a[i] >>> shift & MASK);
			bucket[cnt[bi] + put[bi]++] = a[i];
		}
		for (int i = BUCKET_SIZE - 1, idx = from; i >= 0; i--) {
			int begin = cnt[i];
			int len = cnt[i + 1] - begin;
			System.arraycopy(bucket, begin, a, idx, len);
			idx += len;
	    }
		final int nxtL = l + 1;
		if (nxtL < LONG_RECURSION) {
			sort(a, from, to, nxtL, bucket);
			if (l == 0) {
				int lft, rgt;
				lft = from - 1; rgt = to;
				while (rgt - lft > 1) {
					int mid = lft + rgt >> 1;
					if (a[mid] < 0) lft = mid;
					else rgt = mid;
				}
				reverse(a, from, rgt);
				reverse(a, rgt, to);
	        }
	    }
	}

	public static void reverse(int[] array) {
		reverse(array, 0, array.length);
	}

	public static void reverse(int[] array, int fromIndex, int toIndex) {
		for (-- toIndex;fromIndex < toIndex;++ fromIndex, -- toIndex) {
			int swap = array[fromIndex];
			array[fromIndex] = array[toIndex];
			array[toIndex] = swap;
		}
	}

	public static void reverse(long[] array) {
		reverse(array, 0, array.length);
	}

	public static void reverse(long[] array, int fromIndex, int toIndex) {
		for (-- toIndex;fromIndex < toIndex;++ fromIndex, -- toIndex) {
			long swap = array[fromIndex];
			array[fromIndex] = array[toIndex];
			array[toIndex] = swap;
		}
	}

	public static void shuffle(int[] array) {
		java.util.Random rnd = new java.util.Random();
		for (int i = 0;i < array.length;++ i) {
			int j = rnd.nextInt(array.length - i) + i;
			int swap = array[i];
			array[i] = array[j];
			array[j] = swap;
		}
	}

	public static void shuffle(long[] array) {
		java.util.Random rnd = new java.util.Random();
		for (int i = 0;i < array.length;++ i) {
			int j = rnd.nextInt(array.length - i) + i;
			long swap = array[i];
			array[i] = array[j];
			array[j] = swap;
		}
	}
}

class IntMath {

	public static int gcd(int a, int b) {
		while (a != 0)
			if ((b %= a) != 0) a %= b;
			else return a;
		return b;
	}

	public static int gcd(int... array) {
		int ret = array[0];
		for (int i = 1; i < array.length; ++i)
			ret = gcd(ret, array[i]);
		return ret;
	}

	public static long gcd(long a, long b) {
		while (a != 0)
			if ((b %= a) != 0) a %= b;
			else return a;
		return b;
	}

	public static long gcd(long... array) {
		long ret = array[0];
		for (int i = 1; i < array.length; ++i)
			ret = gcd(ret, array[i]);
		return ret;
	}

	public static long lcm(long a, long b) {
		return a / gcd(a, b) * b;
	}

	public static int pow(int a, int b) {
		int ans = 1;
		for (int mul = a; b > 0; b >>= 1, mul *= mul)
			if ((b & 1) != 0) ans *= mul;
		return ans;
	}

	public static long pow(long a, long b) {
		long ans = 1;
		for (long mul = a; b > 0; b >>= 1, mul *= mul)
			if ((b & 1) != 0) ans *= mul;
		return ans;
	}

	public static int pow(int a, long b, int mod) {
		if (b < 0) b = b % (mod - 1) + mod - 1;
		long ans = 1;
		for (long mul = a; b > 0; b >>= 1, mul = mul * mul % mod)
			if ((b & 1) != 0) ans = ans * mul % mod;
		return (int)ans;
	}

	public static int pow(long a, long b, int mod) {
		return pow((int)(a % mod), b, mod);
	}

	public static int floorsqrt(long n) {
		return (int)Math.sqrt(n + 0.1);
	}

	public static int ceilsqrt(long n) {
		return n <= 1 ? (int)n : (int)Math.sqrt(n - 0.1) + 1;
	}
}
0