結果

問題 No.655 E869120 and Good Triangles
コンテスト
ユーザー vwxyz
提出日時 2022-06-29 05:05:24
言語 Python3
(3.13.1 + numpy 2.2.1 + scipy 1.14.1)
結果
TLE  
実行時間 -
コード長 3,866 bytes
コンパイル時間 103 ms
コンパイル使用メモリ 13,440 KB
実行使用メモリ 118,912 KB
最終ジャッジ日時 2024-11-22 01:21:17
合計ジャッジ時間 72,159 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 10 TLE * 20
権限があれば一括ダウンロードができます

ソースコード

diff # 

import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines

class Cumsum:
    def __init__(self,lst,mod=0):
        self.N=len(lst)
        self.mod=mod
        self.cumsum=[0]*(self.N+1)
        self.cumsum[0]=0
        for i in range(1,self.N+1):
            self.cumsum[i]=self.cumsum[i-1]+lst[i-1]
            if self.mod:
                self.cumsum[i]%=self.mod

    def __getitem__(self,i):
        if type(i)==int:
            if 0<=i<self.N:
                a,b=i,i+1
            elif -self.N<=i<0:
                a,b=i+self.N,i+self.N+1
            else:
                raise IndexError('list index out of range')
        else:
            a,b=i.start,i.stop
            if a==None or a<-self.N:
                a=0
            elif self.N<=a:
                a=self.N
            elif a<0:
                a+=self.N
            if b==None or self.N<=b:
                b=self.N
            elif b<-self.N:
                b=0
            elif b<0:
                b+=self.N
        s=self.cumsum[b]-self.cumsum[a]
        if self.mod:
            s%=self.mod
        return s

    def __setitem__(self,i,x):
        if -self.N<=i<0:
            i+=self.N
        elif not 0<=i<self.N:
            raise IndexError('list index out of range')
        self.cumsum[i+1]=self.cumsum[i]+x
        if self.mod:
            self.cumsum[i+1]%=self.mod

    def __str__(self):
        lst=[self.cumsum[i+1]-self.cumsum[i] for i in range(self.N)]
        if self.mod:
            for i in range(self.N):
                lst[i]%=self.mod
        return "["+", ".join(map(str,lst))+"]"

N,K,P=map(int,readline().split())
inf=1<<30
A=[[inf]*(i+1) for i in range(N)]
queue=deque([])
for _ in range(K):
    x,y=map(int,readline().split())
    x-=1;y-=1
    queue.append((x,y))
    A[x][y]=0
while queue:
    x,y=queue.popleft()
    if 0<=y-1<=x-1<N and A[x][y]+1<A[x-1][y-1]:
        A[x-1][y-1]=A[x][y]+1
        queue.append((x-1,y-1))
    if 0<=y<=x-1<N and A[x][y]+1<A[x-1][y]:
        A[x-1][y]=A[x][y]+1
        queue.append((x-1,y))
    if 0<=y-1<=x<N and A[x][y]+1<A[x][y-1]:
        A[x][y-1]=A[x][y]+1
        queue.append((x,y-1))
    if 0<=y+1<=x<N and A[x][y]+1<A[x][y+1]:
        A[x][y+1]=A[x][y]+1
        queue.append((x,y+1))
    if 0<=y<=x+1<N and A[x][y]+1<A[x+1][y]:
        A[x+1][y]=A[x][y]+1
        queue.append((x+1,y))
    if 0<=y+1<=x+1<N and A[x][y]+1<A[x+1][y+1]:
        A[x+1][y+1]=A[x][y]+1
        queue.append((x+1,y+1))
AL=[[A[i][j] for j in range(i+1)] for i in range(N)]
AR=[[A[i][j] for j in range(i+1)] for i in range(N)]
for i in range(1,N):
    for j in range(i):
        AL[i][j]+=AL[i-1][j]
for i in range(1,N):
    for j in range(1,i+1):
        AR[i][j]+=AR[i-1][j-1]
for i in range(N):
    A[i]=Cumsum(A[i])
ans=0
dp=[(0,0)]
for i in range(N):
    prev=dp
    dp=[(0,0)]*(i+2)
    for j in range(i+1):
        ii,s=prev[j]
        while ii<N and s<P:
            s+=A[ii][j:j-i+ii+1]
            ii+=1
        prev[j]=(ii,s)
        if i!=N-1:
            dp[j]=max(dp[j],(ii,s-(AR[ii-1][j-i+ii-1]-(AR[i-1][j-1] if i and j else 0))))
            dp[j+1]=max(dp[j+1],(ii,s-(AL[ii-1][j]-(AL[i-1][j] if i and i!=j else 0))))
    for j in range(i+1):
        if prev[j][1]>=P:
            ans+=N-prev[j][0]+1
print(ans)
0