結果
| 問題 |
No.1477 Lamps on Graph
|
| コンテスト | |
| ユーザー |
 neko_the_shadow
|
| 提出日時 | 2021-04-18 14:26:02 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 1,202 ms / 2,000 ms |
| コード長 | 7,048 bytes |
| コンパイル時間 | 3,684 ms |
| コンパイル使用メモリ | 96,152 KB |
| 実行使用メモリ | 82,336 KB |
| 最終ジャッジ日時 | 2024-07-04 04:33:14 |
| 合計ジャッジ時間 | 28,570 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 38 |
ソースコード
package _1477;
import java.io.BufferedReader;
import java.io.EOFException;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintStream;
import java.io.PrintWriter;
import java.io.UncheckedIOException;
import java.math.BigInteger;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Deque;
import java.util.List;
import java.util.function.Supplier;
import java.util.regex.Pattern;
import java.util.stream.Collectors;
import java.util.stream.IntStream;
public class Main {
public void exec() {
int n = stdin.nextInt();
int m = stdin.nextInt();
int[] a = stdin.nextIntArray(n);
List<List<Integer>> nexts = IntStream.range(0, n).mapToObj(unused -> new ArrayList<Integer>()).collect(Collectors.toList());
for (int i = 0; i < m; i++) {
int u = stdin.nextInt()-1;
int v = stdin.nextInt()-1;
if (a[u]<a[v]) nexts.get(u).add(v);
if (a[v]<a[u]) nexts.get(v).add(u);
}
boolean[] light = new boolean[n];
int k = stdin.nextInt();
for (int i = 0; i < k; i++ ) {
int b = stdin.nextInt()-1;
light[b] = true;
}
Tsort tsort = new Tsort(n);
for (int i = 0; i < n; i++) {
for (int j : nexts.get(i)) {
tsort.add(i, j);
}
}
List<Integer> p = tsort.run();
List<Integer> q = new ArrayList<>();
for (int cur : p) {
if (!light[cur]) continue;
q.add(cur);
light[cur] = !light[cur];
for (int nxt : nexts.get(cur)) light[nxt] = !light[nxt];
}
boolean all = true;
for (int i = 0; i < n; i++) {
if (light[i]) {
all = false;
break;
}
}
if (all) {
stdout.println(q.size());
for (int v : q) {
stdout.println(v+1);
}
} else {
stdout.println(-1);
}
}
public class Tsort {
private int[] count;
private List<List<Integer>> nexts;
public Tsort(int n) {
this.count = new int[n];
this.nexts = IntStream.range(0, n).mapToObj(unused -> new ArrayList<Integer>()).collect(Collectors.toList());
}
public void add(int from, int to) {
this.count[to]++;
this.nexts.get(from).add(to);
}
public List<Integer> run() {
Deque<Integer> stack = IntStream.range(0, this.count.length).filter(i -> count[i]==0).boxed().collect(Collectors.toCollection(ArrayDeque::new));
List<Integer> result = new ArrayList<>();
while (!stack.isEmpty()) {
int cur = stack.removeFirst();
result.add(cur);
for (int nxt : nexts.get(cur)) {
this.count[nxt]--;
if (this.count[nxt]==0) {
stack.add(nxt);
}
}
}
return result;
}
}
private static final Stdin stdin = new Stdin(System.in);
private static final Stdout stdout = new Stdout(System.out);
public static void main(String[] args) {
try {
new Main().exec();
} finally {
stdout.flush();
}
}
public static class Stdin {
private Deque<String> queue;
private BufferedReader in;
private Pattern space;
public Stdin(InputStream in) {
this.queue = new ArrayDeque<>();
this.in = new BufferedReader(new InputStreamReader(in));
this.space = Pattern.compile(" ");
}
public String nextString() {
if (queue.isEmpty()) {
try {
String line = in.readLine();
if (line == null) {
throw new EOFException();
}
space.splitAsStream(line).forEach(this.queue::addLast);
} catch (IOException e) {
throw new UncheckedIOException(e);
}
}
return queue.removeFirst();
}
public int nextInt() {
return Integer.parseInt(nextString());
}
public double nextDouble() {
return Double.parseDouble(nextString());
}
public long nextLong() {
return Long.parseLong(nextString());
}
public BigInteger nextBigInteger() {
return new BigInteger(nextString());
}
public String[] nextStringArray(int n) {
String[] a = new String[n];
for (int i = 0; i < n; i++) a[i] = nextString();
return a;
}
public int[] nextIntArray(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++) a[i] = nextInt();
return a;
}
public double[] nextDoubleArray(int n) {
double[] a = new double[n];
for (int i = 0; i < n; i++) a[i] = nextDouble();
return a;
}
public long[] nextLongArray(int n) {
long[] a = new long[n];
for (int i = 0; i < n; i++) a[i] = nextLong();
return a;
}
public BigInteger[] nexBigIntegerArray(int n) {
BigInteger[] a = new BigInteger[n];
for (int i = 0; i < n; i++) a[i] = nextBigInteger();
return a;
}
public List<Integer> nextIntegerList(int n) {
return nextList(n, this::nextInt);
}
public List<Long> nextLongList(int n) {
return nextList(n, this::nextLong);
}
public List<Double> nextDoubleList(int n) {
return nextList(n, this::nextDouble);
}
public List<String> nextStringList(int n) {
return nextList(n, this::nextString);
}
public List<BigInteger> nextBigIntegerList(int n) {
return nextList(n, this::nextBigInteger);
}
private <T> List<T> nextList(int n, Supplier<T> supplier) {
List<T> a = new ArrayList<>();
for (int i = 0; i < n; i++) a.add(supplier.get());
return a;
}
}
public static class Stdout {
private PrintWriter stdout;
public Stdout(PrintStream stdout) {
this.stdout = new PrintWriter(stdout, false);
}
public void println(Object ... objs) {
for (int i = 0, len = objs.length; i < len; i++) {
stdout.print(objs[i]);
if (i != len-1) stdout.print(' ');
}
stdout.println();
}
public void flush() {
stdout.flush();
}
}
}