#609026 (Java21) No.1361 [Zelkova 4th Tune *] QUADRUPLE-SEQUENCEの詩

提出ソース

結果

問題	No.1361 [Zelkova 4th Tune *] QUADRUPLE-SEQUENCEの詩
ユーザー	uwi
提出日時	2021-01-22 23:12:39
言語	Java21 (openjdk 21)
結果	RE
実行時間	-
コード長	12,366 bytes
コンパイル時間	4,651 ms
コンパイル使用メモリ	94,004 KB
実行使用メモリ	62,840 KB
最終ジャッジ日時	2024-06-08 17:54:42
合計ジャッジ時間	64,257 ms
ジャッジサーバーID （参考情報）	judge3 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	101 ms 38,456 KB
testcase_01	AC	102 ms 39,948 KB
testcase_02	AC	103 ms 40,204 KB
testcase_03	AC	102 ms 40,372 KB
testcase_04	AC	107 ms 39,988 KB
testcase_05	AC	98 ms 38,968 KB
testcase_06	AC	98 ms 40,252 KB
testcase_07	AC	99 ms 40,240 KB
testcase_08	AC	120 ms 40,376 KB
testcase_09	AC	110 ms 40,020 KB
testcase_10	AC	130 ms 40,344 KB
testcase_11	AC	129 ms 40,328 KB
testcase_12	AC	121 ms 40,476 KB
testcase_13	AC	161 ms 42,248 KB
testcase_14	AC	117 ms 40,288 KB
testcase_15	AC	161 ms 42,684 KB
testcase_16	AC	121 ms 40,328 KB
testcase_17	AC	131 ms 40,160 KB
testcase_18	AC	308 ms 41,784 KB
testcase_19	AC	192 ms 41,748 KB
testcase_20	AC	294 ms 41,852 KB
testcase_21	AC	210 ms 41,596 KB
testcase_22	AC	239 ms 41,580 KB
testcase_23	AC	280 ms 41,736 KB
testcase_24	AC	235 ms 41,908 KB
testcase_25	AC	260 ms 41,656 KB
testcase_26	AC	250 ms 42,028 KB
testcase_27	AC	243 ms 40,784 KB
testcase_28	RE	-
testcase_29	AC	843 ms 43,748 KB
testcase_30	AC	855 ms 43,596 KB
testcase_31	AC	1,243 ms 44,792 KB
testcase_32	AC	993 ms 45,320 KB
testcase_33	AC	898 ms 44,020 KB
testcase_34	AC	1,108 ms 45,700 KB
testcase_35	AC	1,342 ms 44,840 KB
testcase_36	AC	1,958 ms 59,672 KB
testcase_37	AC	515 ms 43,576 KB
testcase_38	AC	1,195 ms 44,248 KB
testcase_39	AC	662 ms 43,432 KB
testcase_40	AC	874 ms 44,000 KB
testcase_41	AC	1,074 ms 44,716 KB
testcase_42	AC	1,628 ms 46,620 KB
testcase_43	AC	1,005 ms 44,736 KB
testcase_44	AC	1,269 ms 45,196 KB
testcase_45	AC	1,262 ms 44,768 KB
testcase_46	AC	1,339 ms 46,068 KB
testcase_47	AC	646 ms 43,740 KB
testcase_48	TLE	-
testcase_49	AC	1,350 ms 50,744 KB
testcase_50	AC	1,558 ms 61,624 KB
testcase_51	TLE	-
testcase_52	TLE	-
testcase_53	AC	1,933 ms 59,940 KB
testcase_54	AC	1,918 ms 59,988 KB
testcase_55	TLE	-
testcase_56	TLE	-
testcase_57	AC	1,689 ms 48,184 KB
testcase_58	AC	1,114 ms 48,464 KB
testcase_59	AC	1,098 ms 48,716 KB
testcase_60	AC	1,193 ms 48,888 KB
testcase_61	AC	1,187 ms 48,060 KB
testcase_62	AC	1,215 ms 48,568 KB
testcase_63	RE	-
testcase_64	RE	-
testcase_65	RE	-
testcase_66	RE	-
testcase_67	RE	-
testcase_68	RE	-
testcase_69	RE	-
testcase_70	AC	110 ms 40,340 KB
testcase_71	AC	101 ms 39,840 KB
testcase_72	AC	96 ms 38,744 KB
testcase_73	RE	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

