結果

問題 No.1051 PQ Permutation
ユーザー uwiuwi
提出日時 2020-05-08 21:53:49
言語 Java21
(openjdk 21)
結果
AC  
実行時間 327 ms / 2,000 ms
コード長 6,981 bytes
コンパイル時間 4,590 ms
コンパイル使用メモリ 90,152 KB
実行使用メモリ 48,156 KB
最終ジャッジ日時 2024-07-05 19:33:55
合計ジャッジ時間 14,047 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 46 ms
36,824 KB
testcase_01 AC 47 ms
36,872 KB
testcase_02 AC 47 ms
36,912 KB
testcase_03 AC 46 ms
37,072 KB
testcase_04 AC 45 ms
36,816 KB
testcase_05 AC 48 ms
37,308 KB
testcase_06 AC 47 ms
37,160 KB
testcase_07 AC 46 ms
36,752 KB
testcase_08 AC 47 ms
36,860 KB
testcase_09 AC 47 ms
37,112 KB
testcase_10 AC 46 ms
36,976 KB
testcase_11 AC 49 ms
36,668 KB
testcase_12 AC 47 ms
37,032 KB
testcase_13 AC 46 ms
36,752 KB
testcase_14 AC 45 ms
37,000 KB
testcase_15 AC 279 ms
45,416 KB
testcase_16 AC 282 ms
45,280 KB
testcase_17 AC 269 ms
45,816 KB
testcase_18 AC 229 ms
45,148 KB
testcase_19 AC 257 ms
45,596 KB
testcase_20 AC 277 ms
45,604 KB
testcase_21 AC 275 ms
45,308 KB
testcase_22 AC 247 ms
45,744 KB
testcase_23 AC 280 ms
45,484 KB
testcase_24 AC 280 ms
45,244 KB
testcase_25 AC 111 ms
39,536 KB
testcase_26 AC 102 ms
38,652 KB
testcase_27 AC 86 ms
37,748 KB
testcase_28 AC 135 ms
40,240 KB
testcase_29 AC 110 ms
38,796 KB
testcase_30 AC 131 ms
39,544 KB
testcase_31 AC 102 ms
38,380 KB
testcase_32 AC 125 ms
39,212 KB
testcase_33 AC 94 ms
37,924 KB
testcase_34 AC 88 ms
38,204 KB
testcase_35 AC 234 ms
44,028 KB
testcase_36 AC 243 ms
44,048 KB
testcase_37 AC 143 ms
39,212 KB
testcase_38 AC 290 ms
44,780 KB
testcase_39 AC 121 ms
40,004 KB
testcase_40 AC 327 ms
48,156 KB
testcase_41 AC 277 ms
44,804 KB
testcase_42 AC 47 ms
37,040 KB
testcase_43 AC 47 ms
36,880 KB
testcase_44 AC 46 ms
37,232 KB
testcase_45 AC 46 ms
36,592 KB
testcase_46 AC 48 ms
36,868 KB
testcase_47 AC 47 ms
36,860 KB
testcase_48 AC 153 ms
40,388 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest200508;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.List;

