#140260 (Java21) No.471 直列回転機

提出ソース

結果

問題	No.471 直列回転機
ユーザー	ぴろず
提出日時	2016-12-21 01:56:27
言語	Java21 (openjdk 21)
結果	AC
実行時間	506 ms / 3,141 ms
コード長	4,622 bytes
コンパイル時間	3,777 ms
コンパイル使用メモリ	80,092 KB
実行使用メモリ	62,312 KB
平均クエリ数	19588.39
最終ジャッジ日時	2024-06-11 10:24:42
合計ジャッジ時間	21,678 ms
ジャッジサーバーID （参考情報）	judge2 / judge5

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	96 ms 56,356 KB
testcase_01	AC	92 ms 56,112 KB
testcase_02	AC	102 ms 56,460 KB
testcase_03	AC	91 ms 56,176 KB
testcase_04	AC	100 ms 56,532 KB
testcase_05	AC	103 ms 56,108 KB
testcase_06	AC	101 ms 56,444 KB
testcase_07	AC	111 ms 56,568 KB
testcase_08	AC	178 ms 56,952 KB
testcase_09	AC	190 ms 58,536 KB
testcase_10	AC	142 ms 56,980 KB
testcase_11	AC	260 ms 58,668 KB
testcase_12	AC	417 ms 60,008 KB
testcase_13	AC	421 ms 59,984 KB
testcase_14	AC	451 ms 60,728 KB
testcase_15	AC	506 ms 62,312 KB
testcase_16	AC	119 ms 56,440 KB
testcase_17	AC	90 ms 56,188 KB
testcase_18	AC	101 ms 56,260 KB
testcase_19	AC	91 ms 55,680 KB
testcase_20	AC	481 ms 60,844 KB
testcase_21	AC	216 ms 58,788 KB
testcase_22	AC	434 ms 59,788 KB
testcase_23	AC	409 ms 60,276 KB
testcase_24	AC	282 ms 59,636 KB
testcase_25	AC	205 ms 58,752 KB
testcase_26	AC	456 ms 60,836 KB
testcase_27	AC	274 ms 58,492 KB
testcase_28	AC	302 ms 59,220 KB
testcase_29	AC	328 ms 59,432 KB
testcase_30	AC	231 ms 59,376 KB
testcase_31	AC	458 ms 60,572 KB
testcase_32	AC	396 ms 60,176 KB
testcase_33	AC	338 ms 59,492 KB
testcase_34	AC	448 ms 60,912 KB
testcase_35	AC	220 ms 59,008 KB
testcase_36	AC	255 ms 58,776 KB
testcase_37	AC	175 ms 57,776 KB
testcase_38	AC	208 ms 58,800 KB
testcase_39	AC	246 ms 58,996 KB
testcase_40	AC	352 ms 59,840 KB
testcase_41	AC	481 ms 60,824 KB
testcase_42	AC	323 ms 59,384 KB
testcase_43	AC	425 ms 60,500 KB
testcase_44	AC	161 ms 57,272 KB
testcase_45	AC	316 ms 59,120 KB
testcase_46	AC	373 ms 59,936 KB
testcase_47	AC	439 ms 60,488 KB
testcase_48	AC	399 ms 59,800 KB
testcase_49	AC	389 ms 59,980 KB
testcase_50	AC	457 ms 60,792 KB
testcase_51	AC	246 ms 58,916 KB
testcase_52	AC	114 ms 56,500 KB
testcase_53	AC	104 ms 56,548 KB
testcase_54	AC	117 ms 56,312 KB
testcase_55	AC	212 ms 59,236 KB
testcase_56	AC	213 ms 58,620 KB
testcase_57	AC	195 ms 57,060 KB
testcase_58	AC	169 ms 57,688 KB

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

ソースコード

raw source code

package no471;

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;

public class Main {

	public static void main(String[] args) {
		IO io = new IO();
		int n = io.nextInt();
		int[] x = new int[n];
		int[] y = new int[n];
		io.nextIntArrays(x,y);
		io.println("? 0 0");
		io.flush();
		int translateX = io.nextInt();
		int translateY = io.nextInt();
		io.println("? 1 0");
		io.flush();
		int x1 = io.nextInt();
		int y1 = io.nextInt();
		
		int dx = 1;
		int dy = 0;
		int rotation = 0;
		for(int i=0;i<4;i++) {
			if (x1 == dx + translateX && y1 == dy + translateY) {
				rotation = i;
				break;
			}
			int dx2 = -dy;
			int dy2 = dx;
			dx = dx2;
			dy = dy2;
			
		}
		
		
		io.println("!");
		for(int i=0;i<n;i++) {
			dx = x[i];
			dy = y[i];
			for(int j=0;j<rotation;j++) {
				int dx2 = -dy;
				int dy2 = dx;
				dx = dx2;
				dy = dy2;
			}
			dx += translateX;
			dy += translateY;
			io.println(dx + " " + dy);
		}
		io.flush();
	}
	
	public static int round(double x) {
		return (int) Math.round(x);
	}

}
class IO extends PrintWriter {
	private final InputStream in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;
	
	public IO() { this(System.in);}
	public IO(InputStream source) { super(System.out); this.in = source;}
	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 static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
	private static boolean isNewLine(int c) { return c == '\n' || c == '\r';}
	public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
	public boolean hasNextLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++; 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 char[] nextCharArray(int len) {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		char[] s = new char[len];
		int i = 0;
		int b = readByte();
		while(isPrintableChar(b)) {
			if (i == len) {
				throw new InputMismatchException();
			}
			s[i++] = (char) b;
			b = readByte();
		}
		return s;
	}
	public String nextLine() {
		if (!hasNextLine()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(!isNewLine(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() {
		long nl = nextLong();
		if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {
			throw new NumberFormatException();
		}
		return (int) nl;
	}
	public char nextChar() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		return (char) readByte();
	}
	public double nextDouble() { return Double.parseDouble(next());}
	public int[] nextIntArray(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;}
	public long[] nextLongArray(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;}
	public double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}
	public void nextIntArrays(int[]... a) { for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();}
	public int[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;}
	public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}
	public void close() { super.close(); try {in.close();} catch (IOException e) {}}
}

yukicoder

結果

テストケース

ソースコード