#707711 (Java21) No.1711 Divide LCM

提出ソース

結果

問題	No.1711 Divide LCM
ユーザー	uwi
提出日時	2021-10-16 00:44:52
言語	Java21 (openjdk 21)
結果	AC
実行時間	2,019 ms / 4,000 ms
コード長	14,531 bytes
コンパイル時間	5,160 ms
コンパイル使用メモリ	94,184 KB
実行使用メモリ	147,404 KB
最終ジャッジ日時	2024-09-17 19:11:03
合計ジャッジ時間	31,379 ms
ジャッジサーバーID （参考情報）	judge4 / judge5

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	113 ms 57,316 KB
testcase_01	AC	115 ms 57,160 KB
testcase_02	AC	105 ms 57,144 KB
testcase_03	AC	165 ms 58,184 KB
testcase_04	AC	208 ms 61,140 KB
testcase_05	AC	344 ms 63,156 KB
testcase_06	AC	225 ms 62,096 KB
testcase_07	AC	288 ms 61,600 KB
testcase_08	AC	266 ms 62,320 KB
testcase_09	AC	346 ms 63,892 KB
testcase_10	AC	272 ms 64,264 KB
testcase_11	AC	488 ms 68,644 KB
testcase_12	AC	241 ms 63,900 KB
testcase_13	AC	140 ms 58,004 KB
testcase_14	AC	201 ms 59,676 KB
testcase_15	AC	212 ms 61,924 KB
testcase_16	AC	149 ms 58,072 KB
testcase_17	AC	193 ms 59,348 KB
testcase_18	AC	516 ms 80,368 KB
testcase_19	AC	498 ms 81,096 KB
testcase_20	AC	505 ms 81,584 KB
testcase_21	AC	690 ms 86,440 KB
testcase_22	AC	2,019 ms 126,688 KB
testcase_23	AC	1,692 ms 147,404 KB
testcase_24	AC	616 ms 82,152 KB
testcase_25	AC	597 ms 77,928 KB
testcase_26	AC	628 ms 79,488 KB
testcase_27	AC	563 ms 80,576 KB
testcase_28	AC	563 ms 77,836 KB
testcase_29	AC	186 ms 59,588 KB
testcase_30	AC	591 ms 82,124 KB
testcase_31	AC	179 ms 58,872 KB
testcase_32	AC	592 ms 83,900 KB
testcase_33	AC	671 ms 84,648 KB
testcase_34	AC	213 ms 61,252 KB
testcase_35	AC	641 ms 80,420 KB
testcase_36	AC	655 ms 78,900 KB
testcase_37	AC	649 ms 78,908 KB
testcase_38	AC	704 ms 84,388 KB
testcase_39	AC	786 ms 86,408 KB
testcase_40	AC	124 ms 57,560 KB
testcase_41	AC	126 ms 57,344 KB
testcase_42	AC	127 ms 57,576 KB
testcase_43	AC	122 ms 57,444 KB
testcase_44	AC	131 ms 57,376 KB

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

ソースコード

raw source code

package contest211015;
import java.io.*;
import java.util.*;
import java.util.function.IntUnaryOperator;
import java.util.function.LongUnaryOperator;

public class E {
	InputStream is;
	FastWriter out;

	String INPUT = "";

