結果
問題 | No.2306 [Cherry 5th Tune C] ウソツキタマシイ |
ユーザー | tenten |
提出日時 | 2023-05-29 13:56:57 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 459 ms / 2,000 ms |
コード長 | 2,230 bytes |
コンパイル時間 | 3,235 ms |
コンパイル使用メモリ | 87,140 KB |
実行使用メモリ | 64,232 KB |
最終ジャッジ日時 | 2023-08-27 23:41:07 |
合計ジャッジ時間 | 17,442 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
49,688 KB |
testcase_01 | AC | 43 ms
49,716 KB |
testcase_02 | AC | 72 ms
51,356 KB |
testcase_03 | AC | 58 ms
51,036 KB |
testcase_04 | AC | 80 ms
51,856 KB |
testcase_05 | AC | 87 ms
51,980 KB |
testcase_06 | AC | 98 ms
52,128 KB |
testcase_07 | AC | 368 ms
60,868 KB |
testcase_08 | AC | 194 ms
56,384 KB |
testcase_09 | AC | 298 ms
57,808 KB |
testcase_10 | AC | 244 ms
56,104 KB |
testcase_11 | AC | 293 ms
56,504 KB |
testcase_12 | AC | 354 ms
59,448 KB |
testcase_13 | AC | 295 ms
56,368 KB |
testcase_14 | AC | 269 ms
56,640 KB |
testcase_15 | AC | 382 ms
62,864 KB |
testcase_16 | AC | 378 ms
62,428 KB |
testcase_17 | AC | 441 ms
61,520 KB |
testcase_18 | AC | 444 ms
61,468 KB |
testcase_19 | AC | 448 ms
62,264 KB |
testcase_20 | AC | 459 ms
61,836 KB |
testcase_21 | AC | 447 ms
63,000 KB |
testcase_22 | AC | 419 ms
63,280 KB |
testcase_23 | AC | 447 ms
64,232 KB |
testcase_24 | AC | 440 ms
62,132 KB |
testcase_25 | AC | 439 ms
62,448 KB |
testcase_26 | AC | 459 ms
61,876 KB |
testcase_27 | AC | 355 ms
58,492 KB |
testcase_28 | AC | 423 ms
62,480 KB |
testcase_29 | AC | 357 ms
62,636 KB |
ソースコード
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(); } }