#126921 (Java21) No.438 Cwwプログラミング入門

提出ソース

結果

問題	No.438 Cwwプログラミング入門
ユーザー	hiromi_ayase
提出日時	2016-10-28 23:44:19
言語	Java21 (openjdk 21)
結果	MLE
実行時間	-
コード長	5,171 bytes
コンパイル時間	3,589 ms
コンパイル使用メモリ	80,804 KB
実行使用メモリ	1,073,636 KB
最終ジャッジ日時	2024-11-24 20:51:36
合計ジャッジ時間	79,067 ms
ジャッジサーバーID （参考情報）	judge1 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	47 ms 42,032 KB
testcase_01	MLE	-
testcase_02	AC	49 ms 41,836 KB
testcase_03	MLE	-
testcase_04	AC	50 ms 41,668 KB
testcase_05	MLE	-
testcase_06	MLE	-
testcase_07	AC	47 ms 56,736 KB
testcase_08	WA	-
testcase_09	MLE	-
testcase_10	MLE	-
testcase_11	WA	-
testcase_12	WA	-
testcase_13	MLE	-
testcase_14	MLE	-
testcase_15	MLE	-
testcase_16	WA	-
testcase_17	MLE	-
testcase_18	AC	48 ms 41,928 KB
testcase_19	AC	51 ms 57,168 KB
testcase_20	MLE	-
testcase_21	WA	-
testcase_22	MLE	-
testcase_23	WA	-
testcase_24	MLE	-
testcase_25	MLE	-
testcase_26	WA	-
testcase_27	MLE	-
testcase_28	RE	-
testcase_29	AC	47 ms 50,312 KB
testcase_30	AC	48 ms 41,848 KB
testcase_31	WA	-
testcase_32	WA	-
testcase_33	WA	-
testcase_34	WA	-
testcase_35	WA	-
testcase_36	WA	-
testcase_37	AC	49 ms 36,828 KB
testcase_38	AC	48 ms 36,672 KB
testcase_39	AC	49 ms 36,780 KB
testcase_40	AC	49 ms 36,648 KB
testcase_41	WA	-
testcase_42	WA	-
testcase_43	RE	-
testcase_44	WA	-
testcase_45	WA	-
testcase_46	AC	51 ms 36,808 KB
testcase_47	WA	-
testcase_48	TLE	-
testcase_49	WA	-
testcase_50	AC	48 ms 36,668 KB
testcase_51	AC	920 ms 253,380 KB
testcase_52	WA	-
testcase_53	WA	-
testcase_54	AC	49 ms 36,620 KB
testcase_55	WA	-
testcase_56	WA	-
testcase_57	WA	-
testcase_58	AC	49 ms 36,760 KB
testcase_59	WA	-
testcase_60	WA	-
testcase_61	WA	-
testcase_62	AC	49 ms 36,860 KB
testcase_63	WA	-
testcase_64	WA	-
testcase_65	AC	50 ms 36,764 KB
testcase_66	WA	-
testcase_67	AC	49 ms 36,780 KB
testcase_68	WA	-
testcase_69	TLE	-
testcase_70	TLE	-
testcase_71	TLE	-
testcase_72	TLE	-
testcase_73	TLE	-
testcase_74	TLE	-
testcase_75	TLE	-
testcase_76	WA	-
testcase_77	TLE	-
testcase_78	TLE	-
testcase_79	AC	48 ms 36,828 KB
testcase_80	TLE	-
testcase_81	AC	51 ms 36,700 KB
testcase_82	TLE	-
testcase_83	TLE	-
testcase_84	AC	48 ms 36,648 KB
testcase_85	AC	48 ms 36,284 KB
testcase_86	TLE	-
testcase_87	TLE	-
testcase_88	RE	-
testcase_89	RE	-
testcase_90	RE	-
testcase_91	RE	-
testcase_92	RE	-
testcase_93	RE	-
testcase_94	RE	-
testcase_95	WA	-
testcase_96	AC	51 ms 36,748 KB
testcase_97	TLE	-
testcase_98	AC	49 ms 36,828 KB
testcase_99	TLE	-
testcase_100	MLE	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

import java.io.IOException;
import java.io.InputStream;
import java.util.ArrayDeque;
import java.util.NoSuchElementException;

