結果
| 問題 | No.1306 Exactly 2 Digits |
| ユーザー |
 uwi
|
| 提出日時 | 2020-12-03 00:37:29 |
| 言語 | Java21 (openjdk 21) |
| 結果 |
AC
|
| 実行時間 | 463 ms / 2,000 ms |
| コード長 | 12,584 bytes |
| コンパイル時間 | 6,134 ms |
| コンパイル使用メモリ | 93,452 KB |
| 実行使用メモリ | 78,364 KB |
| 平均クエリ数 | 1236.78 |
| 最終ジャッジ日時 | 2024-07-17 07:40:58 |
| 合計ジャッジ時間 | 43,577 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge5 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 129 ms
69,288 KB |
| testcase_01 | AC | 129 ms
69,804 KB |
| testcase_02 | AC | 127 ms
69,312 KB |
| testcase_03 | AC | 130 ms
69,316 KB |
| testcase_04 | AC | 128 ms
69,336 KB |
| testcase_05 | AC | 127 ms
69,964 KB |
| testcase_06 | AC | 129 ms
70,236 KB |
| testcase_07 | AC | 128 ms
69,528 KB |
| testcase_08 | AC | 127 ms
69,460 KB |
| testcase_09 | AC | 126 ms
69,276 KB |
| testcase_10 | AC | 126 ms
69,320 KB |
| testcase_11 | AC | 127 ms
69,300 KB |
| testcase_12 | AC | 126 ms
69,296 KB |
| testcase_13 | AC | 130 ms
69,796 KB |
| testcase_14 | AC | 129 ms
69,788 KB |
| testcase_15 | AC | 128 ms
69,676 KB |
| testcase_16 | AC | 131 ms
69,704 KB |
| testcase_17 | AC | 127 ms
69,212 KB |
| testcase_18 | AC | 126 ms
69,656 KB |
| testcase_19 | AC | 128 ms
69,260 KB |
| testcase_20 | AC | 130 ms
69,308 KB |
| testcase_21 | AC | 126 ms
69,468 KB |
| testcase_22 | AC | 128 ms
69,308 KB |
| testcase_23 | AC | 129 ms
69,372 KB |
| testcase_24 | AC | 130 ms
69,976 KB |
| testcase_25 | AC | 131 ms
69,560 KB |
| testcase_26 | AC | 128 ms
69,088 KB |
| testcase_27 | AC | 129 ms
69,828 KB |
| testcase_28 | AC | 128 ms
69,244 KB |
| testcase_29 | AC | 129 ms
69,596 KB |
| testcase_30 | AC | 132 ms
69,024 KB |
| testcase_31 | AC | 130 ms
69,772 KB |
| testcase_32 | AC | 133 ms
69,724 KB |
| testcase_33 | AC | 133 ms
69,668 KB |
| testcase_34 | AC | 130 ms
69,468 KB |
| testcase_35 | AC | 129 ms
69,520 KB |
| testcase_36 | AC | 133 ms
69,744 KB |
| testcase_37 | AC | 130 ms
69,372 KB |
| testcase_38 | AC | 131 ms
69,596 KB |
| testcase_39 | AC | 130 ms
69,172 KB |
| testcase_40 | AC | 129 ms
69,568 KB |
| testcase_41 | AC | 132 ms
69,860 KB |
| testcase_42 | AC | 130 ms
69,500 KB |
| testcase_43 | AC | 133 ms
69,540 KB |
| testcase_44 | AC | 137 ms
69,716 KB |
| testcase_45 | AC | 136 ms
69,412 KB |
| testcase_46 | AC | 142 ms
69,712 KB |
| testcase_47 | AC | 147 ms
70,140 KB |
| testcase_48 | AC | 155 ms
70,084 KB |
| testcase_49 | AC | 162 ms
70,156 KB |
| testcase_50 | AC | 158 ms
69,940 KB |
| testcase_51 | AC | 164 ms
70,312 KB |
| testcase_52 | AC | 169 ms
70,228 KB |
| testcase_53 | AC | 175 ms
70,336 KB |
| testcase_54 | AC | 166 ms
69,872 KB |
| testcase_55 | AC | 178 ms
69,800 KB |
| testcase_56 | AC | 198 ms
71,504 KB |
| testcase_57 | AC | 193 ms
71,212 KB |
| testcase_58 | AC | 199 ms
71,208 KB |
| testcase_59 | AC | 201 ms
71,560 KB |
| testcase_60 | AC | 214 ms
71,296 KB |
| testcase_61 | AC | 225 ms
70,844 KB |
| testcase_62 | AC | 222 ms
70,940 KB |
| testcase_63 | AC | 237 ms
71,176 KB |
| testcase_64 | AC | 236 ms
71,668 KB |
| testcase_65 | AC | 237 ms
71,824 KB |
| testcase_66 | AC | 239 ms
71,296 KB |
| testcase_67 | AC | 268 ms
72,264 KB |
| testcase_68 | AC | 269 ms
72,012 KB |
| testcase_69 | AC | 259 ms
71,424 KB |
| testcase_70 | AC | 258 ms
71,784 KB |
| testcase_71 | AC | 288 ms
72,200 KB |
| testcase_72 | AC | 289 ms
72,024 KB |
| testcase_73 | AC | 294 ms
72,204 KB |
| testcase_74 | AC | 308 ms
73,940 KB |
| testcase_75 | AC | 311 ms
73,780 KB |
| testcase_76 | AC | 322 ms
74,124 KB |
| testcase_77 | AC | 335 ms
74,192 KB |
| testcase_78 | AC | 350 ms
73,856 KB |
| testcase_79 | AC | 367 ms
74,748 KB |
| testcase_80 | AC | 370 ms
75,788 KB |
| testcase_81 | AC | 350 ms
74,608 KB |
| testcase_82 | AC | 386 ms
75,924 KB |
| testcase_83 | AC | 402 ms
74,792 KB |
| testcase_84 | AC | 420 ms
75,540 KB |
| testcase_85 | AC | 443 ms
76,596 KB |
| testcase_86 | AC | 390 ms
75,616 KB |
| testcase_87 | AC | 408 ms
75,768 KB |
| testcase_88 | AC | 463 ms
76,572 KB |
| testcase_89 | AC | 398 ms
76,456 KB |
| testcase_90 | AC | 403 ms
75,756 KB |
| testcase_91 | AC | 390 ms
75,716 KB |
| testcase_92 | AC | 383 ms
75,676 KB |
| testcase_93 | AC | 419 ms
75,808 KB |
| testcase_94 | AC | 376 ms
75,496 KB |
| testcase_95 | AC | 400 ms
76,312 KB |
| testcase_96 | AC | 372 ms
75,384 KB |
| testcase_97 | AC | 379 ms
75,844 KB |
| testcase_98 | AC | 369 ms
75,432 KB |
| testcase_99 | AC | 394 ms
75,776 KB |
| testcase_100 | AC | 394 ms
75,712 KB |
| testcase_101 | AC | 410 ms
78,364 KB |
| testcase_102 | AC | 376 ms
75,308 KB |
| testcase_103 | AC | 391 ms
75,560 KB |
| testcase_104 | AC | 393 ms
75,496 KB |
| testcase_105 | AC | 411 ms
76,492 KB |
| testcase_106 | AC | 370 ms
75,224 KB |
| testcase_107 | AC | 410 ms
75,684 KB |
| testcase_108 | AC | 396 ms
75,836 KB |
| testcase_109 | AC | 438 ms
76,136 KB |
| testcase_110 | AC | 371 ms
75,288 KB |
| testcase_111 | AC | 404 ms
76,004 KB |
| testcase_112 | AC | 364 ms
74,708 KB |
| testcase_113 | AC | 442 ms
75,644 KB |
| testcase_114 | AC | 425 ms
74,952 KB |
| testcase_115 | AC | 404 ms
75,656 KB |
| testcase_116 | AC | 455 ms
76,532 KB |
| testcase_117 | AC | 416 ms
75,888 KB |
| testcase_118 | AC | 433 ms
76,264 KB |
| testcase_119 | AC | 405 ms
76,184 KB |
| testcase_120 | AC | 365 ms
75,424 KB |
| testcase_121 | AC | 406 ms
75,972 KB |
| testcase_122 | AC | 404 ms
74,640 KB |
ソースコード
import java.io.*;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Queue;
public class AAAAA {
InputStream is;
FastWriter out;
String INPUT = "";
// String INPUT = "3 0 1 0 2 0 1 1 1 1 2 -1 0";
// String INPUT = "3 -1 -1 -1 0 -1 1 -1 0 0 1 -1 0";
// String INPUT = "3 -2 -1 -1 -1 -1 0 -2 0 -1 0 -1 2";
int[] get(int x, int y)
{
out.println("? " + (x+1) + " " + (y+1)).flush();
return na(2);
}
public void solve()
{
int n = ni();
int[][] pqs = new int[n*n-n][];
pqs[0] = new int[]{0, 0};
for(int i = 1;i < n*n-n;i++){
pqs[i] = get(i, 0);
}
int max1 = 0;
for(int[] u : pqs){
max1 = Math.max(max1, u[1]);
}
int min = 1;
int max = -1;
int argmin = -1;
int m = n*n-n;
for(int i = 0;i < m;i++){
int[] u = pqs[i];
if(u[1] == max1){
if(u[0] < min){
min = u[0];
argmin = i;
}
if(u[0] > max){
max = u[0];
}
}
}
if(max - min == n-1){
// argmin = (n-1, 0)
int[] val = new int[m];
int ox = n-1-pqs[argmin][1], oy = -pqs[argmin][0];
for(int i = 0;i < m;i++){
for(int j = i+1;j < m;j++){
if(Arrays.equals(pqs[i], pqs[j])){
int[] res = get(i, argmin);
val[i] = (res[0]+(n-1))*n + res[1];
val[j] = ((ox+pqs[j][0])*n+(oy+pqs[j][1]))+((ox+pqs[j][1])*n+(oy+pqs[j][0])) - val[i];
}
}
}
for(int i = 0;i < m;i++){
if(val[i] == 0){
int vx = ox + pqs[i][0], vy = oy + pqs[i][1];
if(1 <= vx && vx < n && 0 <= vy && vy < n){
}else{
vx = ox + pqs[i][1]; vy = oy + pqs[i][0];
}
val[i] = vx*n+vy;
}
}
out.print("! ").println(val);
out.flush();
}else{
assert max - min == n-2;
// argmin = (1, n-1)
int[] val = new int[m];
int oy = n-1-pqs[argmin][1], ox = 1-pqs[argmin][0];
for(int i = 0;i < m;i++){
for(int j = i+1;j < m;j++){
if(Arrays.equals(pqs[i], pqs[j])){
int[] res = get(i, argmin);
val[i] = (res[1]+1)*n + (n-1+res[0]);
val[j] = ((ox+pqs[j][0])*n+(oy+pqs[j][1]))+((ox+pqs[j][1])*n+(oy+pqs[j][0])) - val[i];
}
}
}
for(int i = 0;i < m;i++){
if(val[i] == 0){
int vx = ox + pqs[i][0], vy = oy + pqs[i][1];
if(1 <= vx && vx < n && 0 <= vy && vy < n){
}else{
vx = ox + pqs[i][1]; vy = oy + pqs[i][0];
}
val[i] = vx*n+vy;
}
}
out.print("! ").println(val);
out.flush();
}
}
public static void main(String[] args) {
new AAAAA().run();
}
public void run()
{
long S = System.currentTimeMillis();
is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
out = new FastWriter(System.out);
solve();
out.flush();
long G = System.currentTimeMillis();
tr(G-S+"ms");
// Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
// @Override
// public void run() {
// long s = System.currentTimeMillis();
// solve();
// out.flush();
// if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
// }
// };
// t.start();
// t.join();
}
private boolean eof()
{
if(lenbuf == -1)return true;
int lptr = ptrbuf;
while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;
try {
is.mark(1000);
while(true){
int b = is.read();
if(b == -1){
is.reset();
return true;
}else if(!isSpaceChar(b)){
is.reset();
return false;
}
}
} catch (IOException e) {
return true;
}
}
private final byte[] inbuf = new byte[1024];
public int lenbuf = 0, ptrbuf = 0;
private int readByte()
{
if(lenbuf == -1)throw new InputMismatchException();
if(ptrbuf >= lenbuf){
ptrbuf = 0;
try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
if(lenbuf <= 0)return -1;
}
return inbuf[ptrbuf++];
}
private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
// private boolean isSpaceChar(int c) { return !(c >= 32 && c <= 126); }
private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
private double nd() { return Double.parseDouble(ns()); }
private char nc() { return (char)skip(); }
private String ns()
{
int b = skip();
StringBuilder sb = new StringBuilder();
while(!(isSpaceChar(b))){
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
private char[] ns(int n)
{
char[] buf = new char[n];
int b = skip(), p = 0;
while(p < n && !(isSpaceChar(b))){
buf[p++] = (char)b;
b = readByte();
}
return n == p ? buf : Arrays.copyOf(buf, p);
}
private char[][] nm(int n, int m)
{
char[][] map = new char[n][];
for(int i = 0;i < n;i++)map[i] = ns(m);
return map;
}
private int[] na(int n)
{
int[] a = new int[n];
for(int i = 0;i < n;i++)a[i] = ni();
return a;
}
private long[] nal(int n)
{
long[] a = new long[n];
for(int i = 0;i < n;i++)a[i] = nl();
return a;
}
private int ni()
{
int num = 0, b;
boolean minus = false;
while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
if(b == '-'){
minus = true;
b = readByte();
}
while(true){
if(b >= '0' && b <= '9'){
num = num * 10 + (b - '0');
}else{
return minus ? -num : num;
}
b = readByte();
}
}
private long nl()
{
long num = 0;
int b;
boolean minus = false;
while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
if(b == '-'){
minus = true;
b = readByte();
}
while(true){
if(b >= '0' && b <= '9'){
num = num * 10 + (b - '0');
}else{
return minus ? -num : num;
}
b = readByte();
}
}
public static class FastWriter
{
private static final int BUF_SIZE = 1<<13;
private final byte[] buf = new byte[BUF_SIZE];
private final OutputStream out;
private int ptr = 0;
private FastWriter(){out = null;}
public FastWriter(OutputStream os)
{
this.out = os;
}
public FastWriter(String path)
{
try {
this.out = new FileOutputStream(path);
} catch (FileNotFoundException e) {
throw new RuntimeException("FastWriter");
}
}
public FastWriter write(byte b)
{
buf[ptr++] = b;
if(ptr == BUF_SIZE)innerflush();
return this;
}
public FastWriter write(char c)
{
return write((byte)c);
}
public FastWriter write(char[] s)
{
for(char c : s){
buf[ptr++] = (byte)c;
if(ptr == BUF_SIZE)innerflush();
}
return this;
}
public FastWriter write(String s)
{
s.chars().forEach(c -> {
buf[ptr++] = (byte)c;
if(ptr == BUF_SIZE)innerflush();
});
return this;
}
private static int countDigits(int l) {
if (l >= 1000000000) return 10;
if (l >= 100000000) return 9;
if (l >= 10000000) return 8;
if (l >= 1000000) return 7;
if (l >= 100000) return 6;
if (l >= 10000) return 5;
if (l >= 1000) return 4;
if (l >= 100) return 3;
if (l >= 10) return 2;
return 1;
}
public FastWriter write(int x)
{
if(x == Integer.MIN_VALUE){
return write((long)x);
}
if(ptr + 12 >= BUF_SIZE)innerflush();
if(x < 0){
write((byte)'-');
x = -x;
}
int d = countDigits(x);
for(int i = ptr + d - 1;i >= ptr;i--){
buf[i] = (byte)('0'+x%10);
x /= 10;
}
ptr += d;
return this;
}
private static int countDigits(long l) {
if (l >= 1000000000000000000L) return 19;
if (l >= 100000000000000000L) return 18;
if (l >= 10000000000000000L) return 17;
if (l >= 1000000000000000L) return 16;
if (l >= 100000000000000L) return 15;
if (l >= 10000000000000L) return 14;
if (l >= 1000000000000L) return 13;
if (l >= 100000000000L) return 12;
if (l >= 10000000000L) return 11;
if (l >= 1000000000L) return 10;
if (l >= 100000000L) return 9;
if (l >= 10000000L) return 8;
if (l >= 1000000L) return 7;
if (l >= 100000L) return 6;
if (l >= 10000L) return 5;
if (l >= 1000L) return 4;
if (l >= 100L) return 3;
if (l >= 10L) return 2;
return 1;
}
public FastWriter write(long x)
{
if(x == Long.MIN_VALUE){
return write("" + x);
}
if(ptr + 21 >= BUF_SIZE)innerflush();
if(x < 0){
write((byte)'-');
x = -x;
}
int d = countDigits(x);
for(int i = ptr + d - 1;i >= ptr;i--){
buf[i] = (byte)('0'+x%10);
x /= 10;
}
ptr += d;
return this;
}
public FastWriter write(double x, int precision)
{
if(x < 0){
write('-');
x = -x;
}
x += Math.pow(10, -precision)/2;
// if(x < 0){ x = 0; }
write((long)x).write(".");
x -= (long)x;
for(int i = 0;i < precision;i++){
x *= 10;
write((char)('0'+(int)x));
x -= (int)x;
}
return this;
}
public FastWriter writeln(char c){
return write(c).writeln();
}
public FastWriter writeln(int x){
return write(x).writeln();
}
public FastWriter writeln(long x){
return write(x).writeln();
}
public FastWriter writeln(double x, int precision){
return write(x, precision).writeln();
}
public FastWriter write(int... xs)
{
boolean first = true;
for(int x : xs) {
if (!first) write(' ');
first = false;
write(x);
}
return this;
}
public FastWriter write(long... xs)
{
boolean first = true;
for(long x : xs) {
if (!first) write(' ');
first = false;
write(x);
}
return this;
}
public FastWriter writeln()
{
return write((byte)'\n');
}
public FastWriter writeln(int... xs)
{
return write(xs).writeln();
}
public FastWriter writeln(long... xs)
{
return write(xs).writeln();
}
public FastWriter writeln(char[] line)
{
return write(line).writeln();
}
public FastWriter writeln(char[]... map)
{
for(char[] line : map)write(line).writeln();
return this;
}
public FastWriter writeln(String s)
{
return write(s).writeln();
}
private void innerflush()
{
try {
out.write(buf, 0, ptr);
ptr = 0;
} catch (IOException e) {
throw new RuntimeException("innerflush");
}
}
public void flush()
{
innerflush();
try {
out.flush();
} catch (IOException e) {
throw new RuntimeException("flush");
}
}
public FastWriter print(byte b) { return write(b); }
public FastWriter print(char c) { return write(c); }
public FastWriter print(char[] s) { return write(s); }
public FastWriter print(String s) { return write(s); }
public FastWriter print(int x) { return write(x); }
public FastWriter print(long x) { return write(x); }
public FastWriter print(double x, int precision) { return write(x, precision); }
public FastWriter println(char c){ return writeln(c); }
public FastWriter println(int x){ return writeln(x); }
public FastWriter println(long x){ return writeln(x); }
public FastWriter println(double x, int precision){ return writeln(x, precision); }
public FastWriter print(int... xs) { return write(xs); }
public FastWriter print(long... xs) { return write(xs); }
public FastWriter println(int... xs) { return writeln(xs); }
public FastWriter println(long... xs) { return writeln(xs); }
public FastWriter println(char[] line) { return writeln(line); }
public FastWriter println(char[]... map) { return writeln(map); }
public FastWriter println(String s) { return writeln(s); }
public FastWriter println() { return writeln(); }
}
public static void trnz(int... o)
{
for(int i = 0;i < o.length;i++)if(o[i] != 0)System.out.print(i+":"+o[i]+" ");
System.out.println();
}
// print ids which are 1
public static void trt(long... o)
{
Queue<Integer> stands = new ArrayDeque<>();
for(int i = 0;i < o.length;i++){
for(long x = o[i];x != 0;x &= x-1)stands.add(i<<6|Long.numberOfTrailingZeros(x));
}
System.out.println(stands);
}
public static void tf(boolean... r)
{
for(boolean x : r)System.out.print(x?'#':'.');
System.out.println();
}
public static void tf(boolean[]... b)
{
for(boolean[] r : b) {
for(boolean x : r)System.out.print(x?'#':'.');
System.out.println();
}
System.out.println();
}
public void tf(long[]... b)
{
if(INPUT.length() != 0) {
for (long[] r : b) {
for (long x : r) {
for (int i = 0; i < 64; i++) {
System.out.print(x << ~i < 0 ? '#' : '.');
}
}
System.out.println();
}
System.out.println();
}
}
public void tf(long... b)
{
if(INPUT.length() != 0) {
for (long x : b) {
for (int i = 0; i < 64; i++) {
System.out.print(x << ~i < 0 ? '#' : '.');
}
}
System.out.println();
}
}
private void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}