結果

問題 No.675 ドットちゃんたち
コンテスト
ユーザー 37zigen
提出日時 2018-04-15 22:43:05
言語 Java
(openjdk 23)
結果
AC  
実行時間 489 ms / 2,000 ms
コード長 3,481 bytes
コンパイル時間 2,877 ms
コンパイル使用メモリ 80,048 KB
実行使用メモリ 67,956 KB
最終ジャッジ日時 2024-06-27 00:10:16
合計ジャッジ時間 8,232 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 8
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.NoSuchElementException;

public class Main {
	public static void main(String[] args) throws FileNotFoundException {
		long t = System.currentTimeMillis();
		new Main().run();
		System.err.println(System.currentTimeMillis() - t);
	}

	long[][] mul(long[][] a, long[][] b) {
		long[][] ret = new long[a.length][b[0].length];
		for (int i = 0; i < a.length; ++i) {
			for (int j = 0; j < b[i].length; ++j) {
				for (int k = 0; k < a[i].length; ++k) {
					ret[i][j] += a[i][k] * b[k][j];
				}
			}
		}
		return ret;
	}

	public void run() {
		Scanner sc = new Scanner();
		int n = sc.nextInt();
		long px = sc.nextLong();
		long py = sc.nextLong();
		long[][] cmd = new long[n][2];
		for (int i = 0; i < n; ++i) {
			cmd[i][0] = sc.nextInt();
			if (cmd[i][0] != 3) {
				cmd[i][1] = sc.nextLong();
			}
		}
		long[][] ans = new long[n][2];
		long[][] mat = new long[][] { { 1, 0, 0 }, { 0, 1, 0 }, { 0, 0, 1 } };
		long[][] x = new long[3][3];
		long[][] v = new long[][] { { px }, { py }, { 1 } };
		for (int i = n - 1; i >= 0; --i) {
			if (cmd[i][0] == 3) {
				x = new long[][] { { 0, 1, 0 }, { -1, 0, 0 }, { 0, 0, 1 } };
			} else if (cmd[i][0] == 2) {
				x = new long[][] { { 1, 0, 0 }, { 0, 1, cmd[i][1] }, { 0, 0, 1 } };
			} else {
				x = new long[][] { { 1, 0, cmd[i][1] }, { 0, 1, 0 }, { 0, 0, 1 } };
			}
			mat = mul(mat, x);
			ans[i] = new long[] { mul(mat, v)[0][0], mul(mat, v)[1][0] };
		}
		PrintWriter pw = new PrintWriter(System.out);
		for (int i = 0; i < n; ++i) {
			pw.println(ans[i][0] + " " + ans[i][1]);
		}
		pw.close();
	}

	class Scanner {
		private final InputStream in = System.in;
		private final byte[] buffer = new byte[1024];
		private int ptr = 0;
		private int buflen = 0;

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

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

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

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

		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();
		}
	}

	static void tr(Object... objects) {
		System.out.println(Arrays.deepToString(objects));
	}

}
0