結果

問題 No.270 next_permutation (1)
ユーザー tanzakutanzaku
提出日時 2015-08-22 00:20:20
言語 Java21
(openjdk 21)
結果
AC  
実行時間 191 ms / 2,000 ms
コード長 6,486 bytes
コンパイル時間 2,912 ms
コンパイル使用メモリ 88,244 KB
実行使用メモリ 42,780 KB
最終ジャッジ日時 2024-12-18 02:37:18
合計ジャッジ時間 5,485 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 63 ms
38,804 KB
testcase_01 AC 92 ms
38,804 KB
testcase_02 AC 90 ms
38,652 KB
testcase_03 AC 56 ms
37,296 KB
testcase_04 AC 88 ms
38,508 KB
testcase_05 AC 86 ms
38,408 KB
testcase_06 AC 88 ms
38,420 KB
testcase_07 AC 64 ms
37,328 KB
testcase_08 AC 66 ms
37,288 KB
testcase_09 AC 113 ms
41,144 KB
testcase_10 AC 181 ms
42,780 KB
testcase_11 AC 191 ms
42,732 KB
testcase_12 AC 190 ms
42,728 KB
testcase_13 AC 183 ms
42,564 KB
testcase_14 AC 175 ms
42,616 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

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) {
			int N = io.nextInt();
			int K = io.nextInt();
			int[] xs = io.nextIntArray(N);
			long[] B = io.nextLongArray(N);
			long ans = 0;
			long cur = 0;
			if(K > 0)
			for(int i = 0; i < N; i++) {
				long v = Math.abs(xs[i] - B[i]);
				cur += v;
				ans += v;
			}
//			System.err.println(cur + " " + ans + " " + Arrays.toString(xs));
			for(int t = 0; t < K - 1; t++) {
				boolean ok = false;
				for(int i = xs.length - 1; i > 0; i--) {
					if(xs[i - 1] > xs[i]) {
						continue;
					}

					for(int j = i, k = xs.length - 1; j < k; j++, k--) {
						cur -= Math.abs(xs[j] - B[j]) + Math.abs(xs[k] - B[k]);
						swap(xs, j, k);
						cur += Math.abs(xs[j] - B[j]) + Math.abs(xs[k] - B[k]);
					}

					for(int j = i; j < xs.length; j++) if(xs[j] > xs[i - 1]) {
						cur -= Math.abs(xs[j] - B[j]) + Math.abs(xs[i - 1] - B[i - 1]);
						swap(xs, j, i - 1);
						cur += Math.abs(xs[j] - B[j]) + Math.abs(xs[i - 1] - B[i - 1]);
						break;
					}
					
					ok = true;
					break;
				}
				if(!ok) {
					for(int i = 0; i <= N / 2; i++) {
						cur -= Math.abs(xs[i] - B[i]) + Math.abs(xs[N-1-i] - B[N-1-i]);
						swap(xs, i, N-1-i);
						cur += Math.abs(xs[i] - B[i]) + Math.abs(xs[N-1-i] - B[N-1-i]);
					}
				}
				ans += cur;
//				System.err.println(cur + " " + ans + " " + Arrays.toString(xs));
			}
			io.out.println(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; }
	
	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