結果

問題 No.149 碁石の移動
ユーザー uwi
提出日時 2015-02-12 23:53:09
言語 Java8
(openjdk 1.8.0.222)
結果
AC  
実行時間 84 ms
コード長 3,487 Byte
コンパイル時間 2,755 ms
使用メモリ 19,516 KB
最終ジャッジ日時 2019-12-06 23:10:30

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
99_system_test1.txt AC 80 ms
19,512 KB
99_system_test2.txt AC 79 ms
19,512 KB
sample1.txt AC 79 ms
19,512 KB
sample2.txt AC 79 ms
19,516 KB
sample3.txt AC 81 ms
19,512 KB
sample4.txt AC 79 ms
19,512 KB
system_test1.txt AC 79 ms
19,512 KB
test1.txt AC 83 ms
19,508 KB
test2.txt AC 81 ms
19,508 KB
test3.txt AC 84 ms
19,512 KB
test4.txt AC 84 ms
19,508 KB
test5.txt AC 81 ms
19,512 KB
test6.txt AC 84 ms
19,512 KB
test7.txt AC 78 ms
19,512 KB
test8.txt AC 77 ms
19,512 KB
test9.txt AC 80 ms
19,508 KB
test10.txt AC 79 ms
19,516 KB
テストケース一括ダウンロード

ソースコード

diff #
package q3xx;
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 Q295 {
	static InputStream is;
	static PrintWriter out;
	static String INPUT = "";
	
	static void solve()
	{
		int aw = ni(), ab = ni(), bw = ni(), bb = ni(), c = ni(), d = ni();
		{
			int n = Math.min(ab, c);
			ab -= n;
			bb += n;
			c -= n;
		}
		aw -= c;
		bw += c;
		
		{
			int n = Math.min(bw, d);
			aw += n;
		}
		out.println(aw);
	}
	
	public static void main(String[] args) throws Exception
	{
		long S = System.currentTimeMillis();
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		solve();
		out.flush();
		long G = System.currentTimeMillis();
		tr(G-S+"ms");
	}
	
	private static boolean eof()
	{
		if(lenbuf == -1)return true;
		int lptr = ptrbuf;
		while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;
		
		try {
			is.mark(1000);
			while(true){
				int b = is.read();
				if(b == -1){
					is.reset();
					return true;
				}else if(!isSpaceChar(b)){
					is.reset();
					return false;
				}
			}
		} catch (IOException e) {
			return true;
		}
	}
	
	private static byte[] inbuf = new byte[1024];
	static int lenbuf = 0, ptrbuf = 0;
	
	private static 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 static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private static double nd() { return Double.parseDouble(ns()); }
	private static char nc() { return (char)skip(); }
	
	private static 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 static 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 static 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 static int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private static int ni()
	{
		int num = 0, 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 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) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}
0