結果
問題 | No.1338 Giant Class |
ユーザー | watarimaycry2 |
提出日時 | 2021-01-15 21:49:35 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 683 ms / 2,000 ms |
コード長 | 3,289 bytes |
コンパイル時間 | 3,628 ms |
コンパイル使用メモリ | 76,576 KB |
実行使用メモリ | 80,596 KB |
最終ジャッジ日時 | 2023-08-17 16:45:55 |
合計ジャッジ時間 | 13,790 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 44 ms
47,840 KB |
testcase_01 | AC | 44 ms
49,352 KB |
testcase_02 | AC | 524 ms
73,032 KB |
testcase_03 | AC | 47 ms
49,516 KB |
testcase_04 | AC | 52 ms
49,444 KB |
testcase_05 | AC | 67 ms
49,760 KB |
testcase_06 | AC | 462 ms
67,500 KB |
testcase_07 | AC | 563 ms
75,632 KB |
testcase_08 | AC | 446 ms
67,408 KB |
testcase_09 | AC | 406 ms
64,468 KB |
testcase_10 | AC | 601 ms
77,988 KB |
testcase_11 | AC | 188 ms
56,608 KB |
testcase_12 | AC | 473 ms
73,836 KB |
testcase_13 | AC | 440 ms
66,948 KB |
testcase_14 | AC | 232 ms
59,464 KB |
testcase_15 | AC | 265 ms
58,980 KB |
testcase_16 | AC | 184 ms
56,220 KB |
testcase_17 | AC | 433 ms
67,092 KB |
testcase_18 | AC | 225 ms
58,948 KB |
testcase_19 | AC | 318 ms
62,200 KB |
testcase_20 | AC | 659 ms
80,160 KB |
testcase_21 | AC | 683 ms
80,120 KB |
testcase_22 | AC | 668 ms
80,596 KB |
ソースコード
import java.util.*; import java.io.*; import java.math.*; public class Main{ //Don't have to see. start------------------------------------------ static class InputIterator{ ArrayList<String> inputLine = new ArrayList<>(1024); int index = 0; int max; String read; InputIterator(){ BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); try{ while((read = br.readLine()) != null){ inputLine.addAll(Arrays.asList(read.split(" "))); } }catch(IOException e){} max = inputLine.size(); } boolean hasNext(){return (index < max);} String next(){ if(hasNext()){ return inputLine.get(index++); }else{ throw new IndexOutOfBoundsException("There is no more input"); } } } static HashMap<Integer, String> CONVSTR = new HashMap<>(); static InputIterator ii = new InputIterator();//This class cannot be used in reactive problem. 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 boolean hasNext(){return ii.hasNext();} static int nextInt(){return Integer.parseInt(next());} static long nextLong(){return Long.parseLong(next());} static double nextDouble(){return Double.parseDouble(next());} static ArrayList<String> nextCharArray(){return myconv(next(), 0);} static ArrayList<String> nextStrArray(int size){ ArrayList<String> ret = new ArrayList<>(size); for(int i = 0; i < size; i++){ ret.add(next()); } return ret; } static ArrayList<Integer> nextIntArray(int size){ ArrayList<Integer> ret = new ArrayList<>(size); for(int i = 0; i < size; i++){ ret.add(Integer.parseInt(next())); } return ret; } static ArrayList<Long> nextLongArray(int size){ ArrayList<Long> ret = new ArrayList<>(size); for(int i = 0; i < size; i++){ ret.add(Long.parseLong(next())); } return ret; } @SuppressWarnings("unchecked") static String myconv(Object list, int no){//only join String joinString = CONVSTR.get(no); if(list instanceof String[]){ return String.join(joinString, (String[])list); }else if(list instanceof ArrayList){ return String.join(joinString, (ArrayList)list); }else{ throw new ClassCastException("Don't join"); } } static ArrayList<String> myconv(String str, int no){//only split String splitString = CONVSTR.get(no); return new ArrayList<String>(Arrays.asList(str.split(splitString))); } public static void main(String[] args){ CONVSTR.put(8, " "); CONVSTR.put(9, "\n"); CONVSTR.put(0, ""); solve();flush(); } //Don't have to see. end------------------------------------------ static void solve(){//Here is the main function int H = nextInt(); int W = nextInt(); int Q = nextInt(); long output = (long)H * W; HashMap<Integer, Integer> map = new HashMap<>(); for(int i = 0; i < Q; i++){ int Y = nextInt(); int X = nextInt(); if(map.containsKey(X)){ if(Y < map.get(X)){ output += H - map.get(X) + 1; output -= H - Y + 1; map.put(X, Y); } }else{ output -= H - Y + 1; map.put(X, Y); } myout(output); } } //Method addition frame start //Method addition frame end }