結果

問題 No.1361 [Zelkova 4th Tune *] QUADRUPLE-SEQUENCEの詩
ユーザー uwiuwi
提出日時 2021-01-22 23:15:42
言語 Java21
(openjdk 21)
結果
TLE  
実行時間 -
コード長 12,836 bytes
コンパイル時間 9,273 ms
コンパイル使用メモリ 93,716 KB
実行使用メモリ 52,152 KB
最終ジャッジ日時 2024-06-08 17:59:59
合計ジャッジ時間 66,828 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 89 ms
39,908 KB
testcase_01 AC 101 ms
38,936 KB
testcase_02 AC 92 ms
40,264 KB
testcase_03 AC 88 ms
38,540 KB
testcase_04 AC 92 ms
38,808 KB
testcase_05 AC 96 ms
40,152 KB
testcase_06 AC 101 ms
40,192 KB
testcase_07 AC 93 ms
38,720 KB
testcase_08 AC 116 ms
40,628 KB
testcase_09 AC 108 ms
40,204 KB
testcase_10 AC 125 ms
40,752 KB
testcase_11 AC 123 ms
40,564 KB
testcase_12 AC 113 ms
40,280 KB
testcase_13 AC 131 ms
43,448 KB
testcase_14 AC 106 ms
40,188 KB
testcase_15 AC 127 ms
40,372 KB
testcase_16 AC 113 ms
40,664 KB
testcase_17 AC 122 ms
40,480 KB
testcase_18 AC 270 ms
43,352 KB
testcase_19 AC 190 ms
43,332 KB
testcase_20 AC 293 ms
43,504 KB
testcase_21 AC 213 ms
44,324 KB
testcase_22 AC 239 ms
43,452 KB
testcase_23 AC 265 ms
43,256 KB
testcase_24 AC 272 ms
43,288 KB
testcase_25 AC 264 ms
43,152 KB
testcase_26 AC 289 ms
43,088 KB
testcase_27 AC 254 ms
43,416 KB
testcase_28 AC 1,034 ms
45,848 KB
testcase_29 AC 825 ms
45,276 KB
testcase_30 AC 844 ms
45,320 KB
testcase_31 AC 1,299 ms
46,808 KB
testcase_32 AC 901 ms
47,080 KB
testcase_33 AC 921 ms
45,280 KB
testcase_34 AC 1,137 ms
46,596 KB
testcase_35 AC 1,376 ms
46,012 KB
testcase_36 AC 1,922 ms
47,564 KB
testcase_37 AC 546 ms
44,692 KB
testcase_38 AC 1,101 ms
45,720 KB
testcase_39 AC 710 ms
44,464 KB
testcase_40 AC 873 ms
45,032 KB
testcase_41 AC 1,054 ms
45,912 KB
testcase_42 AC 1,660 ms
48,300 KB
testcase_43 AC 999 ms
45,612 KB
testcase_44 AC 1,190 ms
47,268 KB
testcase_45 AC 1,257 ms
45,676 KB
testcase_46 AC 1,293 ms
46,948 KB
testcase_47 AC 630 ms
44,680 KB
testcase_48 TLE -
testcase_49 AC 1,989 ms
51,840 KB
testcase_50 TLE -
testcase_51 TLE -
testcase_52 AC 1,995 ms
51,768 KB
testcase_53 TLE -
testcase_54 TLE -
testcase_55 TLE -
testcase_56 TLE -
testcase_57 AC 1,481 ms
49,352 KB
testcase_58 AC 1,122 ms
48,924 KB
testcase_59 AC 1,142 ms
48,968 KB
testcase_60 AC 1,281 ms
49,480 KB
testcase_61 AC 1,307 ms
49,712 KB
testcase_62 AC 1,285 ms
49,432 KB
testcase_63 AC 385 ms
50,644 KB
testcase_64 AC 339 ms
50,360 KB
testcase_65 AC 296 ms
49,884 KB
testcase_66 AC 387 ms
50,652 KB
testcase_67 AC 349 ms
50,520 KB
testcase_68 AC 93 ms
40,092 KB
testcase_69 AC 101 ms
40,828 KB
testcase_70 AC 103 ms
40,200 KB
testcase_71 AC 98 ms
40,516 KB
testcase_72 AC 88 ms
40,096 KB
testcase_73 AC 96 ms
40,644 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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;
		if(high != 0) {
			for (int i = 0; i < K * L; i++) {
				long v = ab[i];
				if (v != 0 && 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;
					}
				}
			}
		}else{
			int argi = 0, argj = 0, argk = 0, argl = 0;
			for(int i = 0;i < K;i++){
				if(a[i] == 0)argi = i;
			}
			for(int i = 0;i < L;i++){
				if(b[i] == 0)argj = i;
			}
			for(int i = 0;i < M;i++){
				if(c[i] == 0)argk = i;
			}
			for(int i = 0;i < N;i++){
				if(d[i] == 0)argl = i;
			}
			out.println(a[argi] + " " + b[argj] + " " + c[argk] + " " + d[argl]);
		}
	}

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