結果
問題 | No.429 CupShuffle |
ユーザー | uwi |
提出日時 | 2016-10-02 22:26:57 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 169 ms / 2,000 ms |
コード長 | 3,659 bytes |
コンパイル時間 | 4,230 ms |
コンパイル使用メモリ | 83,700 KB |
実行使用メモリ | 57,884 KB |
最終ジャッジ日時 | 2024-11-21 13:12:36 |
合計ジャッジ時間 | 6,382 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 74 ms
51,024 KB |
testcase_01 | AC | 71 ms
51,260 KB |
testcase_02 | AC | 70 ms
51,172 KB |
testcase_03 | AC | 73 ms
50,976 KB |
testcase_04 | AC | 71 ms
51,060 KB |
testcase_05 | AC | 72 ms
51,004 KB |
testcase_06 | AC | 72 ms
50,992 KB |
testcase_07 | AC | 74 ms
50,828 KB |
testcase_08 | AC | 72 ms
51,116 KB |
testcase_09 | AC | 74 ms
51,188 KB |
testcase_10 | AC | 101 ms
51,728 KB |
testcase_11 | AC | 169 ms
57,792 KB |
testcase_12 | AC | 163 ms
57,780 KB |
testcase_13 | AC | 169 ms
57,828 KB |
testcase_14 | AC | 164 ms
57,884 KB |
testcase_15 | AC | 69 ms
51,080 KB |
ソースコード
package contest161002; 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 N429 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(), K = ni(), x = ni(); int[][] sw = new int[K][]; for(int i = 0;i < K;i++){ if(i == x-1){ ns(); ns(); continue; } sw[i] = new int[]{ni()-1, ni()-1}; } int[] last = na(n); for(int i = K-1;i >= x;i--){ int a = sw[i][0], b = sw[i][1]; int d = last[a]; last[a] = last[b]; last[b] = d; } int[] first = new int[n]; for(int i = 0;i < n;i++)first[i] = i+1; for(int i = 0;i < x-1;i++){ int a = sw[i][0], b = sw[i][1]; int d = first[a]; first[a] = first[b]; first[b] = d; } for(int i = 0;i < n;i++){ if(first[i] != last[i]){ out.print(i+1 + " "); } } out.println(); } 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"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new N429().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 int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } 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[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } 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)); } }