結果

問題 No.1635 Let’s Sort Integers!!
ユーザー uwiuwi
提出日時 2021-07-30 22:15:34
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 13,501 bytes
コンパイル時間 4,782 ms
コンパイル使用メモリ 93,556 KB
実行使用メモリ 93,284 KB
最終ジャッジ日時 2024-09-16 00:40:55
合計ジャッジ時間 29,419 ms
ジャッジサーバーID
（参考情報） 		judge6 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 78 ms
51,132 KB
testcase_01 AC 82 ms
50,764 KB
testcase_02 AC 74 ms
50,984 KB
testcase_03 AC 71 ms
50,872 KB
testcase_04 AC 70 ms
50,884 KB
testcase_05 WA -
testcase_06 AC 88 ms
51,036 KB
testcase_07 AC 84 ms
50,888 KB
testcase_08 AC 81 ms
50,712 KB
testcase_09 AC 82 ms
51,244 KB
testcase_10 AC 83 ms
51,088 KB
testcase_11 AC 84 ms
51,104 KB
testcase_12 AC 91 ms
51,140 KB
testcase_13 AC 81 ms
51,140 KB
testcase_14 AC 79 ms
51,084 KB
testcase_15 AC 76 ms
50,760 KB
testcase_16 AC 88 ms
50,756 KB
testcase_17 AC 81 ms
51,040 KB
testcase_18 WA -
testcase_19 AC 78 ms
51,128 KB
testcase_20 AC 80 ms
51,216 KB
testcase_21 AC 81 ms
51,108 KB
testcase_22 AC 79 ms
51,000 KB
testcase_23 AC 80 ms
51,100 KB
testcase_24 AC 80 ms
51,136 KB
testcase_25 WA -
testcase_26 AC 78 ms
51,164 KB
testcase_27 AC 70 ms
50,852 KB
testcase_28 AC 68 ms
50,892 KB
testcase_29 AC 68 ms
50,816 KB
testcase_30 AC 68 ms
50,640 KB
testcase_31 WA -
testcase_32 AC 78 ms
50,900 KB
testcase_33 AC 83 ms
51,064 KB
testcase_34 WA -
testcase_35 AC 84 ms
50,712 KB
testcase_36 AC 89 ms
50,732 KB
testcase_37 AC 83 ms
51,100 KB
testcase_38 AC 81 ms
50,704 KB
testcase_39 AC 82 ms
50,716 KB
testcase_40 AC 82 ms
51,260 KB
testcase_41 AC 81 ms
50,880 KB
testcase_42 AC 77 ms
50,988 KB
testcase_43 AC 78 ms
51,144 KB
testcase_44 AC 81 ms
51,104 KB
testcase_45 AC 84 ms
51,104 KB
testcase_46 AC 82 ms
50,860 KB
testcase_47 AC 74 ms
50,800 KB
testcase_48 AC 68 ms
50,848 KB
testcase_49 AC 89 ms
51,200 KB
testcase_50 AC 79 ms
51,324 KB
testcase_51 AC 82 ms
51,184 KB
testcase_52 AC 88 ms
51,104 KB
testcase_53 AC 78 ms
50,932 KB
testcase_54 AC 83 ms
51,248 KB
testcase_55 AC 88 ms
51,064 KB
testcase_56 AC 80 ms
51,116 KB
testcase_57 AC 94 ms
51,068 KB
testcase_58 AC 97 ms
51,132 KB
testcase_59 AC 70 ms
50,688 KB
testcase_60 WA -
testcase_61 AC 375 ms
61,852 KB
testcase_62 AC 534 ms
92,568 KB
testcase_63 AC 367 ms
60,072 KB
testcase_64 AC 442 ms
70,304 KB
testcase_65 AC 553 ms
93,264 KB
testcase_66 AC 522 ms
93,056 KB
testcase_67 AC 512 ms
93,284 KB
testcase_68 AC 286 ms
85,132 KB
testcase_69 AC 67 ms
50,496 KB
testcase_70 WA -
testcase_71 AC 417 ms
64,128 KB
testcase_72 AC 353 ms
61,752 KB
testcase_73 AC 261 ms
57,292 KB
testcase_74 AC 479 ms
77,312 KB
testcase_75 AC 511 ms
93,284 KB
testcase_76 AC 507 ms
93,172 KB
testcase_77 AC 510 ms
93,136 KB
testcase_78 AC 298 ms
85,248 KB
testcase_79 AC 71 ms
50,916 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest210730;

