結果

問題 No.398 ハーフパイプ(2)
ユーザー uwiuwi
提出日時 2016-07-15 23:08:28
言語 Java21
(openjdk 21)
結果
AC  
実行時間 156 ms / 2,000 ms
コード長 3,853 bytes
コンパイル時間 3,634 ms
コンパイル使用メモリ 77,436 KB
実行使用メモリ 54,248 KB
最終ジャッジ日時 2023-09-09 22:02:15
合計ジャッジ時間 6,597 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 46 ms
49,408 KB
testcase_01 AC 154 ms
54,196 KB
testcase_02 AC 126 ms
53,848 KB
testcase_03 AC 113 ms
53,880 KB
testcase_04 AC 123 ms
53,892 KB
testcase_05 AC 136 ms
54,136 KB
testcase_06 AC 106 ms
53,916 KB
testcase_07 AC 113 ms
53,900 KB
testcase_08 AC 156 ms
54,080 KB
testcase_09 AC 132 ms
54,172 KB
testcase_10 AC 136 ms
54,076 KB
testcase_11 AC 136 ms
54,248 KB
testcase_12 AC 128 ms
53,832 KB
testcase_13 AC 129 ms
53,864 KB
testcase_14 AC 122 ms
53,760 KB
testcase_15 AC 147 ms
54,048 KB
testcase_16 AC 129 ms
53,856 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest;
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 Q819_2 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		double x = nd() * 4;
		long r = Math.round(x);
		if(Math.abs(r-x) > 0.0001){
			out.println(0);
		}else{
			long ret = 0;
			for(int min = 0;min <= 100;min++){
				for(int max = min;max <= 100;max++){
					int s = min+max+(int)r;
					int ss = s - min*6;
					if(ss < max-min)continue;
					long plus = count(ss, max-min) - count(ss, max-min-1) - count(ss-6, max-min-1) + count(ss-6, max-min-2);
					ret += plus;
				}
			}
			out.println(ret);
		}
	}
	
	long count(int num, int sup)
	{
		if(num < 0)return 0;
		if(sup < 0)return 0;
		long[] pre = new long[num+1];
		long[] cur = new long[num+1];
		pre[0] = 1;
		for(int d = 1;d <= 6;d++){
			long c = 0;
			for(int i = 0;i <= num;i++){
				c += pre[i];
				if(i-sup-1 >= 0)c -= pre[i-sup-1];
				cur[i] = c;
			}
			long[] dum = pre; pre = cur; cur = dum;
		}
		return pre[num];
	}
	
	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 Q819_2().run(); }
	
	private byte[] inbuf = new byte[1024];
	private 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