結果

問題 No.1650 Moving Coins
ユーザー nishi5451nishi5451
提出日時 2021-08-21 00:12:16
言語 Java21
(openjdk 21)
結果
RE  
実行時間 -
コード長 3,349 bytes
コンパイル時間 2,640 ms
コンパイル使用メモリ 84,116 KB
実行使用メモリ 71,900 KB
最終ジャッジ日時 2024-10-14 08:49:01
合計ジャッジ時間 31,212 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 68 ms
37,792 KB
testcase_01 AC 51 ms
36,808 KB
testcase_02 AC 70 ms
38,152 KB
testcase_03 AC 720 ms
52,184 KB
testcase_04 AC 678 ms
50,840 KB
testcase_05 AC 731 ms
48,008 KB
testcase_06 AC 846 ms
50,976 KB
testcase_07 AC 828 ms
51,572 KB
testcase_08 AC 1,158 ms
64,612 KB
testcase_09 AC 968 ms
52,588 KB
testcase_10 AC 974 ms
54,312 KB
testcase_11 AC 1,153 ms
56,628 KB
testcase_12 AC 978 ms
53,104 KB
testcase_13 AC 966 ms
55,828 KB
testcase_14 AC 1,118 ms
57,436 KB
testcase_15 AC 1,042 ms
55,512 KB
testcase_16 AC 1,135 ms
65,084 KB
testcase_17 AC 1,077 ms
55,060 KB
testcase_18 AC 1,154 ms
67,092 KB
testcase_19 AC 1,345 ms
65,964 KB
testcase_20 AC 1,234 ms
69,500 KB
testcase_21 AC 1,398 ms
68,444 KB
testcase_22 AC 1,331 ms
71,900 KB
testcase_23 AC 1,387 ms
70,540 KB
testcase_24 RE -
testcase_25 AC 770 ms
50,836 KB
testcase_26 AC 151 ms
41,000 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

class Tuple {
	int id, a, b;
	Tuple(int id, int a, int b){
		this.id = id;
		this.a = a;
		this.b = b;
	}
}

public class Main {
	static final int INF = 1<<30;
	static final long INFL = 1L<<60;
	static final int MOD = 1000000007;
	static final int MOD2 = 998244353;
	static List<List<Integer>> g;
	
	public static void main(String[] args) {
		FastScanner fs = new FastScanner();
		// .#.#..##
		// ..####..
		int n = fs.nextInt();
		int[] a = fs.nextInts(n);
		int[] b = fs.nextInts(n);
		Arrays.sort(a);
		Arrays.sort(b);
		long ans = 0;
		for(int i = 0; i < n; i++){
			ans += Math.abs(a[i]-b[i]);
		}
		System.out.println(ans);
		Queue<Integer> que = new ArrayDeque<>();
		for(int i = 0; i < n; i++){
			if(a[i] != b[i]) que.add(i);
		}
		while(!que.isEmpty()){
			int now = que.poll();
			while(a[now] < b[now] && (now == n-1 || a[now+1] != a[now]+1)){
				a[now]++;
				System.out.println((now+1) + " R");
			}
			while(a[now] > b[now] && (now == 0 || a[now-1] != a[now]-1)){
				a[now]--;
				System.out.println((now+1) + " L");
			}
			if(a[now] == b[now]) {
				if(now == 0 && a[now+1] != b[now+1])  que.add(now+1);
				else if(now == n-1 && a[now-1] != b[now-1]) que.add(now-1);
				else if(now != 0 && now != n-1){
					if(a[now-1] != b[now-1]) que.add(now-1);
					if(a[now+1] != b[now+1]) que.add(now+1);
				}
			}
		}
	}
}

class FastScanner {
	private InputStream in = System.in;
	private byte[] buffer = new byte[1024];
	private int length = 0, p = 0;
	private boolean hasNextByte() {
		if (p < length) return true;
		else{
			p = 0;
			try{
				length = in.read(buffer);
			}catch(Exception e){
				e.printStackTrace();
			}
			if(length == 0) return false;
		}
		return true;
	}
	private int readByte() {
		if (hasNextByte() == true) return buffer[p++];
		return -1;
	}
	private static boolean isPrintable(int n) {
		return 33 <= n && n <= 126;
	}
	private void skip() {
		while (hasNextByte() && !isPrintable(buffer[p])) p++;
	}
	public boolean hasNext() {
		skip();
		return hasNextByte();
	}
	public String next() {
		if(!hasNext()) throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int temp = readByte();
		while (isPrintable(temp)) {
			sb.appendCodePoint(temp);
			temp = readByte();
		}
		return sb.toString();
	}
	public int nextInt() {
		return Math.toIntExact(nextLong());
	}
	public int[] nextInts(int n) {
		int[] ar = new int[n];
		for (int i = 0; i < n; i++) ar[i] = nextInt();
		return ar;
	}
	public long[] nextLongs(int n) {
		long[] ar = new long[n];
		for (int i = 0; i < n; i++) ar[i] = nextLong();
		return ar;
	}
	public long nextLong() {
		if(!hasNext()) throw new NoSuchElementException();
		boolean minus = false;
		int temp = readByte();
		if (temp == '-') {
			minus = true;
			temp = readByte();
		}
		if (temp < '0' || '9' < temp) throw new NumberFormatException();
		long n = 0;
		while (isPrintable(temp)) {
			if ('0' <= temp && temp <= '9') {
				n *= 10;
				n += temp - '0';
			}
			temp = readByte();
		}
		return minus ? -n : n;
	}
	public char[] nextChars() {
		String s = next();
		return s.toCharArray();
	}
	public char[][] nextCharMat(int h, int w) {
		char[][] ar = new char[h][w];
		for(int i = 0; i < h; i++){
			String s = next();
			for(int j = 0; j < w; j++){
				ar[i][j] = s.charAt(j);
			}
		}
		return ar;
	}
}
0