結果
| 問題 |
No.988 N×Mマス計算(総和)
|
| ユーザー |
watarimaycry2
|
| 提出日時 | 2020-07-03 21:32:51 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 337 ms / 2,000 ms |
| コード長 | 3,675 bytes |
| コンパイル時間 | 3,112 ms |
| コンパイル使用メモリ | 87,820 KB |
| 実行使用メモリ | 72,208 KB |
| 最終ジャッジ日時 | 2024-07-06 08:01:51 |
| 合計ジャッジ時間 | 7,455 ms |
|
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 19 |
ソースコード
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
}
watarimaycry2