結果

問題 No.1477 Lamps on Graph
ユーザー tentententen
提出日時 2023-04-17 14:52:47
言語 Java
(openjdk 23)
結果
AC  
実行時間 800 ms / 2,000 ms
コード長 2,954 bytes
コンパイル時間 2,832 ms
コンパイル使用メモリ 85,444 KB
実行使用メモリ 62,928 KB
最終ジャッジ日時 2024-10-12 17:21:24
合計ジャッジ時間 23,494 ms
ジャッジサーバーID
(参考情報)
judge1 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 38
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import java.io.*;
import java.util.*;
import java.util.stream.*;
public class Main {
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner();
int n = sc.nextInt();
int m = sc.nextInt();
Lamp[] lamps = new Lamp[n];
ArrayList<ArrayList<Integer>> graph = new ArrayList<>();
for (int i = 0; i < n; i++) {
lamps[i] = new Lamp(i, sc.nextInt());
graph.add(new ArrayList<>());
}
for (int i = 0; i < m; i++) {
int a = sc.nextInt() - 1;
int b = sc.nextInt() - 1;
if (lamps[a].value < lamps[b].value) {
graph.get(a).add(b);
} else if (lamps[b].value < lamps[a].value) {
graph.get(b).add(a);
}
}
Arrays.sort(lamps);
int k = sc.nextInt();
boolean[] isOn = new boolean[n];
for (int i = 0; i < k; i++) {
isOn[sc.nextInt() - 1] = true;
}
StringBuilder sb = new StringBuilder();
int count = 0;
for (Lamp x : lamps) {
if (isOn[x.idx]) {
count++;
sb.append(x.idx + 1).append("\n");
for (int y : graph.get(x.idx)) {
isOn[y] ^= true;
}
}
}
System.out.println(count);
System.out.print(sb);
}
static class Lamp implements Comparable<Lamp> {
int idx;
int value;
public Lamp(int idx, int value) {
this.idx = idx;
this.value = value;
}
public int compareTo(Lamp another) {
return value - another.value;
}
}
}
class Utilities {
static String arrayToLineString(Object[] arr) {
return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n"));
}
static String arrayToLineString(int[] arr) {
return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new));
}
}
class Scanner {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer("");
StringBuilder sb = new StringBuilder();
public Scanner() throws Exception {
}
public int nextInt() throws Exception {
return Integer.parseInt(next());
}
public long nextLong() throws Exception {
return Long.parseLong(next());
}
public double nextDouble() throws Exception {
return Double.parseDouble(next());
}
public int[] nextIntArray() throws Exception {
return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray();
}
public String next() throws Exception {
while (!st.hasMoreTokens()) {
st = new StringTokenizer(br.readLine());
}
return st.nextToken();
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0