結果

問題 No.443 GCD of Permutation
ユーザー tanzakutanzaku
提出日時 2016-11-11 22:39:05
言語 Java21
(openjdk 21)
結果
WA  
(最新)
AC  
(最初)
実行時間 -
コード長 7,010 bytes
コンパイル時間 2,412 ms
コンパイル使用メモリ 84,056 KB
実行使用メモリ 50,808 KB
最終ジャッジ日時 2024-05-04 10:04:55
合計ジャッジ時間 9,596 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 48 ms
37,040 KB
testcase_01 AC 47 ms
37,448 KB
testcase_02 AC 47 ms
36,968 KB
testcase_03 AC 47 ms
37,484 KB
testcase_04 AC 52 ms
36,956 KB
testcase_05 AC 49 ms
36,940 KB
testcase_06 AC 46 ms
37,052 KB
testcase_07 AC 48 ms
37,084 KB
testcase_08 AC 46 ms
37,452 KB
testcase_09 AC 47 ms
36,944 KB
testcase_10 AC 46 ms
37,472 KB
testcase_11 AC 47 ms
37,164 KB
testcase_12 AC 48 ms
37,328 KB
testcase_13 AC 51 ms
37,480 KB
testcase_14 AC 52 ms
37,472 KB
testcase_15 AC 207 ms
43,236 KB
testcase_16 AC 155 ms
41,296 KB
testcase_17 AC 151 ms
41,812 KB
testcase_18 AC 502 ms
48,356 KB
testcase_19 AC 158 ms
41,472 KB
testcase_20 AC 461 ms
48,636 KB
testcase_21 AC 216 ms
42,892 KB
testcase_22 AC 51 ms
37,376 KB
testcase_23 AC 51 ms
37,228 KB
testcase_24 WA -
testcase_25 AC 534 ms
48,648 KB
testcase_26 AC 502 ms
48,332 KB
testcase_27 AC 258 ms
43,728 KB
testcase_28 AC 220 ms
43,032 KB
testcase_29 AC 541 ms
48,624 KB
testcase_30 AC 553 ms
48,280 KB
testcase_31 AC 547 ms
48,528 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.math.*;
import java.util.*;
import java.util.Map.Entry;

import static java.util.Arrays.*;

public class Main {
	private static final int mod = (int)1e9+7;

	final Random random = new Random(0);
	final IOFast io = new IOFast();

	/// MAIN CODE
	public void run() throws IOException {
//		int TEST_CASE = Integer.parseInt(new String(io.nextLine()).trim());
		int TEST_CASE = 1;
		while(TEST_CASE-- != 0) {
			cnt = new int[10];
			char[] cs = io.next();
			int n = 0;
			for (char c : cs) {
				cnt[c - '0']++;
				n++;
			}
			
			if (n < 10) {
				io.out.println(dfs(0));
				return;
			}
			int c = 0;
			for (int i = 0; i < cnt.length; i++) {
				if (cnt[i] > 0) c++;
			}
			
			if (c == 1) {
				io.out.println(new String(cs));
				return;
			}
			
//			long g = 0;
//			for (int i = 0; i < cnt.length; i++) {
//				if (cnt[i] > 0) g = gcd(i, g);
//			}
			
			BigInteger g = BigInteger.ZERO;
			for (int i = 0; i < 10; i++) {
				shuffle2(i, cs);
				g = g.gcd(new BigInteger(new String(cs)));
			}
			
			for (int i = 0; i < 100; i++) {
				shuffle2(-1, cs);
				g = g.gcd(new BigInteger(new String(cs)));
			}
			
			io.out.println(g);
		}
	}
	
//	long gcd(char[] cs, long g) {
//		long x = 0;
//		for (int j = 0; j < cs.length; j++) {
//			x = x * 10 + cs[j] - '0';
//			if (x >= g && g != 0) x %= g;
//		}
//		return gcd(x, g);
//	}
	
	boolean shuffle2(int x, char[] cs) {
		if (x >= 0 && cnt[x] == 0) {
			return false;
		}
		
		for (int j = 1; j + 1 < cs.length; j++) {
			if (cs[j] == x + '0') {
				swap(cs, j, cs.length - 1);
			}
			int k = random.nextInt(j + 1);
			swap(cs, k, j);
		}
		
		return true;
	}
	