package contest210122;
import java.io.*;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Queue;

public class E {
	InputStream is;
	FastWriter out;

	// -5 -2
	// 4 3
	// 0 -4
	// -3 -5

	String INPUT = "";

	long[] make(int[] a, int[] b)
	{
		int K = a.length, L = b.length;
		long[] ab = new long[K*L];
		int p = 0;
		for(int i = 0;i < K;i++){
			for(int j = 0;j < L;j++){
				ab[p++] = (long)a[i] * b[j];
			}
		}
		Arrays.sort(ab);
		return ab;
	}

	public void solve()
	{
		int K = ni(), L = ni(), M = ni(), N = ni();
		long S = nl();
		int[] a = na(K);
		int[] b = na(L);
		int[] c = na(M);
		int[] d = na(N);
		long[] ab = make(a, b);
		long[] cd = make(c, d);
		long low = Long.MIN_VALUE / 3, high = Long.MAX_VALUE / 3;
		while(high - low > 1){
			long h = high+low>>1;
			// #(<=h)
			long lower = 0;
			if(h >= 0) {
				for (long v : ab) {
					if(v > 0) {
						lower += lowerBound(cd, h / v + 1);
					}else if(v == 0){
						lower += M*N;
					}else{
						// v*? <= h
						lower += M*N - lowerBound(cd, h/v);
					}
				}
			}else{
				// v*? <= h
				for (long v : ab) {
					if(v > 0){
						lower += lowerBound(cd, (h-v+1)/v+1);
					}else if(v < 0){
						lower += M*N - lowerBound(cd, (h+v+1)/v);
					}
				}
			}
//			tr(h, lower, ab, cd);
			if(lower < S){
				low = h;
			}else{
				high = h;
			}
		}
		out.println(high);

		long abv = -1, cdv = -1;
		for(int i = 0;i < K*L;i++){
			long v = ab[i];
			if(high % v == 0){
				int ind = lowerBound(cd, high/v);
				if(ind < cd.length && cd[ind] == high/v){
					abv = v;
					cdv = high/v;
					break;
				}
			}
		}

		out:
		for(int i = 0;i < K;i++){
			for(int j = 0;j < L;j++){
				if(a[i] * b[j] == abv){
					out.print(a[i] + " " + b[j] + " ");
					break out;
				}
			}
		}
		out:
		for(int i = 0;i < M;i++){
			for(int j = 0;j < N;j++){
				if(c[i] * d[j] == cdv){
					out.println(c[i] + " " + d[j]);
					break out;
				}
			}
		}
	}

	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;
	}


	public static void main(String[] args) {
		new E().run();
	}

	public void run()
	{
		long S = System.currentTimeMillis();
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new FastWriter(System.out);

		solve();
		out.flush();
		long G = System.currentTimeMillis();
		tr(G-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();
	}

	private boolean eof()
	{
		if(lenbuf == -1)return true;
		int lptr = ptrbuf;
		while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;

		try {
			is.mark(1000);
			while(true){
				int b = is.read();
				if(b == -1){
					is.reset();
					return true;
				}else if(!isSpaceChar(b)){
					is.reset();
					return false;
				}
			}
		} catch (IOException e) {
			return true;
		}
	}

	private final 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 boolean isSpaceChar(int c) { return !(c >= 32 && 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))){
			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 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[] 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 int ni()
	{
		int num = 0, 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 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();
		}
	}

	public static class FastWriter
	{
		private static final int BUF_SIZE = 1<<13;
		private final byte[] buf = new byte[BUF_SIZE];
		private final OutputStream out;
		private int ptr = 0;

		private FastWriter(){out = null;}

		public FastWriter(OutputStream os)
		{
			this.out = os;
		}

		public FastWriter(String path)
		{
			try {
				this.out = new FileOutputStream(path);
			} catch (FileNotFoundException e) {
				throw new RuntimeException("FastWriter");
			}
		}

		public FastWriter write(byte b)
		{
			buf[ptr++] = b;
			if(ptr == BUF_SIZE)innerflush();
			return this;
		}

		public FastWriter write(char c)
		{
			return write((byte)c);
		}

		public FastWriter write(char[] s)
		{
			for(char c : s){
				buf[ptr++] = (byte)c;
				if(ptr == BUF_SIZE)innerflush();
			}
			return this;
		}

		public FastWriter write(String s)
		{
			s.chars().forEach(c -> {
				buf[ptr++] = (byte)c;
				if(ptr == BUF_SIZE)innerflush();
			});
			return this;
		}

		private static int countDigits(int l) {
			if (l >= 1000000000) return 10;
			if (l >= 100000000) return 9;
			if (l >= 10000000) return 8;
			if (l >= 1000000) return 7;
			if (l >= 100000) return 6;
			if (l >= 10000) return 5;
			if (l >= 1000) return 4;
			if (l >= 100) return 3;
			if (l >= 10) return 2;
			return 1;
		}

		public FastWriter write(int x)
		{
			if(x == Integer.MIN_VALUE){
				return write((long)x);
			}
			if(ptr + 12 >= BUF_SIZE)innerflush();
			if(x < 0){
				write((byte)'-');
				x = -x;
			}
			int d = countDigits(x);
			for(int i = ptr + d - 1;i >= ptr;i--){
				buf[i] = (byte)('0'+x%10);
				x /= 10;
			}
			ptr += d;
			return this;
		}

		private static int countDigits(long l) {
			if (l >= 1000000000000000000L) return 19;
			if (l >= 100000000000000000L) return 18;
			if (l >= 10000000000000000L) return 17;
			if (l >= 1000000000000000L) return 16;
			if (l >= 100000000000000L) return 15;
			if (l >= 10000000000000L) return 14;
			if (l >= 1000000000000L) return 13;
			if (l >= 100000000000L) return 12;
			if (l >= 10000000000L) return 11;
			if (l >= 1000000000L) return 10;
			if (l >= 100000000L) return 9;
			if (l >= 10000000L) return 8;
			if (l >= 1000000L) return 7;
			if (l >= 100000L) return 6;
			if (l >= 10000L) return 5;
			if (l >= 1000L) return 4;
			if (l >= 100L) return 3;
			if (l >= 10L) return 2;
			return 1;
		}

		public FastWriter write(long x)
		{
			if(x == Long.MIN_VALUE){
				return write("" + x);
			}
			if(ptr + 21 >= BUF_SIZE)innerflush();
			if(x < 0){
				write((byte)'-');
				x = -x;
			}
			int d = countDigits(x);
			for(int i = ptr + d - 1;i >= ptr;i--){
				buf[i] = (byte)('0'+x%10);
				x /= 10;
			}
			ptr += d;
			return this;
		}

		public FastWriter write(double x, int precision)
		{
			if(x < 0){
				write('-');
				x = -x;
			}
			x += Math.pow(10, -precision)/2;
			//		if(x < 0){ x = 0; }
			write((long)x).write(".");
			x -= (long)x;
			for(int i = 0;i < precision;i++){
				x *= 10;
				write((char)('0'+(int)x));
				x -= (int)x;
			}
			return this;
		}

		public FastWriter writeln(char c){
			return write(c).writeln();
		}

		public FastWriter writeln(int x){
			return write(x).writeln();
		}

		public FastWriter writeln(long x){
			return write(x).writeln();
		}

		public FastWriter writeln(double x, int precision){
			return write(x, precision).writeln();
		}

		public FastWriter write(int... xs)
		{
			boolean first = true;
			for(int x : xs) {
				if (!first) write(' ');
				first = false;
				write(x);
			}
			return this;
		}

		public FastWriter write(long... xs)
		{
			boolean first = true;
			for(long x : xs) {
				if (!first) write(' ');
				first = false;
				write(x);
			}
			return this;
		}

		public FastWriter writeln()
		{
			return write((byte)'\n');
		}

		public FastWriter writeln(int... xs)
		{
			return write(xs).writeln();
		}

		public FastWriter writeln(long... xs)
		{
			return write(xs).writeln();
		}

		public FastWriter writeln(char[] line)
		{
			return write(line).writeln();
		}

		public FastWriter writeln(char[]... map)
		{
			for(char[] line : map)write(line).writeln();
			return this;
		}

		public FastWriter writeln(String s)
		{
			return write(s).writeln();
		}

		private void innerflush()
		{
			try {
				out.write(buf, 0, ptr);
				ptr = 0;
			} catch (IOException e) {
				throw new RuntimeException("innerflush");
			}
		}

		public void flush()
		{
			innerflush();
			try {
				out.flush();
			} catch (IOException e) {
				throw new RuntimeException("flush");
			}
		}

		public FastWriter print(byte b) { return write(b); }
		public FastWriter print(char c) { return write(c); }
		public FastWriter print(char[] s) { return write(s); }
		public FastWriter print(String s) { return write(s); }
		public FastWriter print(int x) { return write(x); }
		public FastWriter print(long x) { return write(x); }
		public FastWriter print(double x, int precision) { return write(x, precision); }
		public FastWriter println(char c){ return writeln(c); }
		public FastWriter println(int x){ return writeln(x); }
		public FastWriter println(long x){ return writeln(x); }
		public FastWriter println(double x, int precision){ return writeln(x, precision); }
		public FastWriter print(int... xs) { return write(xs); }
		public FastWriter print(long... xs) { return write(xs); }
		public FastWriter println(int... xs) { return writeln(xs); }
		public FastWriter println(long... xs) { return writeln(xs); }
		public FastWriter println(char[] line) { return writeln(line); }
		public FastWriter println(char[]... map) { return writeln(map); }
		public FastWriter println(String s) { return writeln(s); }
		public FastWriter println() { return writeln(); }
	}

	public static void trnz(int... o)
	{
		for(int i = 0;i < o.length;i++)if(o[i] != 0)System.out.print(i+":"+o[i]+" ");
		System.out.println();
	}

	// print ids which are 1
	public static void trt(long... o)
	{
		Queue<Integer> stands = new ArrayDeque<>();
		for(int i = 0;i < o.length;i++){
			for(long x = o[i];x != 0;x &= x-1)stands.add(i<<6|Long.numberOfTrailingZeros(x));
		}
		System.out.println(stands);
	}

	public static void tf(boolean... r)
	{
		for(boolean x : r)System.out.print(x?'#':'.');
		System.out.println();
	}

	public static void tf(boolean[]... b)
	{
		for(boolean[] r : b) {
			for(boolean x : r)System.out.print(x?'#':'.');
			System.out.println();
		}
		System.out.println();
	}

	public void tf(long[]... b)
	{
		if(INPUT.length() != 0) {
			for (long[] r : b) {
				for (long x : r) {
					for (int i = 0; i < 64; i++) {
						System.out.print(x << ~i < 0 ? '#' : '.');
					}
				}
				System.out.println();
			}
			System.out.println();
		}
	}

	public void tf(long... b)
	{
		if(INPUT.length() != 0) {
			for (long x : b) {
				for (int i = 0; i < 64; i++) {
					System.out.print(x << ~i < 0 ? '#' : '.');
				}
			}
			System.out.println();
		}
	}

	private void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}

yukicoder

結果

テストケース

ソースコード