import java.io.*;
import java.util.*;
import java.util.function.IntUnaryOperator;
import java.util.function.LongUnaryOperator;

public class H {
	InputStream is;
	FastWriter out;

	// 5 7 - 8 4 5
	// 4 7 - 8 5 6

	String INPUT = "";

	public void solve()
	{
		int n = ni();
		long K = nl();
		long ok = K;
		if(K < n-1){
			out.println(-1);
			return;
		}
		boolean[] used = new boolean[n+1];
		Deque<Integer> L = new ArrayDeque<>();
		Deque<Integer> R = new ArrayDeque<>();
		L.addLast(1);
		R.addFirst(n);
		used[1] = used[n] = true;
		K -= n-1;
		for(int i = 2;i < n;i++){
			int ne = i % 2 == 0 ? 1 + i/2 : n - i/2;
			if(i % 4 == 2){
				int cha = R.getLast() - ne;
				int v = R.getLast() - (int)Math.min(K, cha);
				R.addLast(v);
				used[v] = true;
				K -= cha;
				if(K <= 0)break;
			}else if(i % 4 == 3){
				int cha = ne - L.getFirst();
				int v = (int)Math.min(K, cha) + L.getFirst();
				L.addFirst(v);
				used[v] = true;
				K -= cha;
				if(K <= 0)break;
			}else if(i % 4 == 0) {
				int cha = L.getFirst() - ne;
				int v = L.getFirst() - (int) Math.min(K, cha);
				L.addFirst(v);
				used[v] = true;
				K -= cha;
				if (K <= 0) break;
			}else{
				int cha = ne - R.getLast();
				int v = (int)Math.min(K, cha) + R.getLast();
				if(used[v]){
					int RL = R.pollLast();
					int LL = L.pollFirst();
					used[RL] = used[LL] = false;
					L.addFirst(LL-1);
					R.addLast(RL+1);
					R.addLast(v+1);
					used[LL-1] = used[RL+1] = used[v+1] = true;
				}else {
					R.addLast(v);
					used[v] = true;
				}
				K -= cha;
				if(K <= 0)break;
			}
		}
		if(K > 0){
			out.println(-1);
			return;
		}
//		out.println(0);
//		if(true)return;
//		List<Integer> all = new ArrayList<>();
//		for(int v : L)all.add(v);
//		for(int i = 1;i <= n;i++){
//			if(!used[i]){
//				all.add(i);
//			}
//		}
//		for(int v : R)all.add(v);
//
//		assert isPermP1(all);
//		assert all.size() == n;
//		long q = 0;
//		for(int i = 0;i < all.size()-1;i++){
//			q += Math.abs(all.get(i+1) - all.get(i));
//		}
//		assert q == ok;

		for(int v : L)out.print(v).print(" ");
		for(int i = 1;i <= n;i++){
			if(!used[i]){
				out.print(i).print(" ");
			}
		}
		for(int v : R)out.print(v).print(" ");
		out.println();
	}

	static boolean isPermP1(List<Integer> a)
	{
		List<Integer> b = new ArrayList<>(a);
		Collections.sort(b);
		for(int i = 0;i < b.size();i++){
			if(b.get(i) != i+1)return false;
		}
		return true;
	}

	public static void main(String[] args) {
		new H().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 write(IntUnaryOperator f, int... xs)
		{
			boolean first = true;
			for(int x : xs) {
				if (!first) write(' ');
				first = false;
				write(f.applyAsInt(x));
			}
			return this;
		}

		public FastWriter write(LongUnaryOperator f, long... xs)
		{
			boolean first = true;
			for(long x : xs) {
				if (!first) write(' ');
				first = false;
				write(f.applyAsLong(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(IntUnaryOperator f, int... xs) { return write(f, xs).writeln(); }
		public FastWriter writeln(LongUnaryOperator f, long... xs) { return write(f, 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 print(IntUnaryOperator f, int... xs) { return write(f, xs); }
		public FastWriter print(LongUnaryOperator f, long... xs) { return write(f, xs); }
		public FastWriter println(int... xs) { return writeln(xs); }
		public FastWriter println(long... xs) { return writeln(xs); }
		public FastWriter println(IntUnaryOperator f, int... xs) { return writeln(f, xs); }
		public FastWriter println(LongUnaryOperator f, long... xs) { return writeln(f, 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)); }
}
0