	public void solve() {
		int n = ni();
		int[][][] fs = new int[n][][];
		int[] a = new int[n];
		for (int i = 0; i < n; i++) {
			int m = ni();
			int[][] f = new int[m][];
			for (int j = 0; j < m; j++) {
				f[j] = na(2);
			}
			Arrays.sort(f, Comparator.comparingInt(x -> x[0]));
			fs[i] = f;

			int val = 1;
			for (int[] u : f) {
				for (int k = 0; k < u[1]; k++) {
					val = val * u[0];
				}
			}
			a[i] = val;
		}

		int[] es = new int[1000001];
		for (int[][] f : fs) {
			for (int[] u : f) {
				es[u[0]] = Math.max(es[u[0]], u[1]);
			}
		}

		List<Integer> nz = new ArrayList<>();
		for (int i = 0; i <= 1000000; i++) {
			if (es[i] > 0) nz.add(i);
		}

		outer:
		for (int[][] f : fs) {
			if (f.length != nz.size()) continue;
			for (int[] u : f) {
				if (es[u[0]] != u[1]) continue outer;
			}
			out.println(-1);
			return;
		}

		Random gen = new Random();
		long[] zob = new long[nz.size()];
		for (int i = 0; i < nz.size(); i++) {
			zob[i] = gen.nextLong();
		}
		int m = nz.size();

		List<Set<Long>> hey = new ArrayList<>();
		for (int i = 0; i < 11; i++) {
			hey.add(new HashSet<>());
		}
		for (int[][] f : fs) {
			int[] w = new int[f.length];
			int p = 0;
			for (int[] u : f) {
				if(u[1] == es[u[0]]) {
					w[p++] = Collections.binarySearch(nz, u[0]);
				}
			}
			w = Arrays.copyOf(w, p);
			for (int k = 1; k < 1 << p; k++) {
				long h = 0;
				for (int l = 0; l < p; l++) {
					if (k << ~l < 0) {
						h ^= zob[w[l]];
					}
				}
				hey.get(Integer.bitCount(k)).add(h);
			}
		}

		for (int k = 2; k <= 10; k++) {
			long sz = 1;
			for (int i = 0; i < k; i++) {
				sz = sz * (m - i) / (i + 1);
			}
//			tr(sz, hey.get(k).size());
			if (sz > hey.get(k).size()) {
				out.println(k);

				int[] b = new int[k];
				for(int i = 0;i < k;i++)b[i] = i;
				do{
					long h = 0;
					for(int i = 0;i < k;i++){
						h ^= zob[b[i]];
					}
					if(!hey.get(k).contains(h)){
						List<List<Integer>> ans = new ArrayList<>();
						for(int j = 0;j < k;j++){
							ans.add(new ArrayList<>());
						}
						inner:
						for(int i = 0;i < n;i++){
							for(int j = 0;j < k-1;j++) {
								int ind = lowerBound(fs[i], 0, nz.get(b[j]));
								if(ind < fs[i].length && fs[i][ind][0] == nz.get(b[j]) && fs[i][ind][1] == es[nz.get(b[j])]){
								}else{
									ans.get(j).add(a[i]);
									continue inner;
								}
							}
							ans.get(k-1).add(a[i]);
						}

						for(int j = 0;j < k;j++){
							out.print(ans.get(j).size());
							for(int v : ans.get(j)){
								out.print(" ").print(v);
							}
							out.println();
						}
						return;
					}
				}while(incAscending(b, m, true));
				throw new RuntimeException();
			}
		}
		out.println(-1);
//		throw new RuntimeException();
	}

	public static boolean incAscending(int[] a, int base, boolean strict)
	{
		int n = a.length;
		for(int i = n-1;i >= 0;i--){
			if(++a[i] + (strict ? n-1-i : 0) < base){
				for(int j = i+1;j < n;j++)a[j] = a[j-1] + (strict ? 1 : 0);
				return true;
			}
		}
		return false;
	}



	public static int lowerBound(int[][] a, int ind, int v)
	{
		int low = -1, high = a.length;
		while(high-low > 1){
			int h = high+low>>>1;
			if(a[h][ind] >= 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 write(IntUnaryOperator f, int... xs)
		{
			boolean first = true;
			for(int x : xs) {
				if (!first) write(' ');
				first = false;
				write(f.applyAsInt(x));
			}
			return this;
		}

		public FastWriter write(LongUnaryOperator f, long... xs)
		{
			boolean first = true;
			for(long x : xs) {
				if (!first) write(' ');
				first = false;
				write(f.applyAsLong(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(IntUnaryOperator f, int... xs) { return write(f, xs).writeln(); }
		public FastWriter writeln(LongUnaryOperator f, long... xs) { return write(f, 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 print(IntUnaryOperator f, int... xs) { return write(f, xs); }
		public FastWriter print(LongUnaryOperator f, long... xs) { return write(f, xs); }
		public FastWriter println(int... xs) { return writeln(xs); }
		public FastWriter println(long... xs) { return writeln(xs); }
		public FastWriter println(IntUnaryOperator f, int... xs) { return writeln(f, xs); }
		public FastWriter println(LongUnaryOperator f, long... xs) { return writeln(f, 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

結果

テストケース

ソースコード