結果
問題 | No.471 直列回転機 |
ユーザー | ぴろず |
提出日時 | 2016-12-21 01:56:27 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 601 ms / 3,141 ms |
コード長 | 4,622 bytes |
コンパイル時間 | 3,643 ms |
コンパイル使用メモリ | 86,144 KB |
実行使用メモリ | 73,060 KB |
平均クエリ数 | 19588.39 |
最終ジャッジ日時 | 2023-09-02 03:43:26 |
合計ジャッジ時間 | 25,161 ms |
ジャッジサーバーID (参考情報) |
judge16 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 105 ms
67,804 KB |
testcase_01 | AC | 100 ms
68,380 KB |
testcase_02 | AC | 99 ms
68,060 KB |
testcase_03 | AC | 99 ms
66,132 KB |
testcase_04 | AC | 101 ms
67,940 KB |
testcase_05 | AC | 113 ms
67,916 KB |
testcase_06 | AC | 105 ms
68,332 KB |
testcase_07 | AC | 111 ms
68,496 KB |
testcase_08 | AC | 192 ms
69,924 KB |
testcase_09 | AC | 194 ms
69,140 KB |
testcase_10 | AC | 178 ms
69,632 KB |
testcase_11 | AC | 279 ms
69,328 KB |
testcase_12 | AC | 475 ms
72,388 KB |
testcase_13 | AC | 480 ms
70,536 KB |
testcase_14 | AC | 498 ms
70,696 KB |
testcase_15 | AC | 601 ms
71,552 KB |
testcase_16 | AC | 119 ms
66,448 KB |
testcase_17 | AC | 99 ms
68,348 KB |
testcase_18 | AC | 100 ms
69,232 KB |
testcase_19 | AC | 101 ms
66,504 KB |
testcase_20 | AC | 533 ms
72,552 KB |
testcase_21 | AC | 228 ms
69,932 KB |
testcase_22 | AC | 475 ms
70,312 KB |
testcase_23 | AC | 475 ms
70,640 KB |
testcase_24 | AC | 313 ms
69,628 KB |
testcase_25 | AC | 224 ms
71,416 KB |
testcase_26 | AC | 515 ms
72,836 KB |
testcase_27 | AC | 302 ms
69,756 KB |
testcase_28 | AC | 348 ms
70,636 KB |
testcase_29 | AC | 382 ms
72,876 KB |
testcase_30 | AC | 251 ms
67,484 KB |
testcase_31 | AC | 517 ms
72,184 KB |
testcase_32 | AC | 465 ms
70,216 KB |
testcase_33 | AC | 379 ms
72,932 KB |
testcase_34 | AC | 502 ms
72,376 KB |
testcase_35 | AC | 237 ms
69,820 KB |
testcase_36 | AC | 276 ms
69,752 KB |
testcase_37 | AC | 200 ms
69,476 KB |
testcase_38 | AC | 224 ms
69,500 KB |
testcase_39 | AC | 263 ms
69,536 KB |
testcase_40 | AC | 389 ms
72,316 KB |
testcase_41 | AC | 537 ms
72,868 KB |
testcase_42 | AC | 367 ms
72,852 KB |
testcase_43 | AC | 489 ms
73,060 KB |
testcase_44 | AC | 190 ms
70,368 KB |
testcase_45 | AC | 360 ms
69,960 KB |
testcase_46 | AC | 401 ms
71,948 KB |
testcase_47 | AC | 487 ms
72,520 KB |
testcase_48 | AC | 450 ms
70,156 KB |
testcase_49 | AC | 429 ms
72,240 KB |
testcase_50 | AC | 493 ms
72,248 KB |
testcase_51 | AC | 271 ms
69,996 KB |
testcase_52 | AC | 126 ms
69,024 KB |
testcase_53 | AC | 113 ms
68,472 KB |
testcase_54 | AC | 129 ms
69,416 KB |
testcase_55 | AC | 233 ms
69,312 KB |
testcase_56 | AC | 223 ms
69,448 KB |
testcase_57 | AC | 211 ms
69,980 KB |
testcase_58 | AC | 187 ms
69,704 KB |
ソースコード
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) {}} }