結果

問題 No.540 格子点と経路
ユーザー uwiuwi
提出日時 2017-07-01 01:55:59
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 3,811 bytes
コンパイル時間 4,247 ms
コンパイル使用メモリ 80,464 KB
実行使用メモリ 52,236 KB
最終ジャッジ日時 2024-10-04 23:22:47
合計ジャッジ時間 5,025 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 46 ms
50,232 KB
testcase_01 AC 45 ms
50,020 KB
testcase_02 AC 46 ms
50,316 KB
testcase_03 AC 46 ms
50,248 KB
testcase_04 AC 45 ms
50,180 KB
testcase_05 AC 48 ms
50,232 KB
testcase_06 WA -
testcase_07 AC 48 ms
50,056 KB
testcase_08 AC 45 ms
50,076 KB
testcase_09 AC 51 ms
49,864 KB
testcase_10 WA -
testcase_11 AC 45 ms
50,220 KB
testcase_12 WA -
testcase_13 AC 45 ms
50,328 KB
testcase_14 AC 45 ms
50,208 KB
testcase_15 WA -
testcase_16 AC 45 ms
49,668 KB
testcase_17 WA -
testcase_18 AC 47 ms
49,820 KB
testcase_19 AC 45 ms
50,056 KB
testcase_20 WA -
testcase_21 WA -
testcase_22 AC 45 ms
50,124 KB
testcase_23 AC 46 ms
50,196 KB
testcase_24 AC 48 ms
49,860 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest170630;
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 E3 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni()+1, m = ni()+1;
		if(n > m){
			int d = n; n = m; m = d;
		}
		if(n == 1){
			out.println(m > 1 ? 1 : 0);
			return;
		}
		if(n % 2 == 0 && m % 2 == 1){
			out.println((2*m-1)*(n/2)-(n/2-1));
		}else if(n % 2 == 1 && m % 2 == 0){
			out.println((2*n-1)*(m/2)-(m/2-1));
		}else if(n % 2 == 0 && m % 2 == 0){
//			tr(go(n, m), go(m, n));
			out.println(Math.max(go(n, m), go(m, n)));
		}else{
			out.println(Math.max(go2(n, m), go2(m, n)));
		}
	}
	
	long go(int n, int m)
	{
		if(n % 4 == 0){
			return 13*(n/4) + (m-4)*n - (n/4-1);
		}else{
			return 13*(n/4) + 6 + (m-4)*n - (n/4-1);
		}
	}
	
	long go2(int n, int m)
	{
		long ret = 2*n-1;
		while(m > 1 && n > 1){
			m -= 2;
			ret += 2*m-1;
			if(m == 1)break;
			n -= 2;
			ret += 2*n-1;
			if(n == 1)break;
		}
		return ret;
	}
	
	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 E3().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