public class F {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), P = ni(), Q = ni();
		int[] a = na(n);
		int ppos = 0;
		int qpos = 0;
		for(int i = 0;i < n;i++){
			if(a[i] == P)ppos = i;
			if(a[i] == Q)qpos = i;
		}
		LST rem = new LST(n+3);
		rem.set(a[n-1]);
		for(int i = n-2;i >= 0;i--){
			// i moves, <i fixed
			rem.set(a[i]);
			if(i > ppos){
				if(ppos < qpos){
					if(rem.next(a[i]+1) != -1){
						{
							int v = rem.next(a[i]+1);
							rem.unset(v);
							a[i] = v;
						}
						for(int j = i+1;j < n;j++){
							int v = rem.next(0);
							a[j] = v;
							rem.unset(v);
						}
						print(a); return;
					}
				}
			}else if(i <= qpos){
				int cur = a[i];
				while(true){
					int ne = rem.next(cur+1);
					if(ne == -1)break;
					if(ne == Q){
						cur = ne;
						continue;
					}
					a[i] = ne;
					rem.unset(ne);
					
					if(P < Q || ne == P){
						for(int j = i+1;j < n;j++){
							int v = rem.next(0);
							a[j] = v;
							rem.unset(v);
						}
					}else{
						rem.unset(Q);
						for(int j = i+1;j < n;j++){
							int v = rem.next(0);
							a[j] = v;
							rem.unset(v);
							if(v == P){
								j++;
								a[j] = Q;
							}
						}
					}
					print(a);
					return;
				}
			}
		}
		out.println(-1);
	}
	
	void print(int[] a)
	{
		boolean f = true;
		for(int v : a){
			if(!f)out.print(" ");
			f = false;
			out.print(v);
		}
		out.println();
	}
	
	public static class LST {
		public long[][] set;
		public int n;
//		public int size;
		
		public LST(int n) {
			this.n = n;
			int d = 1;
			for(int m = n;m > 1;m>>>=6, d++);
			
			set = new long[d][];
			for(int i = 0, m = n>>>6;i < d;i++, m>>>=6){
				set[i] = new long[m+1];
			}
//			size = 0;
		}
		
		// [0,r)
		public LST setRange(int r)
		{
			for(int i = 0;i < set.length;i++, r=r+63>>>6){
				for(int j = 0;j < r>>>6;j++){
					set[i][j] = -1L;
				}
				if((r&63) != 0)set[i][r>>>6] |= (1L<<r)-1;
			}
			return this;
		}
		
		// [0,r)
		public LST unsetRange(int r)
		{
			if(r >= 0){
				for(int i = 0;i < set.length;i++, r=r+63>>>6){
					for(int j = 0;j < r+63>>>6;j++){
						set[i][j] = 0;
					}
					if((r&63) != 0)set[i][r>>>6] &= ~((1L<<r)-1);
				}
			}
			return this;
		}
		
		public LST set(int pos)
		{
			if(pos >= 0 && pos < n){
//				if(!get(pos))size++;
				for(int i = 0;i < set.length;i++, pos>>>=6){
					set[i][pos>>>6] |= 1L<<pos;
				}
			}
			return this;
		}
		
		public LST unset(int pos)
		{
			if(pos >= 0 && pos < n){
//				if(get(pos))size--;
				for(int i = 0;i < set.length && (i == 0 || set[i-1][pos] == 0L);i++, pos>>>=6){
					set[i][pos>>>6] &= ~(1L<<pos);
				}
			}
			return this;
		}
		
		public boolean get(int pos)
		{
			return pos >= 0 && pos < n && set[0][pos>>>6]<<~pos<0;
		}
		
		public LST toggle(int pos)
		{
			return get(pos) ? unset(pos) : set(pos);
		}
		
		public int prev(int pos)
		{
			for(int i = 0;i < set.length && pos >= 0;i++, pos>>>=6, pos--){
				int pre = prev(set[i][pos>>>6], pos&63);
				if(pre != -1){
					pos = pos>>>6<<6|pre;
					while(i > 0)pos = pos<<6|63-Long.numberOfLeadingZeros(set[--i][pos]);
					return pos;
				}
			}
			return -1;
		}
		
		public int next(int pos)
		{
			for(int i = 0;i < set.length && pos>>>6 < set[i].length;i++, pos>>>=6, pos++){
				int nex = next(set[i][pos>>>6], pos&63);
				if(nex != -1){
					pos = pos>>>6<<6|nex;
					while(i > 0)pos = pos<<6|Long.numberOfTrailingZeros(set[--i][pos]);
					return pos;
				}
			}
			return -1;
		}
		
		private static int prev(long set, int n)
		{
			long h = set<<~n;
			if(h == 0L)return -1;
			return -Long.numberOfLeadingZeros(h)+n;
		}
		
		private static int next(long set, int n)
		{
			long h = set>>>n;
			if(h == 0L)return -1;
			return Long.numberOfTrailingZeros(h)+n;
		}
		
		@Override
		public String toString()
		{
			List<Integer> list = new ArrayList<Integer>();
			for(int pos = next(0);pos != -1;pos = next(pos+1)){
				list.add(pos);
			}
			return list.toString();
		}
	}

	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-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();
	}
	
	public static void main(String[] args) throws Exception { new F().run(); }
	
	private 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 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))){ // when nextLine, (isSpaceChar(b) && 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 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 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[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	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();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0