#684348 (Java21) No.1634 Sorting Integers (Multiple of K) Hard

提出ソース

結果

問題	No.1634 Sorting Integers (Multiple of K) Hard
ユーザー	uwi
提出日時	2021-07-30 21:30:51
言語	Java21 (openjdk 21)
結果	AC
実行時間	2,603 ms / 3,000 ms
コード長	14,855 bytes
コンパイル時間	9,091 ms
コンパイル使用メモリ	88,972 KB
実行使用メモリ	57,244 KB
最終ジャッジ日時	2023-10-14 03:38:16
合計ジャッジ時間	65,623 ms
ジャッジサーバーID （参考情報）	judge14 / judge12

このコードへのチャレンジ（β）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	68 ms 50,436 KB
testcase_01	AC	70 ms 50,304 KB
testcase_02	AC	69 ms 50,396 KB
testcase_03	AC	110 ms 53,396 KB
testcase_04	AC	1,242 ms 52,936 KB
testcase_05	AC	1,245 ms 53,240 KB
testcase_06	AC	1,406 ms 55,956 KB
testcase_07	AC	1,245 ms 53,000 KB
testcase_08	AC	2,311 ms 54,844 KB
testcase_09	AC	72 ms 50,320 KB
testcase_10	AC	70 ms 50,576 KB
testcase_11	AC	2,570 ms 56,504 KB
testcase_12	AC	2,599 ms 56,860 KB
testcase_13	AC	2,518 ms 56,312 KB
testcase_14	AC	2,483 ms 57,244 KB
testcase_15	AC	2,480 ms 56,948 KB
testcase_16	AC	2,511 ms 56,524 KB
testcase_17	AC	2,128 ms 56,368 KB
testcase_18	AC	2,107 ms 56,332 KB
testcase_19	AC	2,303 ms 56,560 KB
testcase_20	AC	742 ms 56,504 KB
testcase_21	AC	649 ms 56,172 KB
testcase_22	AC	2,024 ms 56,412 KB
testcase_23	AC	2,278 ms 56,520 KB
testcase_24	AC	2,452 ms 56,668 KB
testcase_25	AC	2,538 ms 56,516 KB
testcase_26	AC	2,603 ms 56,780 KB
testcase_27	AC	2,524 ms 56,500 KB
testcase_28	AC	2,525 ms 56,332 KB
testcase_29	AC	2,530 ms 56,396 KB
testcase_30	AC	2,489 ms 56,296 KB
testcase_31	AC	2,558 ms 56,352 KB

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

ソースコード

raw source code

package contest210730;

import java.io.*;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Queue;
import java.util.function.IntUnaryOperator;
import java.util.function.LongUnaryOperator;

public class G2 {
	InputStream is;
	FastWriter out;

	String INPUT = "";

	public void solve()
	{
		int n = ni(), K = ni();
		int[] a = na(9);
		int[] b = new int[n];
		int p = 0;
		for(int i = 0;i < 9;i++){
			for(int j = 0;j < a[i];j++){
				b[p++] = i+1;
			}
		}
		assert p == n;

		int h = n/2;
		for(int i = 0;i < 1<<n;i++){
			if(Integer.bitCount(i) == h){
				go(i, h, n, b, K);
			}
		}

		for(int i = 0;i < 9;i++){
			for(int j = 0;j < a[i];j++){
				ans /= j+1;
			}
		}
		out.println(ans);
	}

	void go(int ptn, int h, int n, int[] b, int K)
	{
		LongHashMapWithoutDeletion L = new LongHashMapWithoutDeletion();
		dfs(0, ptn, b, L, K);
		LongHashMapWithoutDeletion R = new LongHashMapWithoutDeletion();
		dfs(0, (1<<n)-1^ptn, b, R, K);
		long th = pow(10, n-h, K);
		for(int z = 0;z < L.size;z++){
			long key = L.keys[z];
			long base = -key * th % K;
			if(base < 0)base += K;
			int u = (int)base;
			if(R.containsKey(u)) {
				ans += (long)R.get(u) * L.get(key);
			}
		}
	}

	void dfs(int cur, int ptn, int[] b, LongHashMapWithoutDeletion L, int K)
	{
		if(ptn == 0){
			L.merge(cur, 1);
			return;
		}
		int optn = ptn;
		for(;ptn > 0;ptn &= ptn-1){
			int i = Integer.numberOfTrailingZeros(ptn);
			int nex = (cur * 10 + b[i]) % K;
			dfs(nex, optn^1<<i, b, L, K);
		}
	}

	public static class LongHashMapWithoutDeletion
	{
		int[] first;
		int[] next;
		long[] keys;
		int[] vals;
		int size;
		int scale;

		public LongHashMapWithoutDeletion()
		{
			scale = 1;
			keys = new long[1<<scale];
			vals = new int[1<<scale];
			first = new int[1<<scale];
			next = new int[1<<scale];
			size = 0;
			Arrays.fill(first, -1);
			Arrays.fill(next, -1);
		}

		public void rehash()
		{
			scale++;
			keys = Arrays.copyOf(keys, 1<<scale);
			vals = Arrays.copyOf(vals, 1<<scale);
			first = new int[1<<scale];
			next = new int[1<<scale];
			Arrays.fill(first, -1);
			Arrays.fill(next, -1);
			for(int i = 0;i < 1<<scale-1;i++){
				int h = h(keys[i])&(1<<scale)-1;
				next[i] = first[h];
				first[h] = i;
			}
		}

		public void put(long key, int val)
		{
			int h = h(key)&(1<<scale)-1;
			int ind = search(h, key);
			if(ind >= keys.length){
				rehash();
				h = h(key)&(1<<scale)-1;
			}
			if(ind < size){
				vals[ind] = val;
			}else {
				keys[ind] = key;
				vals[ind] = val;
				next[ind] = first[h];
				first[h] = ind;
				size++;
			}
		}

		public void merge(long key, int val)
		{
			int h = h(key)&(1<<scale)-1;
			int ind = search(h, key);
			if(ind >= keys.length){
				rehash();
				h = h(key)&(1<<scale)-1;
			}
			if(ind < size){
				vals[ind] += val;
			}else {
				keys[ind] = key;
				vals[ind] = val;
				next[ind] = first[h];
				first[h] = ind;
				size++;
			}
		}

		public boolean containsKey(long key)
		{
			int h = h(key)&(1<<scale)-1;
			int ind = search(h, key);
			return ind < size;
		}

		public int get(long key)
		{
			int h = h(key)&(1<<scale)-1;
			int ind = search(h, key);
			return ind >= size ? 0 : vals[ind];
		}

		private int search(int h, long key)
		{
			for(int f = first[h];f != -1;f = next[f]){
				if(keys[f] == key)return f;
			}
			return size;
		}

		private int h(long x)
		{
			x ^= x>>>33;
			x *= 0xff51afd7ed558ccdL;
			x ^= x>>>33;
			x *= 0xc4ceb9fe1a85ec53L;
			x ^= x>>>33;
			return (int)(x^x>>>32);
		}
	}

	long ans;

	public static long pow(long a, long n, long mod) {
		//		a %= mod;
		long ret = 1;
		int x = 63 - Long.numberOfLeadingZeros(n);
		for (; x >= 0; x--) {
			ret = ret * ret % mod;
			if (n << 63 - x < 0) ret = ret * a % mod;
		}
		return ret;
	}


	public static void main(String[] args) {
		new G2().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

結果

テストケース

ソースコード