結果

問題 No.1034 テスターのふっぴーさん
ユーザー uwiuwi
提出日時 2020-04-24 21:25:55
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 3,515 bytes
コンパイル時間 4,008 ms
コンパイル使用メモリ 80,476 KB
実行使用メモリ 51,956 KB
最終ジャッジ日時 2024-10-15 02:21:18
合計ジャッジ時間 6,527 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 51 ms
36,640 KB
testcase_01 AC 52 ms
37,012 KB
testcase_02 AC 52 ms
36,924 KB
testcase_03 AC 52 ms
37,060 KB
testcase_04 AC 52 ms
37,084 KB
testcase_05 AC 51 ms
36,840 KB
testcase_06 AC 51 ms
36,808 KB
testcase_07 AC 52 ms
36,792 KB
testcase_08 AC 53 ms
36,784 KB
testcase_09 AC 52 ms
36,568 KB
testcase_10 AC 52 ms
36,812 KB
testcase_11 AC 53 ms
37,172 KB
testcase_12 AC 52 ms
36,532 KB
testcase_13 AC 53 ms
37,148 KB
testcase_14 AC 52 ms
36,924 KB
testcase_15 AC 54 ms
37,044 KB
testcase_16 AC 52 ms
36,780 KB
testcase_17 AC 53 ms
37,040 KB
testcase_18 AC 52 ms
36,848 KB
testcase_19 AC 52 ms
36,652 KB
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 AC 53 ms
37,160 KB
testcase_25 WA -
testcase_26 WA -
testcase_27 AC 53 ms
36,876 KB
testcase_28 WA -
testcase_29 AC 53 ms
36,496 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest200424;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class B {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		for(int T = ni();T > 0;T--){
			int n = ni(), r = ni(), c = ni();
			int phase = Math.min(Math.min(c, n-1-c), Math.min(r, n-1-r));
			long base = (long)n*n - (long)(n-phase*2)*(n-phase*2);
			if(r == phase){
				out.println(base + (c-phase));
			}else if(c == n-1-phase){
				out.println(base + n-phase*2-1 + (r-phase));
			}else if(r == n-1-phase){
				out.println(base + (n-phase*2-1)*2 + (n-1-phase-c));
			}else if(c == phase){
				out.println(base + (n-phase*2-1)*3 + (n-1-phase-r));
			}
		}
	}
	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new B().run(); }
	
	private byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	private char[][] nm(int n, int m) {
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0