結果
問題 | No.2225 Treasure Searching Rod (Easy) |
ユーザー |
![]() |
提出日時 | 2023-02-28 13:02:19 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 118 ms / 2,000 ms |
コード長 | 2,101 bytes |
コンパイル時間 | 2,714 ms |
コンパイル使用メモリ | 88,616 KB |
実行使用メモリ | 39,644 KB |
最終ジャッジ日時 | 2024-09-15 15:24:01 |
合計ジャッジ時間 | 5,792 ms |
ジャッジサーバーID (参考情報) |
judge6 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 23 |
ソースコード
import java.io.*;import java.util.*;import java.util.stream.*;public class Main {static final int MOD = 998244353;public static void main(String[] args) throws Exception {Scanner sc = new Scanner();int h = sc.nextInt();int w = sc.nextInt();int n = sc.nextInt();long ans = 0;for (int i = 0; i < n; i++) {int x = sc.nextInt();int y = sc.nextInt();long v = sc.nextInt();long left = Math.min(x, y);long count = MOD - x;count += left * (x + x - left + 1) / 2 % MOD;count %= MOD;long right = Math.min(x, w - y + 1);count += right * (x + x - right + 1) / 2 % MOD;count %= MOD;ans += count * v % MOD;ans %= MOD;}System.out.println(ans);}}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();}}