結果
問題 | No.1060 素敵な宝箱 |
ユーザー | Oland |
提出日時 | 2020-05-30 16:58:26 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 136 ms / 2,000 ms |
コード長 | 7,101 bytes |
コンパイル時間 | 3,012 ms |
コンパイル使用メモリ | 78,624 KB |
実行使用メモリ | 40,640 KB |
最終ジャッジ日時 | 2024-04-25 09:39:25 |
合計ジャッジ時間 | 6,593 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 57 ms
37,264 KB |
testcase_01 | AC | 54 ms
37,352 KB |
testcase_02 | AC | 58 ms
37,180 KB |
testcase_03 | AC | 56 ms
37,384 KB |
testcase_04 | AC | 54 ms
37,136 KB |
testcase_05 | AC | 56 ms
37,240 KB |
testcase_06 | AC | 55 ms
37,208 KB |
testcase_07 | AC | 53 ms
37,572 KB |
testcase_08 | AC | 61 ms
37,324 KB |
testcase_09 | AC | 61 ms
37,404 KB |
testcase_10 | AC | 59 ms
36,956 KB |
testcase_11 | AC | 65 ms
37,172 KB |
testcase_12 | AC | 102 ms
39,844 KB |
testcase_13 | AC | 106 ms
39,000 KB |
testcase_14 | AC | 110 ms
39,652 KB |
testcase_15 | AC | 118 ms
40,452 KB |
testcase_16 | AC | 107 ms
39,584 KB |
testcase_17 | AC | 93 ms
38,952 KB |
testcase_18 | AC | 101 ms
39,936 KB |
testcase_19 | AC | 100 ms
39,852 KB |
testcase_20 | AC | 116 ms
40,152 KB |
testcase_21 | AC | 109 ms
39,816 KB |
testcase_22 | AC | 119 ms
39,952 KB |
testcase_23 | AC | 100 ms
39,656 KB |
testcase_24 | AC | 136 ms
40,540 KB |
testcase_25 | AC | 121 ms
40,640 KB |
testcase_26 | AC | 129 ms
40,476 KB |
ソースコード
import java.io.*; import java.util.*; @SuppressWarnings("unused") public class Main { FastScanner in; PrintWriter out; final static int MOD = (int)1e9+7; void solve(){ int N = in.nextInt(), M = in.nextInt(); int[][] A = new int[N][M]; for(int i = 0; i < N; i++){ for(int j = 0; j < M; j++){ A[i][j] = in.nextInt(); } } int[] S = new int[M]; for(int i = 0; i < N; i++){ for(int j = 0; j < M; j++){ S[j] += A[i][j]; } } int[] B = new int[N]; for(int i = 0; i < N; i++){ for(int j = 0; j < M; j++){ B[i] += S[j] * A[i][j]; } } Arrays.sort(B); int XY = 0; for(int i = N - 1; i >= 0; i--){ XY += (i % 2 == (N - 1) % 2 ? 1 : -1) * B[i]; } out.println(XY); } public static void main(String[] args) { new Main().m(); } private void m() { in = new FastScanner(System.in); out = new PrintWriter(System.out); /* try { String path = "input.txt"; out = new PrintWriter(new BufferedWriter(new FileWriter(new File(path)))); }catch (IOException e){ e.printStackTrace(); } */ solve(); out.flush(); in.close(); out.close(); } static class FastScanner { private Reader input; public FastScanner() {this(System.in);} public FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));} public void close() { try { this.input.close(); } catch (IOException e) { e.printStackTrace(); } } public int nextInt() { long nl = nextLong(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException(); return (int) nl; } public long nextLong() { try { int sign = 1; int b = input.read(); while ((b < '0' || '9' < b) && b != '-' && b != '+') { b = input.read(); } if (b == '-') { sign = -1; b = input.read(); } else if (b == '+') { b = input.read(); } long ret = b - '0'; while (true) { b = input.read(); if (b < '0' || '9' < b) return ret * sign; ret *= 10; ret += b - '0'; } } catch (IOException e) { e.printStackTrace(); return -1; } } public double nextDouble() { try { double sign = 1; int b = input.read(); while ((b < '0' || '9' < b) && b != '-' && b != '+') { b = input.read(); } if (b == '-') { sign = -1; b = input.read(); } else if (b == '+') { b = input.read(); } double ret = b - '0'; while (true) { b = input.read(); if (b < '0' || '9' < b) break; ret *= 10; ret += b - '0'; } if (b != '.') return sign * ret; double div = 1; b = input.read(); while ('0' <= b && b <= '9') { ret *= 10; ret += b - '0'; div *= 10; b = input.read(); } return sign * ret / div; } catch (IOException e) { e.printStackTrace(); return Double.NaN; } } public char nextChar() { try { int b = input.read(); while (Character.isWhitespace(b)) { b = input.read(); } return (char) b; } catch (IOException e) { e.printStackTrace(); return 0; } } public String nextStr() { try { StringBuilder sb = new StringBuilder(); int b = input.read(); while (Character.isWhitespace(b)) { b = input.read(); } while (b != -1 && !Character.isWhitespace(b)) { sb.append((char) b); b = input.read(); } return sb.toString(); } catch (IOException e) { e.printStackTrace(); return ""; } } public String nextLine() { try { StringBuilder sb = new StringBuilder(); int b = input.read(); while (b != -1 && b != '\n') { sb.append((char) b); b = input.read(); } return sb.toString(); } catch (IOException e) { e.printStackTrace(); return ""; } } public int[] nextIntArray(int n) { int[] res = new int[n]; for (int i = 0; i < n; i++) { res[i] = nextInt(); } return res; } public int[] nextIntArrayDec(int n) { int[] res = new int[n]; for (int i = 0; i < n; i++) { res[i] = nextInt() - 1; } return res; } public int[] nextIntArray1Index(int n) { int[] res = new int[n + 1]; for (int i = 0; i < n; i++) { res[i + 1] = nextInt(); } return res; } public long[] nextLongArray(int n) { long[] res = new long[n]; for (int i = 0; i < n; i++) { res[i] = nextLong(); } return res; } public long[] nextLongArrayDec(int n) { long[] res = new long[n]; for (int i = 0; i < n; i++) { res[i] = nextLong() - 1; } return res; } public long[] nextLongArray1Index(int n) { long[] res = new long[n + 1]; for (int i = 0; i < n; i++) { res[i + 1] = nextLong(); } return res; } public double[] nextDoubleArray(int n) { double[] res = new double[n]; for (int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; } } }