結果

問題 No.2307 [Cherry 5 th Tune *] Cool 46
ユーザー tentententen
提出日時 2023-05-30 08:41:09
言語 Java
(openjdk 23)
結果
AC  
実行時間 892 ms / 2,000 ms
コード長 3,192 bytes
コンパイル時間 8,367 ms
コンパイル使用メモリ 96,084 KB
実行使用メモリ 73,492 KB
最終ジャッジ日時 2024-12-28 11:27:03
合計ジャッジ時間 61,956 ms
ジャッジサーバーID
(参考情報)
judge4 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 46
権限があれば一括ダウンロードができます

ソースコード

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 t = sc.nextInt();
StringBuilder sb = new StringBuilder();
while (t-- > 0) {
int n = sc.nextInt();
int m = sc.nextInt();
HashSet<Integer> red = new HashSet<>();
for (int i = 0; i < n; i++) {
red.add(sc.nextInt());
}
HashSet<Integer> blue = new HashSet<>();
TreeSet<Integer> both = new TreeSet<>();
for (int i = 0; i < m; i++) {
int x = sc.nextInt();
if (red.contains(x)) {
red.remove(x);
both.add(x);
} else {
blue.add(x);
}
}
if (both.size() == 0 && red.size() > 0 && blue.size() > 0) {
sb.append("No\n");
continue;
}
sb.append("Yes\n");
for (int x : red) {
sb.append("Red ").append(x).append("\n");
}
if (both.size() > 0) {
int y = both.pollFirst();
sb.append("Red ").append(y).append("\n");
sb.append("Blue ").append(y).append("\n");
}
for (int x : blue) {
sb.append("Blue ").append(x).append("\n");
}
boolean isBlue = true;
for (int x : both) {
if (isBlue) {
sb.append("Blue ").append(x).append("\n");
sb.append("Red ").append(x).append("\n");
} else {
sb.append("Red ").append(x).append("\n");
sb.append("Blue ").append(x).append("\n");
}
isBlue ^= true;
}
}
System.out.print(sb);
}
}
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