結果

問題 No.925 紲星 Extra
ユーザー uwiuwi
提出日時 2019-11-08 23:59:37
言語 Java21
(openjdk 21)
結果
TLE  
実行時間 -
コード長 5,324 bytes
コンパイル時間 4,179 ms
コンパイル使用メモリ 84,676 KB
実行使用メモリ 74,096 KB
最終ジャッジ日時 2023-10-13 05:42:21
合計ジャッジ時間 22,306 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 40 ms
49,936 KB
testcase_01 AC 39 ms
49,520 KB
testcase_02 AC 41 ms
49,760 KB
testcase_03 AC 122 ms
55,024 KB
testcase_04 AC 124 ms
55,036 KB
testcase_05 TLE -
testcase_06 TLE -
testcase_07 -- -
testcase_08 -- -
testcase_09 -- -
testcase_10 -- -
testcase_11 -- -
testcase_12 -- -
testcase_13 -- -
testcase_14 -- -
testcase_15 -- -
testcase_16 -- -
testcase_17 -- -
testcase_18 -- -
testcase_19 -- -
testcase_20 -- -
testcase_21 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest191108;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class F {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), Q = ni();
		long[] a = new long[n];
		for(int i = 0;i < n;i++) {
			a[i] = nl();
		}
		int B = Math.max(1, (int)Math.sqrt(n)/2);
		
		long[][][] vs = new long[n/B+1][][];
		for(int i = 0;i < n/B+1;i++) {
			vs[i] = recompile(i, B, a);
		}
		
		long s = 0;
		for(int z = 0;z < Q;z++) {
			int t = ni();
			if(t == 1) {
				int x = (int)(ni()^(s&(1L<<16)-1))-1;
				long y = nl()^(s&(1L<<40)-1);
				a[x] = y;
				vs[x/B] = recompile(x/B, B, a);
			}else {
				int l = (int)(ni()^(s&(1L<<16)-1))-1;
				int r = (int)(ni()^(s&(1L<<16)-1))-1;
				if(l > r) {
					int d = l; l = r; r = d;
				}
				int K = (r+1-l+1)/2;
				long low = -1, high = 1L<<40;
				while(high - low > 1) {
					long h = high+low>>1;
					long num = 0;
					if(l/B == r/B) {
						for(int i = l;i <= r;i++) {
							if(a[i] < h)num++;
						}
					}else {
						for(int i = l;i < l/B*B+B && i < n;i++) {
							if(a[i] < h)num++;
						}
						for(int i = r/B*B;i <= r;i++) {
							if(a[i] < h)num++;
						}
						for(int i = l/B+1;i < r/B;i++) {
							num += lowerBound(vs[i][0], h);
						}
					}
					if(num < K) {
						low = h;
					}else {
						high = h;
					}
				}
				
				long mid = low;
				long ans = 0;
				if(l/B == r/B) {
					for(int i = l;i <= r;i++) {
						ans += Math.abs(a[i]-mid);
					}
				}else {
					for(int i = l;i < l/B*B+B && i < n;i++) {
						ans += Math.abs(a[i]-mid);
					}
					for(int i = r/B*B;i <= r;i++) {
						ans += Math.abs(a[i]-mid);
					}
					for(int i = l/B+1;i < r/B;i++) {
						int lb = lowerBound(vs[i][0], mid);
						ans += mid * lb - vs[i][1][lb];
						ans += vs[i][1][vs[i][1].length-1] - vs[i][1][lb] - mid * (vs[i][0].length - lb);
					}
				}
				out.println(ans);
				
				s ^= ans;
			}
		}
	}
	
	public static int lowerBound(long[] a, long v)
	{
		int low = -1, high = a.length;
		while(high-low > 1){
			int h = high+low>>>1;
			if(a[h] >= v){
				high = h;
			}else{
				low = h;
			}
		}
		return high;
	}

	
	long[][] recompile(int x, int B, long[] a)
	{
		int n = a.length;
		long[] t = new long[B];
		int p = 0;
		for(int j = 0;j < B && x*B+j < n;j++) {
			t[j] = a[x*B+j];
			p++;
		}
		t = Arrays.copyOf(t, p);
		Arrays.sort(t);
		long[] cum = new long[p+1];
		for(int i = 0;i < p;i++)cum[i+1] = cum[i] + t[i];
		return new long[][] {t, cum};
	}
	
	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