結果

問題 No.282 おもりと天秤(2)
ユーザー tanzakutanzaku
提出日時 2015-09-18 22:59:19
言語 Java21
(openjdk 21)
結果
AC  
実行時間 2,204 ms / 5,000 ms
コード長 6,031 bytes
コンパイル時間 2,879 ms
コンパイル使用メモリ 82,136 KB
実行使用メモリ 79,360 KB
平均クエリ数 220.83
最終ジャッジ日時 2023-09-23 21:30:23
合計ジャッジ時間 27,205 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 123 ms
68,708 KB
testcase_01 AC 138 ms
68,840 KB
testcase_02 AC 117 ms
68,300 KB
testcase_03 AC 112 ms
66,884 KB
testcase_04 AC 121 ms
68,716 KB
testcase_05 AC 131 ms
68,688 KB
testcase_06 AC 134 ms
70,292 KB
testcase_07 AC 110 ms
68,516 KB
testcase_08 AC 131 ms
70,080 KB
testcase_09 AC 102 ms
68,720 KB
testcase_10 AC 673 ms
75,300 KB
testcase_11 AC 2,027 ms
77,964 KB
testcase_12 AC 760 ms
75,372 KB
testcase_13 AC 1,079 ms
76,932 KB
testcase_14 AC 1,744 ms
76,900 KB
testcase_15 AC 2,056 ms
78,104 KB
testcase_16 AC 227 ms
68,988 KB
testcase_17 AC 980 ms
76,396 KB
testcase_18 AC 1,603 ms
75,648 KB
testcase_19 AC 1,538 ms
78,104 KB
testcase_20 AC 2,168 ms
77,504 KB
testcase_21 AC 2,204 ms
79,360 KB
testcase_22 AC 2,135 ms
78,004 KB
testcase_23 AC 87 ms
67,064 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.math.*;
import java.util.*;

import static java.util.Arrays.*;

public class Main {
	private static final int mod = (int)1e9+7;

	final Random random = new Random(0);
	final IOFast io = new IOFast();

	/// MAIN CODE
	public void run() throws IOException {
//		int TEST_CASE = Integer.parseInt(new String(io.nextLine()).trim());
		int TEST_CASE = 1;
		while(TEST_CASE-- != 0) {
			n = io.nextInt();
			p = new int[n];
			for(int i = 0; i < n; i++) p[i] = i + 1;
			for(int i = 0; i < n; i++) {
				io.out.print('?');
				int c = 0;
				for(int j = i&1; j < n - 1; j+=2, c++) {
					io.out.print(" " + p[j] + " " + p[j+1]);
				}
				for(; c < n; c++) {
					io.out.print(" 0 0");
				}
				io.out.println();
				io.out.flush();
				c = 0;
				for(int j = i&1; j < n - 1; j+=2, c++) {
					char ch = io.nextChar();
					if(ch == '>') swap(p, j, j + 1);
				}
				for(; c < n; c++) {
					io.nextChar();
				}
			}
			io.out.print('!');
			for(int i = 0; i < n; i++) io.out.print(" " + p[i]);
			io.out.println();
			io.out.flush();
		}
	}
	
	int n;
	int[] p;
	/*
	void mergeSort(int l, int r) {
		if(r - l <= 1) return;
		final int m = (l + r) / 2;
		mergeSort(l, m);
		mergeSort(m, r);
		int[] tmp = new int[r - l];
		int i, j;
		for(i = l, j = m; i < m && j < r; ) {
		}
	}*/
	
	/// TEMPLATE
	static int gcd(int n, int r) { return r == 0 ? n : gcd(r, n%r); }
	static long gcd(long n, long r) { return r == 0 ? n : gcd(r, n%r); }
	
	static <T> void swap(T[] x, int i, int j) { T t = x[i]; x[i] = x[j]; x[j] = t; }
	static void swap(int[] x, int i, int j) { int t = x[i]; x[i] = x[j]; x[j] = t; }
	
	void main() throws IOException {
		//		IOFast.setFileIO("rle-size.in", "rle-size.out");
		try { run(); }
		catch (EndOfFileRuntimeException e) { }
		io.out.flush();
	}
	public static void main(String[] args) throws IOException { new Main().main(); }
	
	static class EndOfFileRuntimeException extends RuntimeException {
		private static final long serialVersionUID = -8565341110209207657L; }

	static
	public class IOFast {
		private BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		private PrintWriter out = new PrintWriter(System.out);

		void setFileIn(String ins) throws IOException { in.close(); in = new BufferedReader(new FileReader(ins)); }
		void setFileOut(String outs) throws IOException { out.flush(); out.close(); out = new PrintWriter(new FileWriter(outs)); }
		void setFileIO(String ins, String outs) throws IOException { setFileIn(ins); setFileOut(outs); }

		private static int pos, readLen;
		private static final char[] buffer = new char[1024 * 8];
		private static char[] str = new char[500*8*2];
		private static boolean[] isDigit = new boolean[256];
		private static boolean[] isSpace = new boolean[256];
		private static boolean[] isLineSep = new boolean[256];

		static { for(int i = 0; i < 10; i++) { isDigit['0' + i] = true; } isDigit['-'] = true; isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true; isLineSep['\r'] = isLineSep['\n'] = true; }
		public int read() throws IOException { if(pos >= readLen) { pos = 0; readLen = in.read(buffer); if(readLen <= 0) { throw new EndOfFileRuntimeException(); } } return buffer[pos++]; }
		public int nextInt() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; int ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
		public long nextLong() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; long ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
		public char nextChar() throws IOException { while(true) { final int c = read(); if(!isSpace[c]) { return (char)c; } } }
		int reads(int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } if(str.length == len) { char[] rep = new char[str.length * 3 / 2]; System.arraycopy(str, 0, rep, 0, str.length); str = rep; } str[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
		int reads(char[] cs, int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } cs[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
		public char[] nextLine() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isLineSep); try { if(str[len-1] == '\r') { len--; read(); } } catch(EndOfFileRuntimeException e) { ; } return Arrays.copyOf(str, len); }
		public String nextString() throws IOException { return new String(next()); }
		public char[] next() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); return Arrays.copyOf(str, len); }
		public int next(char[] cs) throws IOException { int len = 0; cs[len++] = nextChar(); len = reads(cs, len, isSpace); return len; }
		public double nextDouble() throws IOException { return Double.parseDouble(nextString()); }
		public long[] nextLongArray(final int n) throws IOException { final long[] res = new long[n]; for(int i = 0; i < n; i++) { res[i] = nextLong(); } return res; }
		public int[] nextIntArray(final int n) throws IOException { final int[] res = new int[n]; for(int i = 0; i < n; i++) { res[i] = nextInt(); } return res; }
		public int[][] nextIntArray2D(final int n, final int k) throws IOException { final int[][] res = new int[n][]; for(int i = 0; i < n; i++) { res[i] = nextIntArray(k); } return res; }
		public int[][] nextIntArray2DWithIndex(final int n, final int k) throws IOException { final int[][] res = new int[n][k+1]; for(int i = 0; i < n; i++) { for(int j = 0; j < k; j++) { res[i][j] = nextInt(); } res[i][k] = i; } return res; }
		public double[] nextDoubleArray(final int n) throws IOException { final double[] res = new double[n]; for(int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; }
	}
}
0