結果

問題 No.1361 [Zelkova 4th Tune *] QUADRUPLE-SEQUENCEの詩
ユーザー uwiuwi
提出日時 2021-01-22 23:28:47
言語 Java19
(openjdk 21)
結果
AC  
実行時間 1,806 ms / 2,000 ms
コード長 13,065 bytes
コンパイル時間 5,437 ms
コンパイル使用メモリ 89,300 KB
実行使用メモリ 64,624 KB
最終ジャッジ日時 2023-08-27 22:54:12
合計ジャッジ時間 58,472 ms
ジャッジサーバーID
(参考情報)
judge13 / judge12
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 89 ms
53,088 KB
testcase_01 AC 93 ms
53,456 KB
testcase_02 AC 92 ms
52,932 KB
testcase_03 AC 96 ms
54,128 KB
testcase_04 AC 92 ms
53,928 KB
testcase_05 AC 93 ms
54,468 KB
testcase_06 AC 93 ms
53,980 KB
testcase_07 AC 91 ms
51,104 KB
testcase_08 AC 106 ms
53,348 KB
testcase_09 AC 101 ms
52,968 KB
testcase_10 AC 115 ms
53,384 KB
testcase_11 AC 106 ms
53,356 KB
testcase_12 AC 108 ms
52,916 KB
testcase_13 AC 115 ms
52,952 KB
testcase_14 AC 100 ms
53,280 KB
testcase_15 AC 122 ms
53,344 KB
testcase_16 AC 124 ms
53,268 KB
testcase_17 AC 115 ms
53,040 KB
testcase_18 AC 244 ms
56,236 KB
testcase_19 AC 221 ms
58,260 KB
testcase_20 AC 270 ms
56,416 KB
testcase_21 AC 238 ms
57,040 KB
testcase_22 AC 230 ms
56,056 KB
testcase_23 AC 296 ms
59,212 KB
testcase_24 AC 282 ms
59,496 KB
testcase_25 AC 284 ms
59,464 KB
testcase_26 AC 297 ms
59,320 KB
testcase_27 AC 244 ms
56,740 KB
testcase_28 AC 904 ms
61,432 KB
testcase_29 AC 686 ms
60,584 KB
testcase_30 AC 725 ms
60,980 KB
testcase_31 AC 915 ms
60,780 KB
testcase_32 AC 1,141 ms
61,980 KB
testcase_33 AC 748 ms
61,024 KB
testcase_34 AC 932 ms
62,080 KB
testcase_35 AC 989 ms
61,220 KB
testcase_36 AC 1,467 ms
63,788 KB
testcase_37 AC 540 ms
60,964 KB
testcase_38 AC 781 ms
61,652 KB
testcase_39 AC 710 ms
61,040 KB
testcase_40 AC 706 ms
61,048 KB
testcase_41 AC 999 ms
61,936 KB
testcase_42 AC 1,284 ms
62,908 KB
testcase_43 AC 893 ms
61,228 KB
testcase_44 AC 1,097 ms
60,616 KB
testcase_45 AC 907 ms
61,328 KB
testcase_46 AC 1,054 ms
61,012 KB
testcase_47 AC 736 ms
61,212 KB
testcase_48 AC 944 ms
64,624 KB
testcase_49 AC 842 ms
64,560 KB
testcase_50 AC 993 ms
64,076 KB
testcase_51 AC 970 ms
64,368 KB
testcase_52 AC 741 ms
64,128 KB
testcase_53 AC 1,806 ms
63,096 KB
testcase_54 AC 1,696 ms
62,896 KB
testcase_55 AC 1,759 ms
64,020 KB
testcase_56 AC 1,736 ms
63,316 KB
testcase_57 AC 1,412 ms
63,640 KB
testcase_58 AC 954 ms
63,404 KB
testcase_59 AC 957 ms
63,476 KB
testcase_60 AC 921 ms
63,160 KB
testcase_61 AC 917 ms
62,784 KB
testcase_62 AC 956 ms
62,732 KB
testcase_63 AC 309 ms
62,492 KB
testcase_64 AC 302 ms
62,400 KB
testcase_65 AC 333 ms
63,040 KB
testcase_66 AC 320 ms
62,452 KB
testcase_67 AC 323 ms
62,192 KB
testcase_68 AC 105 ms
53,952 KB
testcase_69 AC 107 ms
54,500 KB
testcase_70 AC 113 ms
54,460 KB
testcase_71 AC 108 ms
54,492 KB
testcase_72 AC 94 ms
53,688 KB
testcase_73 AC 108 ms
54,656 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 E2 {
	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 I = 82*10000000000000000L;
		long low = -I, high = I;
		while(high - low > 1){
			long h = high+low>>1;
			// #(<=h)
			long lower = 0;
			if(h >= 0) {
				int p = M*N-1;
				int q = M*N-1;
				for (long v : ab) {
					if(v > 0) {
						while(q >= 0 && cd[q] >= h/v+1){
							q--;
						}
						lower += q+1;
					}else if(v == 0){
						lower += M*N;
					}else{
						while(p >= 0 && cd[p] >= h/v){
							p--;
						}
						// v*? <= h
						lower += M*N - p - 1;
					}
				}
			}else{
				// v*? <= h
				int p = 0;
				int q = 0;
				for (long v : ab) {
					if(v > 0){
						while(q < M*N && cd[q] < (h-v+1)/v+1){
							q++;
						}
						lower += q;
					}else if(v < 0){
						while(p < M*N && cd[p] < (h+v+1)/v){
							p++;
						}
						lower += M*N - p;
					}
				}
			}
//			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 E2().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