public class Main {
	public static void main(String[] args) {
		FastScanner sc = new FastScanner();
		long x = sc.nextLong();
		long y = sc.nextLong();
		long z = sc.nextLong();
		// run("cwwCwCW", 2, 3);

		long[] gcd = exGCD(x, y);
		if (z % gcd[0] != 0 || z / Math.max(x, y) >= 10000) {
			System.out.println("mourennaihasimasenn");
		} else {
			boolean xy = x > y;
			long p = xy ? z / x : z / y;

			z -= xy ? p * x : p * y;

			long a = gcd[1] * z / gcd[0];
			long b = gcd[2] * z / gcd[0];

			ArrayDeque<Character> queue = new ArrayDeque<>();
			if (a > 0) {
				for (int i = 0; i < a; i++)
					queue.add('c');
				for (int i = 0; i < a - 1; i++)
					queue.add('C');

				if (b > 0) {
					for (int i = 0; i < b; i++) {
						queue.add('w');
						queue.add('C');
					}
				} else if (b < 0) {
					queue.addFirst('w');
					for (int i = 0; i < -b - 1; i++) {
						queue.addFirst('w');
						queue.addFirst('C');
					}
					queue.add('W');
				}
			} else {
				for (int i = 0; i < b; i++)
					queue.add('w');
				for (int i = 0; i < b - 1; i++)
					queue.add('C');

				if (a > 0) {
					for (int i = 0; i < a; i++) {
						queue.add('c');
						queue.add('C');
					}
				} else if (a < 0) {
					queue.addFirst('c');
					for (int i = 0; i < -a - 1; i++) {
						queue.addFirst('c');
						queue.addFirst('C');
					}
					queue.add('W');
				}
			}
			for (int i = 0; i < p; i++) {
				queue.add(xy ? 'c' : 'w');
				queue.add('C');
			}

			if (queue.size() > 10000) {
				System.out.println("mourennaihasimasenn");
			} else {
				StringBuilder sb = new StringBuilder();
				for (char c : queue) {
					sb.append(c);
				}
				System.out.println(sb);
				// run(sb.toString(), x, y);
			}
		}
	}

	public static long[] exGCD(long a, long b) {
		if (a == 0 || b == 0)
			return null;
		int as = Long.signum(a);
		int bs = Long.signum(b);
		a = Math.abs(a);
		b = Math.abs(b);
		long p = 1, q = 0, r = 0, s = 1;
		while (b > 0) {
			long c = a / b;
			long d;
			d = a;
			a = b;
			b = d % b;
			d = p;
			p = q;
			q = d - c * q;
			d = r;
			r = s;
			s = d - c * s;
		}
		return new long[] { a, p * as, r * bs };
	}

	private static void run(String s, long x, long y) {
		long[] stack = new long[100000];
		int ptr = 0;
		for (int c : s.toCharArray()) {
			if (c == 'c') {
				stack[ptr++] = x;
			} else if (c == 'w') {
				stack[ptr++] = y;
			} else if (c == 'C') {
				ptr--;
				stack[ptr - 1] = stack[ptr] + stack[ptr - 1];
			} else if (c == 'W') {
				ptr--;
				stack[ptr - 1] = stack[ptr] - stack[ptr - 1];
			}
		}
		System.out.println(stack[ptr - 1]);
	}
}

class FastScanner {
	public static String debug = null;

	private final InputStream in = System.in;
	private int ptr = 0;
	private int buflen = 0;
	private byte[] buffer = new byte[1024];
	private boolean eos = false;

	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		} else {
			ptr = 0;
			try {
				if (debug != null) {
					buflen = debug.length();
					buffer = debug.getBytes();
					debug = "";
					eos = true;
				} else {
					buflen = in.read(buffer);
				}
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen < 0) {
				eos = true;
				return false;
			} else if (buflen == 0) {
				return false;
			}
		}
		return true;
	}

	private int readByte() {
		if (hasNextByte())
			return buffer[ptr++];
		else
			return -1;
	}

	private static boolean isPrintableChar(int c) {
		return 33 <= c && c <= 126;
	}

	private void skipUnprintable() {
		while (hasNextByte() && !isPrintableChar(buffer[ptr]))
			ptr++;
	}

	public boolean isEOS() {
		return this.eos;
	}

	public boolean hasNext() {
		skipUnprintable();
		return hasNextByte();
	}

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

	public long nextLong() {
		if (!hasNext())
			throw new NoSuchElementException();
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while (true) {
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			} else if (b == -1 || !isPrintableChar(b)) {
				return minus ? -n : n;
			} else {
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}

	public int nextInt() {
		return (int) nextLong();
	}

	public long[] nextLongList(int n) {
		return nextLongTable(1, n)[0];
	}

	public int[] nextIntList(int n) {
		return nextIntTable(1, n)[0];
	}

	public long[][] nextLongTable(int n, int m) {
		long[][] ret = new long[n][m];
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				ret[i][j] = nextLong();
			}
		}
		return ret;
	}

	public int[][] nextIntTable(int n, int m) {
		int[][] ret = new int[n][m];
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				ret[i][j] = nextInt();
			}
		}
		return ret;
	}
}

yukicoder

結果

テストケース

ソースコード