結果

問題 No.1338 Giant Class
ユーザー watarimaycry2watarimaycry2
提出日時 2021-01-15 21:49:35
言語 Java21
(openjdk 21)
結果
AC  
実行時間 605 ms / 2,000 ms
コード長 3,289 bytes
コンパイル時間 2,718 ms
コンパイル使用メモリ 80,324 KB
実行使用メモリ 68,644 KB
最終ジャッジ日時 2024-05-04 23:25:16
合計ジャッジ時間 11,820 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 45 ms
37,108 KB
testcase_01 AC 44 ms
37,108 KB
testcase_02 AC 475 ms
61,872 KB
testcase_03 AC 52 ms
37,144 KB
testcase_04 AC 51 ms
37,412 KB
testcase_05 AC 60 ms
37,712 KB
testcase_06 AC 420 ms
56,684 KB
testcase_07 AC 513 ms
65,016 KB
testcase_08 AC 414 ms
56,788 KB
testcase_09 AC 398 ms
54,888 KB
testcase_10 AC 569 ms
67,408 KB
testcase_11 AC 204 ms
45,100 KB
testcase_12 AC 450 ms
60,676 KB
testcase_13 AC 420 ms
56,548 KB
testcase_14 AC 236 ms
46,840 KB
testcase_15 AC 255 ms
48,008 KB
testcase_16 AC 202 ms
44,840 KB
testcase_17 AC 450 ms
56,168 KB
testcase_18 AC 226 ms
46,776 KB
testcase_19 AC 291 ms
49,528 KB
testcase_20 AC 602 ms
68,644 KB
testcase_21 AC 600 ms
68,536 KB
testcase_22 AC 605 ms
68,536 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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
}
0