結果

問題 No.438 Cwwプログラミング入門
ユーザー Grenache
提出日時 2016-11-01 20:20:47
言語 Java
(openjdk 23)
結果
AC  
実行時間 63 ms / 2,000 ms
コード長 5,766 bytes
コンパイル時間 4,384 ms
コンパイル使用メモリ 81,824 KB
実行使用メモリ 37,644 KB
最終ジャッジ日時 2024-11-27 22:20:14
合計ジャッジ時間 12,686 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 98
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;


public class Main_yukicoder438 {

	private static Scanner sc;
	private static Printer pr;

	private static void solve() {
		long x = sc.nextInt();
		long y = sc.nextInt();
		long z = sc.nextInt();

		if (z == 0) {
			pr.println("ccW");
			return;
		}

		long[] ab = new long[2];
		long gcd = extgcd(x, y, ab);
		if ((x == 0 && y == 0) || z % gcd != 0) {
			pr.println("mourennaihasimasenn");
			return;
		}

		long mul = z / gcd;
		ab[0] *= mul;
		ab[1] *= mul;
		x /= gcd;
		y /= gcd;

        // 整数の三分探索
        long l = -1_000_000_000;
        long r = 1_000_000_000;
		while (r - l > 1) {
			long mid = l + (r - l) / 2;
			long f1 = Math.abs(y * (mid + 1) + ab[0]) + Math.abs(- x * (mid + 1) + ab[1]);
			long f2 = Math.abs(y * (mid) + ab[0]) + Math.abs(- x * (mid) + ab[1]);
			if (f1 - f2 >= 0) {
				r = mid;
			} else {
				l = mid;
			}
		}

		ab[0] = y * r + ab[0];
		ab[1] = -x * r + ab[1];
		if (Math.abs(ab[0]) + Math.abs(ab[1]) > 5000) {
			pr.println("mourennaihasimasenn");
			return;
		}

		StringBuilder ret = new StringBuilder();
		if (ab[0] < 0) {
			append(ret, 'c', -ab[0]);
			append(ret, 'w', ab[1]);
			append(ret, 'C', ab[1] - 1);
			append(ret, 'W', -ab[0]);
		} else if (ab[1] < 0) {
			append(ret, 'w', -ab[1]);
			append(ret, 'c', ab[0]);
			append(ret, 'C', ab[0] - 1);
			append(ret, 'W', -ab[1]);
		} else {
			append(ret, 'c', ab[0]);
			append(ret, 'w', ab[1]);
			append(ret, 'C', ab[0] + ab[1] - 1);
		}

		if (ret.length() > 10000) {
			pr.println("mourennaihasimasenn");
		} else {
			pr.println(ret);
		}
	}

	private static void append(StringBuilder ret, char c, long n) {
		String s = Character.toString(c);

		while (n > 0) {
			if (n % 2 == 1) {
				ret.append(s);
			}
			n /= 2;
			s = s + s;
		}

		return;
	}

	private static long extgcd(long n, long m, long[] xy) {
		if (m == 0) {
			xy[0] = 1;
			xy[1] = 0;

			return n;
		} else {
			long ret = extgcd(m, n % m, xy);

			long tmp = xy[1];
			xy[1] = xy[0] - n / m * tmp;
			xy[0] = tmp;

			return ret;
		}
	}

	// ---------------------------------------------------
	public static void main(String[] args) {
		sc = new Scanner(System.in);
		pr = new Printer(System.out);

		solve();

		pr.close();
		sc.close();
	}

	@SuppressWarnings("unused")
	private static class Scanner {
		BufferedReader br;

		Scanner (InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
		}

		private boolean isPrintable(int ch) {
			return ch >= '!' && ch <= '~';
		}

		private boolean isCRLF(int ch) {
			return ch == '\n' || ch == '\r' || ch == -1;
		}

		private int nextPrintable() {
			try {
				int ch;
				while (!isPrintable(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}

				return ch;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		String next() {
			try {
				int ch = nextPrintable();
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (isPrintable(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		int nextInt() {
			try {
				// parseInt from Integer.parseInt()
				boolean negative = false;
				int res = 0;
				int limit = -Integer.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Integer.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				int multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		long nextLong() {
			try {
				// parseLong from Long.parseLong()
				boolean negative = false;
				long res = 0;
				long limit = -Long.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Long.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				long multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		float nextFloat() {
			return Float.parseFloat(next());
		}

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

		String nextLine() {
			try {
				int ch;
				while (isCRLF(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (!isCRLF(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		void close() {
			try {
				br.close();
			} catch (IOException e) {
//				throw new NoSuchElementException();
			}
		}
	}

	private static class Printer extends PrintWriter {
		Printer(PrintStream out) {
			super(out);
		}
	}
}
0