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

提出ソース

結果

問題	No.471 直列回転機
ユーザー	ぴろず
提出日時	2016-12-21 01:49:12
言語	Java21 (openjdk 21)
結果	WA
実行時間	-
コード長	4,741 bytes
コンパイル時間	2,403 ms
コンパイル使用メモリ	78,940 KB
実行使用メモリ	76,192 KB
平均クエリ数	19588.39
最終ジャッジ日時	2023-09-23 12:06:33
合計ジャッジ時間	22,797 ms
ジャッジサーバーID （参考情報）	judge11 / judge14

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	104 ms 69,108 KB
testcase_01	AC	99 ms 68,948 KB
testcase_02	AC	97 ms 68,888 KB
testcase_03	AC	107 ms 69,072 KB
testcase_04	AC	98 ms 68,640 KB
testcase_05	AC	123 ms 68,308 KB
testcase_06	AC	104 ms 68,456 KB
testcase_07	AC	120 ms 68,468 KB
testcase_08	AC	196 ms 70,340 KB
testcase_09	AC	191 ms 70,356 KB
testcase_10	AC	180 ms 69,760 KB
testcase_11	AC	283 ms 73,016 KB
testcase_12	AC	446 ms 75,340 KB
testcase_13	AC	469 ms 73,480 KB
testcase_14	AC	498 ms 75,048 KB
testcase_15	WA	-
testcase_16	AC	114 ms 68,256 KB
testcase_17	AC	95 ms 68,924 KB
testcase_18	AC	98 ms 66,732 KB
testcase_19	AC	110 ms 68,040 KB
testcase_20	AC	494 ms 75,460 KB
testcase_21	AC	230 ms 70,556 KB
testcase_22	AC	444 ms 74,924 KB
testcase_23	AC	422 ms 75,084 KB
testcase_24	AC	313 ms 72,452 KB
testcase_25	AC	223 ms 70,192 KB
testcase_26	AC	497 ms 75,532 KB
testcase_27	AC	307 ms 72,336 KB
testcase_28	AC	344 ms 72,932 KB
testcase_29	AC	366 ms 73,320 KB
testcase_30	AC	250 ms 70,340 KB
testcase_31	AC	500 ms 74,856 KB
testcase_32	AC	432 ms 73,972 KB
testcase_33	AC	366 ms 73,080 KB
testcase_34	AC	486 ms 75,560 KB
testcase_35	AC	225 ms 70,244 KB
testcase_36	AC	270 ms 73,252 KB
testcase_37	AC	195 ms 70,372 KB
testcase_38	AC	219 ms 69,960 KB
testcase_39	AC	273 ms 71,604 KB
testcase_40	AC	400 ms 73,188 KB
testcase_41	AC	516 ms 75,368 KB
testcase_42	AC	368 ms 71,504 KB
testcase_43	AC	464 ms 75,268 KB
testcase_44	AC	184 ms 70,428 KB
testcase_45	AC	361 ms 72,844 KB
testcase_46	AC	403 ms 73,032 KB
testcase_47	AC	483 ms 75,332 KB
testcase_48	AC	432 ms 76,192 KB
testcase_49	AC	409 ms 75,308 KB
testcase_50	AC	476 ms 75,116 KB
testcase_51	AC	265 ms 72,172 KB
testcase_52	AC	121 ms 70,096 KB
testcase_53	AC	119 ms 69,020 KB
testcase_54	AC	125 ms 69,680 KB
testcase_55	AC	247 ms 69,608 KB
testcase_56	AC	231 ms 70,296 KB
testcase_57	AC	206 ms 69,776 KB
testcase_58	AC	182 ms 70,548 KB

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

ソースコード

raw source code

package no471;

import java.awt.Point;
import java.awt.geom.AffineTransform;
import java.awt.geom.Point2D;
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();
		Point[] p = new Point[n];
		for(int i=0;i<n;i++) {
			p[i] = new Point(io.nextInt(),io.nextInt());
		}
		io.println("? 0 0");
		io.flush();
		Point p1 = new Point(io.nextInt(),io.nextInt());
		io.println("? 1 0");
		io.flush();
		Point p2 = new Point(1,0);
		Point p3 = new Point(io.nextInt(), io.nextInt());
		
		AffineTransform t = AffineTransform.getTranslateInstance(p1.x, p1.y);
		AffineTransform at = null;
		for(int i=0;i<4;i++) {
			at = AffineTransform.getQuadrantRotateInstance(i);
			at.preConcatenate(t);
			Point2D p4 = at.transform(p2, null);
			if (p3.equals(p4)) {
				break;
			}
		}
		Point2D[] ans = new Point2D[n];
		at.transform(p, 0, ans, 0, n);
		io.println("!");
		for(int i=0;i<n;i++) {
			io.println(round(ans[i].getX()) + " " + round(ans[i].getY()));
		}
		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

結果

テストケース

ソースコード