結果
問題 | No.429 CupShuffle |
ユーザー | kitakitalily |
提出日時 | 2019-04-25 15:22:27 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,870 bytes |
コンパイル時間 | 4,347 ms |
コンパイル使用メモリ | 79,808 KB |
実行使用メモリ | 64,236 KB |
最終ジャッジ日時 | 2024-11-19 06:50:51 |
合計ジャッジ時間 | 12,449 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | WA | - |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
ソースコード
import java.util.*; public class Main { static int mod = 1000000007; static int size = 200000; static long[] fac = new long[size]; static long[] finv = new long[size]; static long[] inv = new long[size]; static int INF = Integer.MAX_VALUE; public static void main(String[] args){ Scanner scanner = new Scanner(System.in); int n = scanner.nextInt(); int k = scanner.nextInt(); int x = scanner.nextInt(); int[] a = new int[k]; int[] b = new int[k]; for(int i = 0; i < x-1; i++){ a[i] = scanner.nextInt()-1; b[i] = scanner.nextInt()-1; } if(scanner.next() == "?"){ a[x-1] = 100001; } if(scanner.next() == "?"){ b[x-1] = 100001; } for(int i = x; i < k; i++){ a[i] = scanner.nextInt()-1; b[i] = scanner.nextInt()-1; } //後ろから順に?までswap int[] c = new int[n]; for(int i = 0; i < n; i++){ c[i] = scanner.nextInt()-1; } for(int i = k-1; i > x-1; i--){ int tmp = c[a[i]]; c[a[i]] = c[b[i]]; c[b[i]] = tmp; } //前から順に?までawap int[] pre = new int[n]; for(int i = 0; i < n; i++){ pre[i] = i; } for(int i = 0; i < x-1; i++){ int tmp2 = pre[a[i]]; pre[a[i]] = pre[b[i]]; pre[b[i]] = tmp2; } List<Integer> list = new ArrayList<Integer>(); for(int i = 0; i < n; i++){ if(pre[i] != c[i]){ list.add(i); } } for(int i : list){ System.out.println(i+1); } } static class Pair implements Comparable<Pair>{ int x, y; Pair(int a, int b){ x = a; y = b; } @Override public boolean equals(Object o){ if (this == o) return true; if (!(o instanceof Pair)) return false; Pair p = (Pair) o; return x == p.x && y == p.y; } @Override public int compareTo(Pair p){ //return x == p.x ? y - p.y : x - p.x; //xで昇順にソート //return (x == p.x ? y - p.y : x - p.x) * -1; //xで降順にソート //return y == p.y ? x - p.x : y - p.y;//yで昇順にソート return (y == p.y ? x - p.x : y - p.y)*-1;//yで降順にソート } } static class E{ int to; E(int to){ this.to = to; } } static class Edge implements Comparable<Edge>{ int from; int to; int cost; Edge(int from, int to,int cost){ this.from = from; this.to = to; this.cost = cost; } public int compareTo(Edge e) { return this.cost - e.cost; } } //繰り返し二乗法 public static long pow(long x, long n){ long ans = 1; while(n > 0){ if((n & 1) == 1){ ans = ans * x; ans %= mod; } x = x * x % mod; n >>= 1; } return ans; } //fac, inv, finvテーブルの初期化、これ使う場合はinitComb()で初期化必要 public static void initComb(){ fac[0] = finv[0] = inv[0] = fac[1] = finv[1] = inv[1] = 1; for (int i = 2; i < size; ++i) { fac[i] = fac[i - 1] * i % mod; inv[i] = mod - (mod / i) * inv[(int) (mod % i)] % mod; finv[i] = finv[i - 1] * inv[i] % mod; } } //nCk % mod public static long comb(int n, int k){ return fac[n] * finv[k] % mod * finv[n - k] % mod; } //n! % mod public static long fact(int n){ return fac[n]; } //(n!)^-1 with % mod public static long finv(int n){ return finv[n]; } static class UnionFind { int[] parent; public UnionFind(int size) { parent = new int[size]; Arrays.fill(parent, -1); } public boolean unite(int x, int y) { x = root(x); y = root(y); if (x != y) { if (parent[y] < parent[x]) { int tmp = y; y = x; x = tmp; } parent[x] += parent[y]; parent[y] = x; return true; } return false; } public boolean same(int x, int y) { return root(x) == root(y); } public int root(int x) { return parent[x] < 0 ? x : (parent[x] = root(parent[x])); } public int size(int x) { return -parent[root(x)]; } } public static int upperBound(long[] a,long val){ return upperBound(a,0,a.length,val); } public static int upperBound(long[] a,int l,int r,long val){ if(r-l==1){ if(a[l]>val) return l; return r; } int mid=(l+r)/2; if(a[mid]>val){ return upperBound(a,l,mid,val); }else{ return upperBound(a,mid,r,val); } } public static int lowerBound(long[] a,long val){ return lowerBound(a,0,a.length,val); } public static int lowerBound(long[] a,int l,int r,long val){ if(r-l==1){ if(a[l]<val) return r; return l; } int mid=(l+r)/2; if(a[mid]<val){ return lowerBound(a,mid,r,val); }else{ return lowerBound(a,l,mid,val); } } //n,mの最大公約数 public static int gcd(int n, int m){ if(m > n) return gcd(m,n); if(m == 0) return n; return gcd(m, n%m); } }