結果
問題 | No.607 開通777年記念 |
ユーザー | McGregorsh |
提出日時 | 2022-06-30 11:49:19 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
|
実行時間 | - |
コード長 | 2,190 bytes |
コンパイル時間 | 201 ms |
コンパイル使用メモリ | 82,560 KB |
実行使用メモリ | 114,304 KB |
最終ジャッジ日時 | 2024-05-03 08:21:08 |
合計ジャッジ時間 | 9,159 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 149 ms
83,456 KB |
testcase_01 | AC | 144 ms
83,200 KB |
testcase_02 | AC | 148 ms
83,328 KB |
testcase_03 | AC | 141 ms
83,200 KB |
testcase_04 | AC | 139 ms
83,456 KB |
testcase_05 | AC | 133 ms
83,200 KB |
testcase_06 | AC | 141 ms
83,712 KB |
testcase_07 | AC | 346 ms
93,440 KB |
testcase_08 | AC | 141 ms
83,328 KB |
testcase_09 | AC | 170 ms
89,728 KB |
testcase_10 | AC | 162 ms
89,728 KB |
testcase_11 | TLE | - |
testcase_12 | TLE | - |
ソースコード
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): for k in range(j, n): if k == 0: if accum_table[i][k] == 777: print('YES') exit() if k == n-1: if accum_table[i][k] == 777: print('YES') exit() if accum_table[i][k] - accum_table[i][j] == 777: print('YES') exit() print('NO') if __name__ == '__main__': main()