結果

問題 No.1597 Matrix Sort
ユーザー nishi5451nishi5451
提出日時 2021-08-02 19:15:06
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 3,210 bytes
コンパイル時間 2,278 ms
コンパイル使用メモリ 78,500 KB
実行使用メモリ 42,016 KB
最終ジャッジ日時 2024-09-16 14:41:49
合計ジャッジ時間 27,443 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 48 ms
36,644 KB
testcase_01 AC 48 ms
37,076 KB
testcase_02 AC 47 ms
36,952 KB
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 AC 328 ms
39,936 KB
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 AC 143 ms
40,164 KB
testcase_26 WA -
testcase_27 AC 47 ms
36,928 KB
testcase_28 AC 46 ms
37,116 KB
testcase_29 AC 50 ms
36,808 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 = 0, right = p;
		//mid以下の数値がk個以上あるmidの最小値
		while(right-left > 1){
			int mid = (right+left) / 2;
			int 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