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

提出ソース

結果

問題	No.438 Cwwプログラミング入門
ユーザー	hiromi_ayase
提出日時	2016-10-29 00:27:28
言語	Java21 (openjdk 21)
結果	WA
実行時間	-
コード長	6,087 bytes
コンパイル時間	2,356 ms
コンパイル使用メモリ	80,312 KB
実行使用メモリ	50,196 KB
最終ジャッジ日時	2024-05-03 19:00:30
合計ジャッジ時間	12,840 ms
ジャッジサーバーID （参考情報）	judge5 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	47 ms 36,648 KB
testcase_01	AC	54 ms 36,540 KB
testcase_02	AC	46 ms 36,760 KB
testcase_03	AC	47 ms 36,728 KB
testcase_04	AC	47 ms 36,748 KB
testcase_05	AC	46 ms 36,332 KB
testcase_06	AC	46 ms 36,648 KB
testcase_07	AC	47 ms 36,724 KB
testcase_08	AC	53 ms 36,600 KB
testcase_09	WA	-
testcase_10	AC	55 ms 37,084 KB
testcase_11	AC	55 ms 36,788 KB
testcase_12	AC	59 ms 36,972 KB
testcase_13	AC	46 ms 36,308 KB
testcase_14	AC	53 ms 36,948 KB
testcase_15	AC	47 ms 36,856 KB
testcase_16	AC	54 ms 36,836 KB
testcase_17	AC	53 ms 36,916 KB
testcase_18	AC	47 ms 36,900 KB
testcase_19	AC	46 ms 36,748 KB
testcase_20	AC	52 ms 36,724 KB
testcase_21	AC	51 ms 36,868 KB
testcase_22	AC	52 ms 37,152 KB
testcase_23	AC	53 ms 36,860 KB
testcase_24	AC	46 ms 36,812 KB
testcase_25	AC	54 ms 36,976 KB
testcase_26	AC	55 ms 36,568 KB
testcase_27	AC	47 ms 36,692 KB
testcase_28	AC	45 ms 36,724 KB
testcase_29	AC	46 ms 36,348 KB
testcase_30	AC	45 ms 36,900 KB
testcase_31	AC	55 ms 36,832 KB
testcase_32	AC	46 ms 36,812 KB
testcase_33	AC	46 ms 36,796 KB
testcase_34	AC	46 ms 36,424 KB
testcase_35	AC	48 ms 36,648 KB
testcase_36	AC	45 ms 36,348 KB
testcase_37	AC	46 ms 36,640 KB
testcase_38	AC	48 ms 36,812 KB
testcase_39	AC	56 ms 37,472 KB
testcase_40	AC	49 ms 36,532 KB
testcase_41	AC	56 ms 37,568 KB
testcase_42	AC	58 ms 37,164 KB
testcase_43	AC	46 ms 36,632 KB
testcase_44	AC	52 ms 37,544 KB
testcase_45	AC	46 ms 36,672 KB
testcase_46	AC	47 ms 36,680 KB
testcase_47	AC	52 ms 37,344 KB
testcase_48	AC	50 ms 36,996 KB
testcase_49	AC	48 ms 36,776 KB
testcase_50	AC	48 ms 36,712 KB
testcase_51	AC	47 ms 36,728 KB
testcase_52	AC	53 ms 36,944 KB
testcase_53	AC	51 ms 36,940 KB
testcase_54	AC	47 ms 36,812 KB
testcase_55	AC	52 ms 36,876 KB
testcase_56	AC	52 ms 36,716 KB
testcase_57	AC	47 ms 36,888 KB
testcase_58	AC	46 ms 36,812 KB
testcase_59	AC	52 ms 36,948 KB
testcase_60	AC	48 ms 36,820 KB
testcase_61	AC	54 ms 36,732 KB
testcase_62	AC	46 ms 36,660 KB
testcase_63	AC	51 ms 36,576 KB
testcase_64	AC	51 ms 36,916 KB
testcase_65	AC	47 ms 36,660 KB
testcase_66	AC	54 ms 36,984 KB
testcase_67	AC	46 ms 36,724 KB
testcase_68	AC	48 ms 36,724 KB
testcase_69	AC	46 ms 36,724 KB
testcase_70	AC	47 ms 36,728 KB
testcase_71	AC	46 ms 36,728 KB
testcase_72	AC	47 ms 36,728 KB
testcase_73	AC	47 ms 36,648 KB
testcase_74	AC	46 ms 36,660 KB
testcase_75	AC	46 ms 36,448 KB
testcase_76	AC	47 ms 36,896 KB
testcase_77	AC	48 ms 36,820 KB
testcase_78	AC	48 ms 36,604 KB
testcase_79	AC	50 ms 36,684 KB
testcase_80	AC	47 ms 36,600 KB
testcase_81	AC	47 ms 36,828 KB
testcase_82	AC	47 ms 36,408 KB
testcase_83	AC	47 ms 36,528 KB
testcase_84	AC	46 ms 36,820 KB
testcase_85	AC	46 ms 36,736 KB
testcase_86	AC	47 ms 36,812 KB
testcase_87	AC	46 ms 36,748 KB
testcase_88	AC	47 ms 36,812 KB
testcase_89	AC	50 ms 36,896 KB
testcase_90	WA	-
testcase_91	AC	52 ms 36,712 KB
testcase_92	WA	-
testcase_93	AC	48 ms 36,688 KB
testcase_94	AC	47 ms 36,828 KB
testcase_95	AC	55 ms 36,968 KB
testcase_96	AC	47 ms 36,660 KB
testcase_97	OLE	-
testcase_98	AC	58 ms 36,660 KB
testcase_99	AC	47 ms 36,748 KB
testcase_100	AC	49 ms 36,848 KB

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

