結果
問題 | No.60 魔法少女 |
ユーザー | fujisu |
提出日時 | 2015-05-11 05:06:07 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 521 ms / 5,000 ms |
コード長 | 2,943 bytes |
コンパイル時間 | 2,294 ms |
コンパイル使用メモリ | 74,524 KB |
実行使用メモリ | 64,952 KB |
最終ジャッジ日時 | 2023-09-20 02:02:39 |
合計ジャッジ時間 | 9,015 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 76 ms
55,764 KB |
testcase_01 | AC | 70 ms
55,764 KB |
testcase_02 | AC | 74 ms
55,640 KB |
testcase_03 | AC | 78 ms
56,192 KB |
testcase_04 | AC | 416 ms
63,244 KB |
testcase_05 | AC | 387 ms
64,952 KB |
testcase_06 | AC | 487 ms
63,416 KB |
testcase_07 | AC | 442 ms
63,292 KB |
testcase_08 | AC | 373 ms
63,148 KB |
testcase_09 | AC | 321 ms
63,084 KB |
testcase_10 | AC | 512 ms
64,952 KB |
testcase_11 | AC | 181 ms
58,780 KB |
testcase_12 | AC | 347 ms
63,452 KB |
testcase_13 | AC | 521 ms
64,604 KB |
ソースコード
import java.io.IOException; import java.util.InputMismatchException; public class Main { void run() { MyScanner sc = new MyScanner(); int n = sc.nextInt(); int k = sc.nextInt(); int[] x = new int[n]; int[] y = new int[n]; int[] hp = new int[n]; for (int i = 0; i < n; i++) { x[i] = sc.nextInt() + 500; y[i] = sc.nextInt() + 500; hp[i] = sc.nextInt(); } int[][] imos = new int[1001][1002]; for (int i = 0; i < k; i++) { int ax = sc.nextInt() + 500; int ay = sc.nextInt() + 500; int w = sc.nextInt(); int h = sc.nextInt(); int d = sc.nextInt(); for (int j = ay; j <= Math.min(1000, ay + h); j++) { imos[j][ax] += d; imos[j][Math.min(1001, ax + w + 1)] -= d; } } for (int i = 0; i < 1001; i++) { for (int j = 1; j < 1002; j++) { imos[i][j] += imos[i][j - 1]; } } int sum = 0; for (int i = 0; i < n; i++) { int tmp = Math.max(0, hp[i] - imos[y[i]][x[i]]); sum += tmp; } System.out.println(sum); } public static void main(String[] args) { new Main().run(); } public void mapDebug(int[][] a) { System.out.println("--------map display---------"); for (int i = 0; i < a.length; i++) { for (int j = 0; j < a[i].length; j++) { System.out.printf("%3d ", a[i][j]); } System.out.println(); } System.out.println("----------------------------" + '\n'); } class MyScanner { int read() { try { return System.in.read(); } catch (IOException e) { throw new InputMismatchException(); } } boolean isSpaceChar(int c) { return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1; } boolean isEndline(int c) { return c == '\n' || c == '\r' || c == -1; } int nextInt() { return Integer.parseInt(next()); } int[] nextIntArray(int n) { int[] array = new int[n]; for (int i = 0; i < n; i++) array[i] = nextInt(); return array; } long nextLong() { return Long.parseLong(next()); } long[] nextLongArray(int n) { long[] array = new long[n]; for (int i = 0; i < n; i++) array[i] = nextLong(); return array; } double nextDouble() { return Double.parseDouble(next()); } double[] nextDoubleArray(int n) { double[] array = new double[n]; for (int i = 0; i < n; i++) array[i] = nextDouble(); return array; } String next() { int c = read(); while (isSpaceChar(c)) c = read(); StringBuilder res = new StringBuilder(); do { res.appendCodePoint(c); c = read(); } while (!isSpaceChar(c)); return res.toString(); } String[] nextStringArray(int n) { String[] array = new String[n]; for (int i = 0; i < n; i++) array[i] = next(); return array; } String nextLine() { int c = read(); while (isEndline(c)) c = read(); StringBuilder res = new StringBuilder(); do { res.appendCodePoint(c); c = read(); } while (!isEndline(c)); return res.toString(); } } }