結果
問題 | No.1650 Moving Coins |
ユーザー | nishi5451 |
提出日時 | 2021-08-20 23:58:02 |
言語 | Java21 (openjdk 21) |
結果 |
TLE
|
実行時間 | - |
コード長 | 3,137 bytes |
コンパイル時間 | 2,354 ms |
コンパイル使用メモリ | 86,660 KB |
実行使用メモリ | 63,804 KB |
最終ジャッジ日時 | 2024-10-14 08:14:16 |
合計ジャッジ時間 | 15,779 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 63 ms
42,888 KB |
testcase_01 | AC | 48 ms
36,572 KB |
testcase_02 | AC | 64 ms
38,056 KB |
testcase_03 | AC | 256 ms
46,104 KB |
testcase_04 | AC | 227 ms
45,396 KB |
testcase_05 | AC | 254 ms
46,016 KB |
testcase_06 | AC | 264 ms
46,024 KB |
testcase_07 | AC | 267 ms
46,064 KB |
testcase_08 | AC | 422 ms
53,040 KB |
testcase_09 | AC | 499 ms
59,016 KB |
testcase_10 | AC | 413 ms
49,700 KB |
testcase_11 | AC | 448 ms
53,148 KB |
testcase_12 | AC | 462 ms
59,980 KB |
testcase_13 | AC | 456 ms
52,348 KB |
testcase_14 | AC | 584 ms
59,648 KB |
testcase_15 | AC | 394 ms
48,080 KB |
testcase_16 | AC | 482 ms
59,452 KB |
testcase_17 | AC | 437 ms
53,012 KB |
testcase_18 | AC | 472 ms
56,244 KB |
testcase_19 | TLE | - |
testcase_20 | -- | - |
testcase_21 | -- | - |
testcase_22 | -- | - |
testcase_23 | -- | - |
testcase_24 | -- | - |
testcase_25 | -- | - |
testcase_26 | -- | - |
ソースコード
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(); PrintWriter pw = new PrintWriter(System.out); // .#.#..## // ..####.. 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]); } pw.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]++; pw.println((now+1) + " R"); } while(a[now] > b[now] && (now == 0 || a[now-1] != a[now]-1)){ a[now]--; pw.println((now+1) + " L"); } if(a[now] != b[now]) que.add(now); } pw.close(); } } 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; } }