結果
問題 | No.988 N×Mマス計算(総和) |
ユーザー | watarimaycry2 |
提出日時 | 2020-07-03 21:32:51 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 386 ms / 2,000 ms |
コード長 | 3,675 bytes |
コンパイル時間 | 3,101 ms |
コンパイル使用メモリ | 78,268 KB |
実行使用メモリ | 71,656 KB |
最終ジャッジ日時 | 2023-09-20 12:42:55 |
合計ジャッジ時間 | 7,792 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 66 ms
51,176 KB |
testcase_01 | AC | 67 ms
50,900 KB |
testcase_02 | AC | 70 ms
50,760 KB |
testcase_03 | AC | 67 ms
50,952 KB |
testcase_04 | AC | 68 ms
50,668 KB |
testcase_05 | AC | 68 ms
50,928 KB |
testcase_06 | AC | 69 ms
51,296 KB |
testcase_07 | AC | 69 ms
50,588 KB |
testcase_08 | AC | 68 ms
51,292 KB |
testcase_09 | AC | 67 ms
50,924 KB |
testcase_10 | AC | 225 ms
58,680 KB |
testcase_11 | AC | 242 ms
62,040 KB |
testcase_12 | AC | 321 ms
63,280 KB |
testcase_13 | AC | 235 ms
60,748 KB |
testcase_14 | AC | 247 ms
61,048 KB |
testcase_15 | AC | 202 ms
58,624 KB |
testcase_16 | AC | 303 ms
63,260 KB |
testcase_17 | AC | 328 ms
63,552 KB |
testcase_18 | AC | 250 ms
61,252 KB |
testcase_19 | AC | 329 ms
63,684 KB |
testcase_20 | AC | 386 ms
71,656 KB |
ソースコード
import java.util.*;import java.io.*;import java.math.*; public class Main{ //↓見なくていいよ!ここから------------------------------------------ static class InputIterator{ ArrayList<String> inputLine = new ArrayList<String>(1024); int index = 0; int max; InputIterator(){ BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); while(true){ String read; try{ read = br.readLine(); }catch(IOException e){ read = null; } if(read != null){ inputLine.add(read); }else{ break; } } max = inputLine.size(); } boolean hasNext(){return (index < max);} String next(){ if(hasNext()){ String returnStr = inputLine.get(index); index++; return returnStr; }else{ throw new IndexOutOfBoundsException("これ以上入力はないよ"); } } } static InputIterator ii = new InputIterator();//リアクティブでは使えないので諦めてScanner使うこと static PrintWriter out = new PrintWriter(System.out); static void flush(){out.flush();} static void myout(Object t){out.println(t);} static void myerr(Object t){System.err.print("debug:");System.err.println(t);} static String next(){return ii.next();} static int nextInt(){return Integer.parseInt(next());} static long nextLong(){return Long.parseLong(next());} static ArrayList<String> nextStrArray(){return myHanSpSplit(next());} static ArrayList<String> myHanSpSplit(String str){return new ArrayList<String>(Arrays.asList(str.split(" ")));} static ArrayList<String> nextCharArray(){return mySingleSplit(next());} static ArrayList<String> mySingleSplit(String str){return new ArrayList<String>(Arrays.asList(str.split("")));} static ArrayList<Integer> nextIntArray(){ ArrayList<Integer> ret = new ArrayList<Integer>(); ArrayList<String> input = nextStrArray(); for(int i = 0; i < input.size(); i++){ ret.add(Integer.parseInt(input.get(i))); } return ret; } static ArrayList<Long> nextLongArray(){ ArrayList<Long> ret = new ArrayList<Long>(); ArrayList<String> input = nextStrArray(); for(int i = 0; i < input.size(); i++){ ret.add(Long.parseLong(input.get(i))); } return ret; } static String kaigyoToStr(String[] list){return String.join("\n",list);} static String kaigyoToStr(ArrayList<String> list){return String.join("\n",list);} static String hanSpToStr(String[] list){return String.join(" ",list);} static String hanSpToStr(ArrayList<String> list){return String.join(" ",list);} public static void main(String[] args){ Runtime rt = Runtime.getRuntime(); long mae = System.currentTimeMillis(); solve(); flush(); long ato = System.currentTimeMillis(); myerr("time : " + (ato - mae) + "ms"); myerr("memory : " + ((rt.totalMemory() - rt.getRuntime().freeMemory()) / 1024) + "KB"); } //↑見なくていいよ!ここまで------------------------------------------ static void solve(){//ここがメイン関数代わり ArrayList<Integer> one = nextIntArray(); int N = one.get(0); int M = one.get(1); int K = one.get(2); ArrayList<String> list = nextStrArray(); String op = list.get(0); long output = 0; long mSum = 0; for(int i = 1; i < M + 1; i++){ mSum += Long.parseLong(list.get(i)); mSum %= K; } for(int i = 0; i < N; i++){ long A = nextLong(); if(op.equals("+")){ output += mSum + (A * M); }else{ output += mSum * A; } output %= K; } myout(output); } //Method addition frame start //Method addition frame end }