結果
| 問題 |
No.2306 [Cherry 5th Tune C] ウソツキタマシイ
|
| コンテスト | |
| ユーザー |
tenten
|
| 提出日時 | 2023-05-29 13:56:57 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 525 ms / 2,000 ms |
| コード長 | 2,230 bytes |
| コンパイル時間 | 2,766 ms |
| コンパイル使用メモリ | 85,076 KB |
| 実行使用メモリ | 53,588 KB |
| 最終ジャッジ日時 | 2024-12-28 09:50:53 |
| 合計ジャッジ時間 | 17,351 ms |
|
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| other | AC * 30 |
ソースコード
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();
long base = 0;
long[] counts = new long[m];
for (int i = 0; i < m; i++) {
counts[i] = sc.nextInt();
base += counts[i] * counts[i];
}
int q = sc.nextInt();
StringBuilder sb = new StringBuilder();
while (q-- > 0) {
int left = sc.nextInt() - 1;
int k = sc.nextInt();
int right = sc.nextInt() - 1;
base -= counts[left] * counts[left];
base -= counts[right] * counts[right];
counts[left] -= k;
counts[right] += k;
base += counts[left] * counts[left];
base += counts[right] * counts[right];
sb.append(base).append("\n");
}
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();
}
}
tenten