結果

問題 No.808 Kaiten Sushi?
ユーザー uwiuwi
提出日時 2019-03-22 21:49:26
言語 Java21
(openjdk 21)
結果
AC  
実行時間 275 ms / 2,000 ms
コード長 7,014 bytes
コンパイル時間 4,242 ms
コンパイル使用メモリ 88,816 KB
実行使用メモリ 58,132 KB
最終ジャッジ日時 2023-10-19 07:48:05
合計ジャッジ時間 14,441 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge15
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 56 ms
53,420 KB
testcase_01 AC 56 ms
52,336 KB
testcase_02 AC 55 ms
53,424 KB
testcase_03 AC 55 ms
52,324 KB
testcase_04 AC 56 ms
53,408 KB
testcase_05 AC 55 ms
53,412 KB
testcase_06 AC 54 ms
53,368 KB
testcase_07 AC 66 ms
53,428 KB
testcase_08 AC 66 ms
53,440 KB
testcase_09 AC 83 ms
53,448 KB
testcase_10 AC 79 ms
53,424 KB
testcase_11 AC 67 ms
53,424 KB
testcase_12 AC 79 ms
53,428 KB
testcase_13 AC 77 ms
53,984 KB
testcase_14 AC 59 ms
52,336 KB
testcase_15 AC 82 ms
53,376 KB
testcase_16 AC 80 ms
53,984 KB
testcase_17 AC 60 ms
53,428 KB
testcase_18 AC 57 ms
53,424 KB
testcase_19 AC 58 ms
53,420 KB
testcase_20 AC 58 ms
53,424 KB
testcase_21 AC 56 ms
53,424 KB
testcase_22 AC 59 ms
53,428 KB
testcase_23 AC 137 ms
54,952 KB
testcase_24 AC 133 ms
54,920 KB
testcase_25 AC 128 ms
55,032 KB
testcase_26 AC 130 ms
55,156 KB
testcase_27 AC 226 ms
58,016 KB
testcase_28 AC 142 ms
55,084 KB
testcase_29 AC 229 ms
58,132 KB
testcase_30 AC 193 ms
57,640 KB
testcase_31 AC 234 ms
58,036 KB
testcase_32 AC 238 ms
56,092 KB
testcase_33 AC 166 ms
55,264 KB
testcase_34 AC 196 ms
56,572 KB
testcase_35 AC 216 ms
57,628 KB
testcase_36 AC 160 ms
55,088 KB
testcase_37 AC 56 ms
53,420 KB
testcase_38 AC 56 ms
53,412 KB
testcase_39 AC 230 ms
57,476 KB
testcase_40 AC 125 ms
55,200 KB
testcase_41 AC 130 ms
54,964 KB
testcase_42 AC 212 ms
57,228 KB
testcase_43 AC 154 ms
55,144 KB
testcase_44 AC 204 ms
57,684 KB
testcase_45 AC 144 ms
54,916 KB
testcase_46 AC 113 ms
54,852 KB
testcase_47 AC 268 ms
57,912 KB
testcase_48 AC 271 ms
57,752 KB
testcase_49 AC 249 ms
56,160 KB
testcase_50 AC 275 ms
58,004 KB
testcase_51 AC 273 ms
57,876 KB
testcase_52 AC 205 ms
57,540 KB
testcase_53 AC 220 ms
57,728 KB
testcase_54 AC 56 ms
53,404 KB
testcase_55 AC 56 ms
53,424 KB
testcase_56 AC 56 ms
53,424 KB
testcase_57 AC 134 ms
54,960 KB
testcase_58 AC 187 ms
57,192 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest190322;
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;

// ooxxxo
// oxoxxo
public class E {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), L = ni();
		int[] x = na(n);
		int[] y = na(n);
		LST lstx = new LST(n+5);
		lstx.setRange(n);
		LST lsty = new LST(n+5);
		lsty.setRange(n);
		int pos = 0;
		long ans = 0;
		for(int i = 0;i < 2*n;i++) {
			int rot = 0;
			int xind = lowerBound(x, pos);
			int nex = lstx.next(xind);
			if(nex == -1) {
				rot++;
				nex = lstx.next(0);
			}
			int fx = x[nex];
			
			if(i < 2*n-1) {
				int yind = lowerBound(y, fx);
				int ynex = lsty.next(yind);
				if(ynex == -1) {
					rot++;
					ynex = lsty.next(0);
				}
				
				int fy = y[ynex];
				int lxind = lowerBound(x, fy);
				int lxnex = lstx.prev(lxind-1);
				if(lxnex == -1) {
					rot--;
					lxnex = lstx.prev(n);
				}
				
				ans += x[lxnex] - pos + (long)rot*L;
				pos = x[lxnex];
				lstx.unset(lxnex);
			}else {
				ans += x[nex] - pos + (long)rot*L;
				pos = x[nex];
				lstx.unset(nex);
			}
			
			LST d = lstx; lstx = lsty; lsty = d;
			int[] u = x; x = y; y = u;
		}
		out.println(ans);
	}
	
	public static int lowerBound(int[] a, int v){ return lowerBound(a, 0, a.length, v); }
	public static int lowerBound(int[] a, int l, int r, int v)
	{
		if(l > r || l < 0 || r > a.length)throw new IllegalArgumentException();
		int low = l-1, high = r;
		while(high-low > 1){
			int h = high+low>>>1;
			if(a[h] >= v){
				high = h;
			}else{
				low = h;
			}
		}
		return high;
	}

	
	
	
	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 E().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