結果

問題 No.2482 Sandglasses
ユーザー tentententen
提出日時 2023-09-25 15:44:00
言語 Java
(openjdk 23)
結果
AC  
実行時間 1,087 ms / 2,000 ms
コード長 3,132 bytes
コンパイル時間 3,780 ms
コンパイル使用メモリ 96,116 KB
実行使用メモリ 71,144 KB
最終ジャッジ日時 2024-11-16 22:59:14
合計ジャッジ時間 32,790 ms
ジャッジサーバーID
(参考情報)
judge1 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 25
権限があれば一括ダウンロードができます

ソースコード

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 k = sc.nextInt();
int t = sc.nextInt();
Glass[] glasses = new Glass[n];
for (int i = 0; i < n; i++) {
glasses[i] = new Glass(i, sc.next().charAt(0) == 'A');
}
for (int i = 0; i < n; i++) {
glasses[i].value = sc.nextInt();
}
Arrays.sort(glasses);
int[] values = new int[n];
for (int i = 0; i < n; i++) {
if (glasses[i].isA) {
int current = t + k - glasses[i].value;
int div = current / k;
int mod = current % k;
if (div % 2 == 0) {
values[i] = k - mod;
} else {
values[i] = mod;
}
} else {
int current = t + glasses[i].value;
int div = current / k;
int mod = current % k;
if (div % 2 == 0) {
values[i] = mod;
} else {
values[i] = k - mod;
}
}
}
Arrays.sort(values);
int[] ans = new int[n];
for (int i = 0; i < n; i++) {
ans[glasses[i].idx] = values[i];
}
System.out.println(String.join(" ", Arrays.stream(ans).mapToObj(String::valueOf).toArray(String[]::new)));
}
static class Glass implements Comparable<Glass> {
int idx;
boolean isA;
int value;
public Glass(int idx, boolean isA) {
this.idx = idx;
this.isA = isA;
}
public int compareTo(Glass 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