結果

問題 No.1597 Matrix Sort
ユーザー nishi5451nishi5451
提出日時 2021-08-02 19:29:46
言語 Java19
(openjdk 21)
結果
AC  
実行時間 1,438 ms / 1,500 ms
コード長 3,212 bytes
コンパイル時間 2,075 ms
コンパイル使用メモリ 75,124 KB
実行使用メモリ 55,388 KB
最終ジャッジ日時 2023-10-14 20:52:48
合計ジャッジ時間 26,479 ms
ジャッジサーバーID
(参考情報)
judge13 / judge12
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 42 ms
49,368 KB
testcase_01 AC 43 ms
49,548 KB
testcase_02 AC 42 ms
49,276 KB
testcase_03 AC 1,300 ms
53,792 KB
testcase_04 AC 1,438 ms
55,388 KB
testcase_05 AC 1,371 ms
55,196 KB
testcase_06 AC 1,314 ms
53,860 KB
testcase_07 AC 1,408 ms
54,192 KB
testcase_08 AC 785 ms
54,912 KB
testcase_09 AC 735 ms
53,996 KB
testcase_10 AC 303 ms
52,560 KB
testcase_11 AC 407 ms
52,792 KB
testcase_12 AC 802 ms
54,744 KB
testcase_13 AC 1,124 ms
54,216 KB
testcase_14 AC 1,288 ms
54,584 KB
testcase_15 AC 502 ms
54,820 KB
testcase_16 AC 970 ms
54,708 KB
testcase_17 AC 888 ms
54,508 KB
testcase_18 AC 1,343 ms
54,756 KB
testcase_19 AC 1,362 ms
55,236 KB
testcase_20 AC 1,300 ms
54,996 KB
testcase_21 AC 1,271 ms
54,560 KB
testcase_22 AC 1,122 ms
54,656 KB
testcase_23 AC 726 ms
55,108 KB
testcase_24 AC 169 ms
53,084 KB
testcase_25 AC 160 ms
53,064 KB
testcase_26 AC 43 ms
49,668 KB
testcase_27 AC 41 ms
49,336 KB
testcase_28 AC 41 ms
49,240 KB
testcase_29 AC 42 ms
49,476 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

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

public class Main {
	static final int INF = 1<<30;
	static final long INFL = 1L<<60;
	static final int MOD = 1000000007;
	static final int MOD2 = 998244353;
	static List<List<Integer>> g;
	
	public static void main(String[] args) {
		FastScanner fs = new FastScanner();
		PrintWriter pw = new PrintWriter(System.out);
		int n = fs.nextInt();
		long k = fs.nextLong();
		int p = fs.nextInt();
		int[] a = fs.nextInts(n);
		int[] b = fs.nextInts(n);
		Arrays.sort(b);
		int left = -1, right = p;
		//mid以下の数値がk個以上あるmidの最小値
		while(right-left > 1){
			int mid = (right+left) / 2;
			long cnt = 0;
			for(int i = 0; i < n; i++){
				int tar = p-a[i];
				int l = -1, r = n;
				while(r-l > 1){
					int m = (r+l) / 2;
					if(tar <= b[m]) r = m;
					else l = m;
				}
				int l1 = -1, r1 = l+1;
				while(r1-l1 > 1){
					int m1 = (r1+l1) / 2;
					if(mid < b[m1]+a[i]) r1 = m1;
					else l1 = m1;
				}
				cnt += r1;
				int l2 = r-1, r2 = n;
				while(r2-l2 > 1){
					int m2 = (r2+l2) / 2;
					if(mid < (b[m2]+a[i])%p) r2 = m2;
					else l2 = m2;
				}
				cnt += r2-r;
			}
			if(k <= cnt) right = mid;
			else left = mid;
		}
		pw.println(right);
		pw.close();
	}
}

class FastScanner {
	private InputStream in = System.in;
	private byte[] buffer = new byte[1024];
	private int length = 0, p = 0;
	private boolean hasNextByte() {
		if (p < length) return true;
		else{
			p = 0;
			try{
				length = in.read(buffer);
			}catch(Exception e){
				e.printStackTrace();
			}
			if(length == 0) return false;
		}
		return true;
	}
	private int readByte() {
		if (hasNextByte() == true) return buffer[p++];
		return -1;
	}
	private static boolean isPrintable(int n) {
		return 33 <= n && n <= 126;
	}
	private void skip() {
		while (hasNextByte() && !isPrintable(buffer[p])) p++;
	}
	public boolean hasNext() {
		skip();
		return hasNextByte();
	}
	public String next() {
		if(!hasNext()) throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int temp = readByte();
		while (isPrintable(temp)) {
			sb.appendCodePoint(temp);
			temp = readByte();
		}
		return sb.toString();
	}
	public int nextInt() {
		return Math.toIntExact(nextLong());
	}
	public int[] nextInts(int n) {
		int[] ar = new int[n];
		for (int i = 0; i < n; i++) ar[i] = nextInt();
		return ar;
	}
	public long[] nextLongs(int n) {
		long[] ar = new long[n];
		for (int i = 0; i < n; i++) ar[i] = nextLong();
		return ar;
	}
	public long nextLong() {
		if(!hasNext()) throw new NoSuchElementException();
		boolean minus = false;
		int temp = readByte();
		if (temp == '-') {
			minus = true;
			temp = readByte();
		}
		if (temp < '0' || '9' < temp) throw new NumberFormatException();
		long n = 0;
		while (isPrintable(temp)) {
			if ('0' <= temp && temp <= '9') {
				n *= 10;
				n += temp - '0';
			}
			temp = readByte();
		}
		return minus ? -n : n;
	}
	public char[] nextChars() {
		String s = next();
		return s.toCharArray();
	}
	public char[][] nextCharMat(int h, int w) {
		char[][] ar = new char[h][w];
		for(int i = 0; i < h; i++){
			String s = next();
			for(int j = 0; j < w; j++){
				ar[i][j] = s.charAt(j);
			}
		}
		return ar;
	}
}
0