ソースコード

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();
		System.out.println(solve(x, y, z));
		// System.out.println(run(solve(x, y, z), x, y));

		// while (true) {
		// long x = (long) (10000 * Math.random());
		// long y = (long) (10000 * Math.random());
		// long z = (long) (10000 * Math.random());
		//
		// String s = solve(x, y, z);
		// if (!s.equals("mourennaihasimasenn")) {
		// long rz = run(s, x, y);
		//
		// if (z != rz) {
		// System.out.printf("%d %d %d %s %d\n", x, y, z, s, rz);
		// break;
		// }
		// }
		// }

	}

	private static String solve(long x, long y, long z) {
		long[] gcd = exGCD(x, y);
		if (z == 0) {
			return "ccW";
		} else if (y > 0 && z % y == 0) {
			long p = z / y;
			StringBuilder sb = new StringBuilder();
			sb.append("w");
			for (int i = 0; i < p - 1; i++) {
				sb.append("w");
				sb.append("C");
			}
			return sb.toString();
		} else if (x > 0 && z % x == 0) {
			long p = z / x;
			StringBuilder sb = new StringBuilder();
			sb.append("c");
			for (int i = 0; i < p - 1; i++) {
				sb.append("c");
				sb.append("C");
			}
			return sb.toString();
		} else if (gcd == null || z % gcd[0] != 0 || z / Math.max(x, y) >= 10000) {
			return "mourennaihasimasenn";
		} else {

			long a = 0, b = 0;
			boolean flg = false;
			for (a = -5000; a <= 5000; a++) {
				long p = z - a * x;
				if (p % y != 0)
					continue;
				b = p / y;
				long size = 2 * (Math.abs(a) + Math.abs(b)) - 1;
				if (size <= 10000) {
					flg = true;
					break;
				}
			}
			if (!flg) {
				return "mourennaihasimasenn";
			}

			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) {
					for (int i = 0; i < -b; i++) {
						queue.addFirst('w');
					}
					for (int i = 0; i < -b; i++) {
						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) {
					for (int i = 0; i < -a; i++) {
						queue.addFirst('c');
					}
					for (int i = 0; i < -a; i++) {
						queue.add('W');
					}
				}
			}

			StringBuilder sb = new StringBuilder();
			for (char c : queue) {
				sb.append(c);
			}
			return sb.toString();
		}
	}

	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 long 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];
			}
		}
		return 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

結果

テストケース

ソースコード