結果

問題 No.1015 おつりは要らないです
ユーザー uwiuwi
提出日時 2020-04-03 22:44:37
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,423 bytes
コンパイル時間 4,648 ms
コンパイル使用メモリ 80,808 KB
実行使用メモリ 57,656 KB
最終ジャッジ日時 2024-07-03 05:11:12
合計ジャッジ時間 11,344 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 52 ms
37,008 KB
testcase_01 AC 52 ms
37,008 KB
testcase_02 AC 53 ms
37,068 KB
testcase_03 AC 52 ms
37,004 KB
testcase_04 AC 53 ms
36,840 KB
testcase_05 AC 53 ms
36,812 KB
testcase_06 AC 52 ms
36,840 KB
testcase_07 AC 52 ms
36,908 KB
testcase_08 AC 54 ms
36,812 KB
testcase_09 AC 53 ms
36,792 KB
testcase_10 AC 254 ms
44,328 KB
testcase_11 AC 235 ms
44,256 KB
testcase_12 AC 237 ms
43,780 KB
testcase_13 AC 266 ms
45,128 KB
testcase_14 AC 238 ms
47,312 KB
testcase_15 AC 236 ms
44,068 KB
testcase_16 AC 228 ms
43,988 KB
testcase_17 AC 241 ms
44,348 KB
testcase_18 AC 228 ms
44,172 KB
testcase_19 AC 226 ms
44,216 KB
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 AC 52 ms
37,176 KB
testcase_31 AC 130 ms
42,672 KB
testcase_32 AC 123 ms
42,876 KB
testcase_33 AC 154 ms
43,056 KB
testcase_34 AC 53 ms
37,060 KB
testcase_35 WA -
testcase_36 AC 53 ms
37,044 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

public class A {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int[] x = na(3);
		int[] a = na(n);
		for(int i = 0;i < n;i++)a[i]++;
		
		x[1] += denom(a, 1000, 5000, x[0])/5;
		x[2] += denom(a, 5000, 10000, x[1])/2;
		long need = 0;
		for(int i = 0;i < n;i++){
			need += (a[i]+10000-1)/10000;
		}

		out.println(x[2] >= need ? "Yes" : "No");
	}
	
	int denom(int[] a, int u, int v, int x)
	{
		int n = a.length;
		for(int i = 0;i < n;i++){
			a[i] = (a[i]+u-1)/u*u;
		}
		int[][] ai = new int[n][];
		for(int i = 0;i < n;i++){
			int t = a[i] % v / u;
			ai[i] = new int[]{t, i};
		}
		Arrays.sort(ai, new Comparator<int[]>() {
			public int compare(int[] a, int[] b) {
				return a[0] - b[0];
			}
		});
		for(int i = 0;i < n;i++){
			int mi = Math.min(x, ai[i][0]);
			a[ai[i][1]] -= u * mi;
			x -= mi;
		}
		return x;
	}
	
	public static int[] radixSort(int[] f){ return radixSort(f, f.length); }
	public static int[] radixSort(int[] f, int n)
	{
		int[] to = new int[n];
		{
			int[] b = new int[65537];
			for(int i = 0;i < n;i++)b[1+(f[i]&0xffff)]++;
			for(int i = 1;i <= 65536;i++)b[i]+=b[i-1];
			for(int i = 0;i < n;i++)to[b[f[i]&0xffff]++] = f[i];
			int[] d = f; f = to;to = d;
		}
		{
			int[] b = new int[65537];
			for(int i = 0;i < n;i++)b[1+(f[i]>>>16)]++;
			for(int i = 1;i <= 65536;i++)b[i]+=b[i-1];
			for(int i = 0;i < n;i++)to[b[f[i]>>>16]++] = f[i];
			int[] d = f; f = to;to = d;
		}
		return f;
	}

	
	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 A().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