結果
問題 | No.471 直列回転機 |
ユーザー | ぴろず |
提出日時 | 2016-12-21 01:44:24 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,731 bytes |
コンパイル時間 | 4,066 ms |
コンパイル使用メモリ | 79,960 KB |
実行使用メモリ | 82,936 KB |
平均クエリ数 | 19588.39 |
最終ジャッジ日時 | 2023-09-23 12:06:09 |
合計ジャッジ時間 | 46,456 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 105 ms
68,332 KB |
testcase_01 | AC | 105 ms
68,548 KB |
testcase_02 | AC | 100 ms
69,336 KB |
testcase_03 | AC | 102 ms
69,020 KB |
testcase_04 | AC | 103 ms
68,676 KB |
testcase_05 | AC | 155 ms
68,572 KB |
testcase_06 | AC | 119 ms
68,912 KB |
testcase_07 | AC | 138 ms
68,584 KB |
testcase_08 | AC | 406 ms
70,732 KB |
testcase_09 | AC | 400 ms
68,512 KB |
testcase_10 | AC | 291 ms
70,432 KB |
testcase_11 | AC | 743 ms
75,792 KB |
testcase_12 | AC | 1,122 ms
79,828 KB |
testcase_13 | AC | 1,156 ms
81,376 KB |
testcase_14 | AC | 1,221 ms
80,336 KB |
testcase_15 | WA | - |
testcase_16 | AC | 127 ms
69,120 KB |
testcase_17 | AC | 100 ms
66,496 KB |
testcase_18 | AC | 105 ms
68,296 KB |
testcase_19 | AC | 102 ms
68,724 KB |
testcase_20 | AC | 1,190 ms
80,096 KB |
testcase_21 | AC | 473 ms
71,272 KB |
testcase_22 | AC | 1,109 ms
77,208 KB |
testcase_23 | AC | 1,124 ms
82,936 KB |
testcase_24 | AC | 839 ms
77,872 KB |
testcase_25 | AC | 409 ms
70,496 KB |
testcase_26 | AC | 1,107 ms
77,804 KB |
testcase_27 | AC | 772 ms
74,572 KB |
testcase_28 | AC | 977 ms
78,240 KB |
testcase_29 | AC | 965 ms
78,568 KB |
testcase_30 | AC | 542 ms
73,484 KB |
testcase_31 | AC | 1,126 ms
79,840 KB |
testcase_32 | AC | 1,161 ms
80,964 KB |
testcase_33 | AC | 981 ms
75,040 KB |
testcase_34 | AC | 1,202 ms
81,968 KB |
testcase_35 | AC | 502 ms
74,000 KB |
testcase_36 | AC | 788 ms
79,464 KB |
testcase_37 | AC | 350 ms
70,752 KB |
testcase_38 | AC | 470 ms
71,100 KB |
testcase_39 | AC | 644 ms
75,384 KB |
testcase_40 | AC | 1,056 ms
78,748 KB |
testcase_41 | AC | 1,211 ms
80,156 KB |
testcase_42 | AC | 1,001 ms
78,176 KB |
testcase_43 | AC | 1,196 ms
80,272 KB |
testcase_44 | AC | 278 ms
71,008 KB |
testcase_45 | AC | 1,006 ms
78,980 KB |
testcase_46 | AC | 1,037 ms
76,264 KB |
testcase_47 | AC | 1,101 ms
80,184 KB |
testcase_48 | AC | 1,080 ms
79,772 KB |
testcase_49 | AC | 1,059 ms
81,016 KB |
testcase_50 | AC | 1,188 ms
80,788 KB |
testcase_51 | AC | 748 ms
77,148 KB |
testcase_52 | AC | 148 ms
70,044 KB |
testcase_53 | AC | 146 ms
69,068 KB |
testcase_54 | AC | 171 ms
69,880 KB |
testcase_55 | AC | 497 ms
73,504 KB |
testcase_56 | AC | 440 ms
70,284 KB |
testcase_57 | AC | 335 ms
71,004 KB |
testcase_58 | AC | 272 ms
70,144 KB |
ソースコード
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; } } 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) {}} }