結果

問題 No.607 開通777年記念
ユーザー McGregorshMcGregorsh
提出日時 2022-06-30 12:10:07
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 557 ms / 2,000 ms
コード長 2,140 bytes
コンパイル時間 173 ms
コンパイル使用メモリ 82,304 KB
実行使用メモリ 114,048 KB
最終ジャッジ日時 2024-11-24 07:13:51
合計ジャッジ時間 3,978 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 139 ms
83,328 KB
testcase_01 AC 145 ms
83,456 KB
testcase_02 AC 140 ms
83,456 KB
testcase_03 AC 141 ms
83,072 KB
testcase_04 AC 142 ms
83,584 KB
testcase_05 AC 140 ms
83,072 KB
testcase_06 AC 142 ms
83,584 KB
testcase_07 AC 214 ms
94,848 KB
testcase_08 AC 138 ms
83,584 KB
testcase_09 AC 174 ms
89,600 KB
testcase_10 AC 163 ms
89,216 KB
testcase_11 AC 557 ms
113,792 KB
testcase_12 AC 552 ms
114,048 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque, defaultdict
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement, permutations
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
def get_distance(x1, y1, x2, y2):
	  d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)
	  return d
def rotate(table):
   	  n_fild = []
   	  for x in zip(*table[::-1]):
   	  	  n_fild.append(x)
   	  return n_fild
sys.setrecursionlimit(10 ** 7)
INF = float('inf')
MOD = 10 ** 9 + 7
MOD2 = 998244353


def main():
   
   n, m = i_map()
   fild = [i_list() for i in range(m)]
   table = [[0] * n for i in range(m)]
   for i in range(n):
   	  score = 0
   	  for j in range(m):
   	  	  score += fild[j][i]
   	  	  table[j][i] = score
   
   accum_table = [[0] * n for i in range(m)]
   for i in range(m):
   	  score = 0
   	  for j in range(n):
   	  	  score += table[i][j]
   	  	  accum_table[i][j] = score 
   #print(accum_table)
   
   #print(table)
   for i in range(m):
   	  for j in range(n):
   	  	  if j == 0 or j == n-1:
   	  	  	  if accum_table[i][j] == 777:
   	  	  	  	  print('YES')
   	  	  	  	  exit()
   	  	  score = accum_table[i][j] + 777
   	  	  point = bisect_right(accum_table[i], score)
   	  	  if point <= n and accum_table[i][point-1] - accum_table[i][j] == 777:
   	  	  	  print('YES')
   	  	  	  exit()
   print('NO')
   
if __name__ == '__main__':
    main()
0