結果

問題 No.655 E869120 and Good Triangles
ユーザー uwiuwi
提出日時 2018-02-23 23:02:59
言語 Java21
(openjdk 21)
結果
AC  
実行時間 2,169 ms / 2,500 ms
コード長 5,169 bytes
コンパイル時間 5,066 ms
コンパイル使用メモリ 87,592 KB
実行使用メモリ 368,948 KB
最終ジャッジ日時 2024-10-10 03:09:31
合計ジャッジ時間 41,812 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 57 ms
49,868 KB
testcase_01 AC 56 ms
49,972 KB
testcase_02 AC 57 ms
50,080 KB
testcase_03 AC 57 ms
49,828 KB
testcase_04 AC 58 ms
50,108 KB
testcase_05 AC 55 ms
49,992 KB
testcase_06 AC 55 ms
50,012 KB
testcase_07 AC 57 ms
50,388 KB
testcase_08 AC 57 ms
50,240 KB
testcase_09 AC 57 ms
50,252 KB
testcase_10 AC 2,064 ms
368,948 KB
testcase_11 AC 1,983 ms
360,476 KB
testcase_12 AC 2,037 ms
362,312 KB
testcase_13 AC 2,000 ms
368,684 KB
testcase_14 AC 1,876 ms
368,692 KB
testcase_15 AC 2,141 ms
368,636 KB
testcase_16 AC 2,169 ms
360,632 KB
testcase_17 AC 2,167 ms
358,140 KB
testcase_18 AC 2,088 ms
360,484 KB
testcase_19 AC 2,091 ms
368,648 KB
testcase_20 AC 1,956 ms
368,668 KB
testcase_21 AC 2,118 ms
368,856 KB
testcase_22 AC 1,969 ms
368,620 KB
testcase_23 AC 1,965 ms
368,584 KB
testcase_24 AC 1,155 ms
367,404 KB
testcase_25 AC 1,086 ms
366,152 KB
testcase_26 AC 1,123 ms
366,108 KB
testcase_27 AC 1,260 ms
368,056 KB
testcase_28 AC 1,150 ms
355,020 KB
testcase_29 AC 1,108 ms
367,488 KB
testcase_30 AC 55 ms
50,060 KB
testcase_31 AC 55 ms
49,924 KB
testcase_32 AC 56 ms
50,096 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest180223;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Queue;

public class E {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), K = ni();
		long P = nl();
		if(P == 0){
			out.println((long)n*(n+1)*(n+2)/6);
			return;
		}
		int[][] d = new int[n][n];
		for(int i = 0;i < n;i++){
			Arrays.fill(d[i], 999999999);
		}
		Queue<Integer> q = new ArrayDeque<>();
		for(int i = 0;i < K;i++){
			int r = ni()-1, c = ni()-1;
			d[r][c] = 0;
			q.add(r<<16|c);
		}
		int[] dr = { 1, 1, 0, 0, -1, -1 };
		int[] dc = { 0, 1, 1, -1, -1, 0};
		while(!q.isEmpty()){
			int cur = q.poll();
			int r = cur>>>16, c = cur&65535;
			for(int k = 0;k < 6;k++){
				int nr = r + dr[k], nc = c + dc[k];
				if(nr >= 0 && nr < n && nc >= 0 && nc <= nr && d[nr][nc] > d[r][c] + 1){
					d[nr][nc] = d[r][c] + 1;
					q.add(nr<<16|nc);
				}
			}
		}
		
		int[][] rsum = new int[n+1][n+1];
		for(int i = 0;i < n;i++){
			for(int j = 0;j <= i;j++){
				rsum[i+1][j+1] = rsum[i][j] + d[i][j];
			}
		}
		
		int[][] lsum = new int[n+1][n+1];
		for(int i = 0;i < n;i++){
			for(int j = 0;j <= i;j++){
				lsum[i+1][j+1] = lsum[i][j+1] + d[i][j];
			}
		}
		
		int[][] vsum = new int[n+1][n+1];
		for(int i = 0;i < n;i++){
			for(int j = 0;j <= i;j++){
				vsum[i+1][j+1] = vsum[i+1][j] + d[i][j];
			}
		}
//		tr(d);
//		tr(rsum);
//		tr(lsum);
//		tr(vsum);
		
		ans = 0;
		dfs(0, 0, 0, rsum, lsum, vsum, n, 0L, P);
		out.println(ans);
	}
	
	long ans = 0;
	
	void dfs(int r, int c, int b, int[][] rsum, int[][] lsum, int[][] vsum, int n, long S, long P)
	{
		if(r == n)return;
		while(S < P && b < n){
			S += vsum[b+1][c+b-r+1] - vsum[b+1][c];
			b++;
		}
		if(S < P)return;
		ans += n-b+1;
		dfs(r+1, c, b, rsum, lsum, vsum, n, S - rsum[b-1+1][c+b-1-r+1] + rsum[r][c], P);
		if(r == c){
			dfs(r+1, c+1, b, rsum, lsum, vsum, n, S - lsum[b-1+1][c+1] + lsum[r][c+1], P);
		}
	}
	
	void run() throws Exception
	{
//		int n = 4000, m = 1;
//		Random gen = new Random();
//		StringBuilder sb = new StringBuilder();
//		sb.append(n + " ");
//		sb.append(m + " ");
//		sb.append(0L + " ");
//		for (int i = 0; i < m; i++) {
//			int v1 = gen.nextInt(n);
//			int v2 = gen.nextInt(v1+1);
//			sb.append(v1 + 1 + " ");
//			sb.append(v2 + 1 + " ");
//		}
//		INPUT = sb.toString();

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