結果

問題 No.270 next_permutation (1)
ユーザー uwiuwi
提出日時 2015-08-22 02:28:02
言語 Java21
(openjdk 21)
結果
AC  
実行時間 122 ms / 2,000 ms
コード長 4,081 bytes
コンパイル時間 4,535 ms
コンパイル使用メモリ 80,648 KB
実行使用メモリ 40,004 KB
最終ジャッジ日時 2024-06-01 04:42:43
合計ジャッジ時間 6,060 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 55 ms
37,128 KB
testcase_01 AC 72 ms
37,428 KB
testcase_02 AC 70 ms
38,312 KB
testcase_03 AC 56 ms
37,148 KB
testcase_04 AC 72 ms
38,056 KB
testcase_05 AC 81 ms
38,008 KB
testcase_06 AC 84 ms
38,360 KB
testcase_07 AC 64 ms
36,552 KB
testcase_08 AC 67 ms
37,232 KB
testcase_09 AC 94 ms
38,232 KB
testcase_10 AC 115 ms
39,388 KB
testcase_11 AC 122 ms
39,448 KB
testcase_12 AC 121 ms
40,004 KB
testcase_13 AC 103 ms
39,620 KB
testcase_14 AC 113 ms
39,496 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest;

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class Q569 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), K = ni();
		int[] P = na(n);
		int[] b = na(n);
		long s = 0;
		for(int i = 0;i < n;i++){
			s += Math.abs(P[i] - b[i]);
		}
		long ret = 0;
		for(int i = 0;i < K;i++){
			ret += s;
			
			int k;
			for (k = n - 2; k >= 0 && P[k] >= P[k + 1]; k--)
				;
			if (k == -1){
				s = 0;
				for(int j = 0;j < n;j++){
					P[j] = j+1;
					s += Math.abs(P[j] - b[j]);
				}
				continue;
			}
			int j;
			for (j = k + 1; j < n && P[k] < P[j]; j++)
				;
			s -= Math.abs(P[k] - b[k]);
			s -= Math.abs(P[j-1] - b[j-1]);
			int d = P[k];
			P[k] = P[j - 1];
			P[j - 1] = d;
			s += Math.abs(P[k] - b[k]);
			s += Math.abs(P[j-1] - b[j-1]);
			for (int p = k + 1, q = n - 1; p < q; p++, q--) {
				s -= Math.abs(P[p] - b[p]);
				s -= Math.abs(P[q] - b[q]);
				d = P[p];
				P[p] = P[q];
				P[q] = d;
				s += Math.abs(P[p] - b[p]);
				s += Math.abs(P[q] - b[q]);
			}
		}
		out.println(ret);
	}
	
	public static boolean nextPermutation(int[] a) {
		int n = a.length;
		int i;
		for (i = n - 2; i >= 0 && a[i] >= a[i + 1]; i--)
			;
		if (i == -1)
			return false;
		int j;
		for (j = i + 1; j < n && a[i] < a[j]; j++)
			;
		int d = a[i];
		a[i] = a[j - 1];
		a[j - 1] = d;
		for (int p = i + 1, q = n - 1; p < q; p++, q--) {
			d = a[p];
			a[p] = a[q];
			a[q] = d;
		}
		return true;
	}
	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
	}
	
	public static void main(String[] args) throws Exception { new Q569().run(); }
	
	private byte[] inbuf = new byte[1024];
	private 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 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))){ // when nextLine, (isSpaceChar(b) && 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 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();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0