結果

問題 No.1008 Bench Craftsman
ユーザー uwiuwi
提出日時 2020-03-06 21:51:18
言語 Java21
(openjdk 21)
結果
AC  
実行時間 650 ms / 2,000 ms
コード長 4,961 bytes
コンパイル時間 5,862 ms
コンパイル使用メモリ 82,940 KB
実行使用メモリ 65,300 KB
最終ジャッジ日時 2024-04-22 07:11:54
合計ジャッジ時間 16,818 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 53 ms
50,324 KB
testcase_01 AC 55 ms
49,880 KB
testcase_02 AC 54 ms
50,308 KB
testcase_03 AC 54 ms
50,072 KB
testcase_04 AC 54 ms
50,268 KB
testcase_05 AC 596 ms
57,988 KB
testcase_06 AC 267 ms
56,172 KB
testcase_07 AC 54 ms
49,948 KB
testcase_08 AC 65 ms
50,168 KB
testcase_09 AC 416 ms
55,260 KB
testcase_10 AC 629 ms
58,632 KB
testcase_11 AC 628 ms
58,212 KB
testcase_12 AC 602 ms
58,780 KB
testcase_13 AC 574 ms
58,056 KB
testcase_14 AC 650 ms
58,684 KB
testcase_15 AC 109 ms
53,996 KB
testcase_16 AC 528 ms
57,456 KB
testcase_17 AC 110 ms
53,752 KB
testcase_18 AC 496 ms
57,768 KB
testcase_19 AC 476 ms
57,752 KB
testcase_20 AC 408 ms
57,940 KB
testcase_21 AC 357 ms
57,804 KB
testcase_22 AC 596 ms
58,880 KB
testcase_23 AC 614 ms
62,380 KB
testcase_24 AC 467 ms
58,600 KB
testcase_25 AC 310 ms
63,232 KB
testcase_26 AC 246 ms
60,952 KB
testcase_27 AC 572 ms
58,404 KB
testcase_28 AC 440 ms
57,380 KB
testcase_29 AC 566 ms
65,300 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest200306;
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 F {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), m = ni();
		int[] a = na(n);
		int[] xs = new int[m];
		int[] ws = new int[m];
		for(int i = 0;i < m;i++) {
			xs[i] = ni()-1;
			ws[i] = ni();
		}
		
		long[] oo = new long[n];
		for(int i = 0;i < m;i++) {
			oo[xs[i]] += ws[i];
		}
		boolean ook = true;
		for(int i = 0;i < n;i++) {
			if(oo[i] >= a[i]) {
				ook = false;
			}
		}
		if(!ook) {
			out.println(-1);
			return;
		}
		
		long alsum = 0;
		for(int i = 0;i < m;i++) {
			alsum += ws[i];
		}
		ook = true;
		for(int i = 0;i < n;i++) {
			if(alsum >= a[i]) {
				ook = false;
			}
		}
		if(ook) {
			out.println(0);
			return;
		}
		
//		ok(1, a, xs, ws);
		
		long low = 0, high = (long)1e14+10;
		while(high - low > 1) {
			long h = high+low>>1;
			if(ok(h, a, xs, ws)) {
				high = h;
			}else{
				low = h;
			}
		}
		out.println(high);
	}
	
	boolean ok(long h, int[] a, int[] xs, int[] ws)
	{
		int n = a.length;
		int m = xs.length;
		
		long[] imos1 = new long[n+5];
		long[] imos = new long[n+5];
		for(int i = 0;i < m;i++) {
			int x = xs[i];
			int w = ws[i];
			
			long d = w/h;
			long rem = w%h;
//			tr(x, d, w);
			if(x-d >= 0) {
				plus(imos, x-d, rem);
				plus(imos1, x-d+1, h);
				plus(imos1, x+1, -h);
			}else if(x-d+1 >= 0) {
				plus(imos, 0, rem);
				plus(imos1, x-d+1, h);
				plus(imos1, x+1, -h);
			}else {
				plus(imos, 0, rem+h*-(x-d+1));
				plus(imos1, 0, h);
				plus(imos1, x+1, -h);
			}
			plus(imos, x+d+1, -rem);
			plus(imos1, x+1, -h);
			plus(imos1, x+d+1, h);
//			tr(imos);
//			tr(imos1);
		}
		
		for(int i = 0;i < imos1.length-1;i++) {
			imos1[i+1] += imos1[i];
		}
//		tr(h, imos1);
		for(int i = 0;i < imos1.length;i++) {
			imos[i] += imos1[i];
		}
		for(int i = 0;i < imos.length-1;i++) {
			imos[i+1] += imos[i];
		}
//		tr(imos);
		for(int i = 0;i < a.length;i++) {
			if(imos[i] >= a[i])return false;
		}
		return true;
	}
	
	void plus(long[] a, long i, long x)
	{
		if(0 <= i && i < a.length)a[(int)i] += x;
	}
	
	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 F().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