#49617 (Java21) No.281 門松と魔法(1)

提出ソース

結果

問題	No.281 門松と魔法(1)
ユーザー	uwi
提出日時	2015-09-18 22:43:22
言語	Java21 (openjdk 21)
結果	WA
実行時間	-
コード長	3,793 bytes
コンパイル時間	4,245 ms
コンパイル使用メモリ	82,108 KB
実行使用メモリ	37,176 KB
最終ジャッジ日時	2024-11-06 18:42:33
合計ジャッジ時間	8,707 ms
ジャッジサーバーID （参考情報）	judge4 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	51 ms 37,012 KB
testcase_01	AC	51 ms 36,956 KB
testcase_02	AC	51 ms 37,100 KB
testcase_03	AC	52 ms 36,820 KB
testcase_04	AC	51 ms 37,048 KB
testcase_05	AC	53 ms 36,800 KB
testcase_06	AC	56 ms 36,988 KB
testcase_07	AC	53 ms 36,648 KB
testcase_08	AC	52 ms 37,048 KB
testcase_09	AC	53 ms 37,000 KB
testcase_10	AC	52 ms 37,176 KB
testcase_11	AC	51 ms 37,040 KB
testcase_12	AC	51 ms 36,776 KB
testcase_13	AC	51 ms 36,820 KB
testcase_14	AC	51 ms 36,776 KB
testcase_15	AC	51 ms 36,788 KB
testcase_16	AC	50 ms 36,528 KB
testcase_17	AC	52 ms 37,088 KB
testcase_18	AC	51 ms 37,040 KB
testcase_19	AC	51 ms 36,648 KB
testcase_20	AC	52 ms 36,848 KB
testcase_21	AC	52 ms 37,000 KB
testcase_22	AC	52 ms 37,040 KB
testcase_23	AC	52 ms 37,084 KB
testcase_24	AC	53 ms 36,432 KB
testcase_25	AC	53 ms 37,092 KB
testcase_26	AC	52 ms 37,100 KB
testcase_27	AC	52 ms 37,068 KB
testcase_28	AC	52 ms 37,024 KB
testcase_29	AC	52 ms 36,776 KB
testcase_30	AC	52 ms 37,052 KB
testcase_31	WA	-
testcase_32	AC	51 ms 36,736 KB
testcase_33	AC	50 ms 36,648 KB
testcase_34	AC	53 ms 36,624 KB
testcase_35	AC	51 ms 37,040 KB
testcase_36	AC	51 ms 36,972 KB
testcase_37	AC	52 ms 36,800 KB
testcase_38	AC	52 ms 36,720 KB
testcase_39	AC	53 ms 36,820 KB
testcase_40	AC	51 ms 36,872 KB
testcase_41	WA	-
testcase_42	AC	51 ms 36,528 KB
testcase_43	AC	51 ms 36,800 KB
testcase_44	AC	51 ms 37,100 KB
testcase_45	AC	53 ms 36,972 KB
testcase_46	AC	51 ms 36,656 KB
testcase_47	AC	51 ms 36,728 KB
testcase_48	AC	52 ms 36,872 KB
testcase_49	AC	53 ms 36,616 KB
testcase_50	WA	-
testcase_51	AC	53 ms 36,768 KB
testcase_52	AC	52 ms 36,696 KB
testcase_53	AC	53 ms 36,992 KB
testcase_54	AC	51 ms 36,892 KB
testcase_55	AC	51 ms 36,916 KB
testcase_56	AC	51 ms 37,052 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

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 Q661 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int d = ni();
		int[] a = na(3);
		if(d == 0){
			if(a[0] != a[1] && a[1] != a[2] && a[2] != a[0]){
				out.println(0);
			}else{
				out.println(-1);
			}
			return;
		}
		
		long min = Long.MAX_VALUE;
		{
			int[] b = Arrays.copyOf(a, 3);
			long num = 0;
			for(int i = 0;i < 3;i+=2){
				if(b[i] >= b[1]){
					num += (b[i]-b[1])/d+1;
					b[i] = b[i]-((b[i]-b[1])/d+1)*d;
					if(b[i] < 0)b[i] = 0;
				}
			}
			if(b[0] == b[2] && b[0] > 0){
				num++;
			}
			if(b[0] == b[1] || b[1] == b[2] || b[2] == b[0]){
			}else{
				min = Math.min(min, num);
			}
		}
		{
			int[] b = Arrays.copyOf(a, 3);
			long num = 0;
			if(b[0] == b[2]){
				b[0] = Math.max(0, b[0]-d);
				num++;
			}
			if(b[1]-Math.min(b[0],b[2]) >= 0){
				num += (b[1]-Math.min(b[0],b[2]))/d+1;
				b[1] = b[1] - ((b[1]-Math.min(b[0],b[2]))/d+1)*d;
				b[1] = Math.max(b[1], 0);
			}
			if(b[0] == b[1] || b[1] == b[2] || b[2] == b[0]){
			}else{
				min = Math.min(min, num);
			}
		}
		out.println(min == Long.MAX_VALUE ? -1 : min);
	}
	
	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");
	}
	
	public static void main(String[] args) throws Exception { new Q661().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 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[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private 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 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)); }
}

yukicoder

結果

テストケース

ソースコード