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

提出ソース

結果

問題	No.471 直列回転機
ユーザー	ぴろず
提出日時	2016-12-21 01:48:08
言語	Java21 (openjdk 21)
結果	WA
実行時間	-
コード長	4,788 bytes
コンパイル時間	4,033 ms
コンパイル使用メモリ	79,308 KB
実行使用メモリ	83,160 KB
平均クエリ数	19588.39
最終ジャッジ日時	2023-09-23 12:04:56
合計ジャッジ時間	47,431 ms
ジャッジサーバーID （参考情報）	judge13 / judge12

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	120 ms 68,868 KB
testcase_01	AC	103 ms 68,480 KB
testcase_02	AC	105 ms 68,992 KB
testcase_03	AC	105 ms 68,600 KB
testcase_04	AC	103 ms 68,576 KB
testcase_05	AC	147 ms 68,244 KB
testcase_06	AC	121 ms 68,536 KB
testcase_07	AC	152 ms 69,276 KB
testcase_08	AC	413 ms 69,524 KB
testcase_09	AC	431 ms 70,804 KB
testcase_10	AC	294 ms 70,408 KB
testcase_11	AC	813 ms 77,024 KB
testcase_12	AC	1,163 ms 78,160 KB
testcase_13	AC	1,171 ms 80,636 KB
testcase_14	AC	1,240 ms 79,032 KB
testcase_15	WA	-
testcase_16	AC	131 ms 68,060 KB
testcase_17	AC	103 ms 66,356 KB
testcase_18	AC	105 ms 68,468 KB
testcase_19	AC	104 ms 69,044 KB
testcase_20	AC	1,274 ms 80,492 KB
testcase_21	AC	481 ms 69,300 KB
testcase_22	AC	1,190 ms 78,836 KB
testcase_23	AC	1,138 ms 83,160 KB
testcase_24	AC	885 ms 77,712 KB
testcase_25	AC	419 ms 70,240 KB
testcase_26	AC	1,277 ms 80,596 KB
testcase_27	AC	839 ms 77,920 KB
testcase_28	AC	938 ms 75,436 KB
testcase_29	AC	1,016 ms 78,408 KB
testcase_30	AC	568 ms 74,084 KB
testcase_31	AC	1,140 ms 75,176 KB
testcase_32	AC	1,212 ms 80,472 KB
testcase_33	AC	1,045 ms 80,660 KB
testcase_34	AC	1,207 ms 82,700 KB
testcase_35	AC	507 ms 72,916 KB
testcase_36	AC	737 ms 74,840 KB
testcase_37	AC	361 ms 70,476 KB
testcase_38	AC	467 ms 70,524 KB
testcase_39	AC	668 ms 76,632 KB
testcase_40	AC	1,008 ms 75,016 KB
testcase_41	AC	1,222 ms 79,504 KB
testcase_42	AC	1,065 ms 77,876 KB
testcase_43	AC	1,240 ms 80,640 KB
testcase_44	AC	280 ms 70,700 KB
testcase_45	AC	1,021 ms 78,380 KB
testcase_46	AC	1,077 ms 77,932 KB
testcase_47	AC	1,182 ms 80,232 KB
testcase_48	AC	1,124 ms 81,188 KB
testcase_49	AC	1,028 ms 76,700 KB
testcase_50	AC	1,167 ms 80,460 KB
testcase_51	AC	748 ms 76,988 KB
testcase_52	AC	157 ms 70,128 KB
testcase_53	AC	141 ms 68,984 KB
testcase_54	AC	168 ms 70,028 KB
testcase_55	AC	523 ms 74,032 KB
testcase_56	AC	462 ms 68,748 KB
testcase_57	AC	342 ms 70,536 KB
testcase_58	AC	293 ms 69,780 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());
		}
		System.out.println("? 0 0");
		Point p1 = new Point(io.nextInt(),io.nextInt());
		System.out.println("? 1 0");
		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;
			}
		}
		if (at == null) {
			throw new RuntimeException();
		}
		Point2D[] ans = new Point2D[n];
		at.transform(p, 0, ans, 0, n);
		System.out.println("!");
		for(int i=0;i<n;i++) {
			System.out.println(round(ans[i].getX()) + " " + round(ans[i].getY()));
		}
	}
	
	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

結果

テストケース

ソースコード