	int[] cnt;
	long dfs(long v) {
		long ans = 0;
		for(int i = 0; i < cnt.length; i++) {
			if (cnt[i] > 0) {
				cnt[i]--;
				ans = gcd(dfs(v * 10 + i), ans);
				cnt[i]++;
			}
		}
		if (ans == 0) ans = v;
		return ans;
	}
	
	/// TEMPLATE
	static int gcd(int n, int r) { return r == 0 ? n : gcd(r, n%r); }
	static long gcd(long n, long r) { return r == 0 ? n : gcd(r, n%r); }
	
	static <T> void swap(T[] x, int i, int j) { T t = x[i]; x[i] = x[j]; x[j] = t; }
	static void swap(int[] x, int i, int j) { int t = x[i]; x[i] = x[j]; x[j] = t; }
	static void swap(char[] x, int i, int j) { char t = x[i]; x[i] = x[j]; x[j] = t; }

	void printArrayLn(int[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?"\n":" ")); }
	void printArrayLn(long[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?"\n":" ")); }
	
	static void dump(Object... o) { System.err.println(Arrays.deepToString(o)); } 
	
	void main() throws IOException {
		//		IOFast.setFileIO("rle-size.in", "rle-size.out");
		try { run(); }
		catch (EndOfFileRuntimeException e) { }
		io.out.flush();
	}
	public static void main(String[] args) throws IOException { new Main().main(); }
	
	static class EndOfFileRuntimeException extends RuntimeException {
		private static final long serialVersionUID = -8565341110209207657L; }

	static
	public class IOFast {
		private BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		private PrintWriter out = new PrintWriter(System.out);

		void setFileIn(String ins) throws IOException { in.close(); in = new BufferedReader(new FileReader(ins)); }
		void setFileOut(String outs) throws IOException { out.flush(); out.close(); out = new PrintWriter(new FileWriter(outs)); }
		void setFileIO(String ins, String outs) throws IOException { setFileIn(ins); setFileOut(outs); }

		private static int pos, readLen;
		private static final char[] buffer = new char[1024 * 8];
		private static char[] str = new char[500*8*2];
		private static boolean[] isDigit = new boolean[256];
		private static boolean[] isSpace = new boolean[256];
		private static boolean[] isLineSep = new boolean[256];

		static { for(int i = 0; i < 10; i++) { isDigit['0' + i] = true; } isDigit['-'] = true; isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true; isLineSep['\r'] = isLineSep['\n'] = true; }
		public int read() throws IOException { if(pos >= readLen) { pos = 0; readLen = in.read(buffer); if(readLen <= 0) { throw new EndOfFileRuntimeException(); } } return buffer[pos++]; }
		public int nextInt() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; int ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
		public long nextLong() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; long ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
		public char nextChar() throws IOException { while(true) { final int c = read(); if(!isSpace[c]) { return (char)c; } } }
		int reads(int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } if(str.length == len) { char[] rep = new char[str.length * 3 / 2]; System.arraycopy(str, 0, rep, 0, str.length); str = rep; } str[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
		int reads(char[] cs, int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } cs[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
		public char[] nextLine() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isLineSep); try { if(str[len-1] == '\r') { len--; read(); } } catch(EndOfFileRuntimeException e) { ; } return Arrays.copyOf(str, len); }
		public String nextString() throws IOException { return new String(next()); }
		public char[] next() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); return Arrays.copyOf(str, len); }
//		public int next(char[] cs) throws IOException { int len = 0; cs[len++] = nextChar(); len = reads(cs, len, isSpace); return len; }
		public double nextDouble() throws IOException { return Double.parseDouble(nextString()); }
		public long[] nextLongArray(final int n) throws IOException { final long[] res = new long[n]; for(int i = 0; i < n; i++) { res[i] = nextLong(); } return res; }
		public int[] nextIntArray(final int n) throws IOException { final int[] res = new int[n]; for(int i = 0; i < n; i++) { res[i] = nextInt(); } return res; }
		public int[][] nextIntArray2D(final int n, final int k) throws IOException { final int[][] res = new int[n][]; for(int i = 0; i < n; i++) { res[i] = nextIntArray(k); } return res; }
		public int[][] nextIntArray2DWithIndex(final int n, final int k) throws IOException { final int[][] res = new int[n][k+1]; for(int i = 0; i < n; i++) { for(int j = 0; j < k; j++) { res[i][j] = nextInt(); } res[i][k] = i; } return res; }
		public double[] nextDoubleArray(final int n) throws IOException { final double[] res = new double[n]; for(int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; }
	}
}
0