結果

問題 No.429 CupShuffle
ユーザー GrenacheGrenache
提出日時 2016-10-02 22:37:24
言語 Java21
(openjdk 21)
結果
AC  
実行時間 299 ms / 2,000 ms
コード長 4,705 bytes
コンパイル時間 4,815 ms
コンパイル使用メモリ 80,000 KB
実行使用メモリ 45,436 KB
最終ジャッジ日時 2024-11-21 13:19:16
合計ジャッジ時間 7,973 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 139 ms
41,484 KB
testcase_01 AC 128 ms
40,996 KB
testcase_02 AC 130 ms
40,940 KB
testcase_03 AC 129 ms
40,860 KB
testcase_04 AC 138 ms
41,756 KB
testcase_05 AC 126 ms
40,856 KB
testcase_06 AC 139 ms
41,892 KB
testcase_07 AC 136 ms
41,100 KB
testcase_08 AC 132 ms
41,100 KB
testcase_09 AC 139 ms
41,636 KB
testcase_10 AC 198 ms
41,836 KB
testcase_11 AC 297 ms
45,436 KB
testcase_12 AC 290 ms
43,556 KB
testcase_13 AC 299 ms
43,412 KB
testcase_14 AC 295 ms
43,704 KB
testcase_15 AC 145 ms
40,996 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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


public class Main_yukicoder429 {

	private static Scanner sc;
	private static Printer pr;

	private static void solve() {
		int n = sc.nextInt();
		int k = sc.nextInt();
		int x = sc.nextInt() - 1;

		int[] a = new int[k];
		int[] b = new int[k];
		for (int i = 0; i < k; i++) {
			if (i != x) {
				a[i] = sc.nextInt() - 1;
				b[i] = sc.nextInt() - 1;
			} else {
				sc.next();
				sc.next();
			}
		}

		int[] c = new int[n];
		for (int i = 0; i < n; i++) {
			c[i] = sc.nextInt() - 1;
		}

		int[] ret = new int[n];
		for (int i = 0; i < n; i++) {
			ret[i] = i;
		}

		for (int i = 0; i < x; i++) {
			int tmp = ret[a[i]];
			ret[a[i]] = ret[b[i]];
			ret[b[i]] = tmp;
		}

		for (int i = k - 1; i > x; i--) {
			int tmp = c[a[i]];
			c[a[i]] = c[b[i]];
			c[b[i]] = tmp;
		}

		List<Integer> ans = new ArrayList<>();
		for (int i = 0; i < n; i++) {
			if (ret[i] != c[i]) {
				ans.add(i);
			}
		}

		pr.printf("%d %d\n", ans.get(0) + 1, ans.get(1) + 1);
	}

	// ---------------------------------------------------
	public static void main(String[] args) {
		sc = new Scanner(System.in);
		pr = new Printer(System.out);

		solve();

		pr.close();
		sc.close();
	}

	@SuppressWarnings("unused")
	private static class Scanner {
		BufferedReader br;

		Scanner (InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
		}

		private boolean isPrintable(int ch) {
			return ch >= '!' && ch <= '~';
		}

		private boolean isCRLF(int ch) {
			return ch == '\n' || ch == '\r' || ch == -1;
		}

		private int nextPrintable() {
			try {
				int ch;
				while (!isPrintable(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}

				return ch;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		String next() {
			try {
				int ch = nextPrintable();
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (isPrintable(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		int nextInt() {
			try {
				// parseInt from Integer.parseInt()
				boolean negative = false;
				int res = 0;
				int limit = -Integer.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Integer.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				int multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		long nextLong() {
			try {
				// parseLong from Long.parseLong()
				boolean negative = false;
				long res = 0;
				long limit = -Long.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Long.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				long multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		float nextFloat() {
			return Float.parseFloat(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			try {
				int ch;
				while (isCRLF(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (!isCRLF(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		void close() {
			try {
				br.close();
			} catch (IOException e) {
//				throw new NoSuchElementException();
			}
		}
	}

	private static class Printer extends PrintWriter {
		Printer(PrintStream out) {
			super(out);
		}
	}
}
0