結果
問題 | No.1136 Four Points Tour |
ユーザー | Theta |
提出日時 | 2022-10-20 18:12:46 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 1,791 ms / 2,000 ms |
コード長 | 1,901 bytes |
コンパイル時間 | 97 ms |
コンパイル使用メモリ | 10,740 KB |
実行使用メモリ | 16,620 KB |
最終ジャッジ日時 | 2023-09-12 22:38:58 |
合計ジャッジ時間 | 66,137 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 16 ms
12,592 KB |
testcase_01 | AC | 17 ms
16,620 KB |
testcase_02 | AC | 17 ms
12,468 KB |
testcase_03 | AC | 17 ms
12,464 KB |
testcase_04 | AC | 17 ms
15,324 KB |
testcase_05 | AC | 16 ms
15,168 KB |
testcase_06 | AC | 16 ms
12,452 KB |
testcase_07 | AC | 798 ms
12,624 KB |
testcase_08 | AC | 16 ms
12,604 KB |
testcase_09 | AC | 17 ms
12,424 KB |
testcase_10 | AC | 1,249 ms
12,600 KB |
testcase_11 | AC | 29 ms
12,548 KB |
testcase_12 | AC | 169 ms
12,488 KB |
testcase_13 | AC | 18 ms
16,548 KB |
testcase_14 | AC | 153 ms
12,584 KB |
testcase_15 | AC | 29 ms
12,608 KB |
testcase_16 | AC | 165 ms
12,480 KB |
testcase_17 | AC | 195 ms
12,484 KB |
testcase_18 | AC | 967 ms
12,584 KB |
testcase_19 | AC | 1,791 ms
12,608 KB |
testcase_20 | AC | 83 ms
12,476 KB |
testcase_21 | AC | 978 ms
12,612 KB |
01_Sample03_evil.txt | TLE | - |
04_Rnd_large_evil1.txt | TLE | - |
04_Rnd_large_evil2.txt | TLE | - |
04_Rnd_large_evil3.txt | TLE | - |
04_Rnd_large_evil4.txt | TLE | - |
04_Rnd_large_evil5.txt | TLE | - |
04_Rnd_large_evil6.txt | TLE | - |
04_Rnd_large_evil7.txt | TLE | - |
04_Rnd_large_evil8.txt | TLE | - |
04_Rnd_large_evil9.txt | TLE | - |
04_Rnd_large_evil10.txt | TLE | - |
05_Rnd_huge_evil1.txt | TLE | - |
05_Rnd_huge_evil2.txt | TLE | - |
05_Rnd_huge_evil3.txt | TLE | - |
05_Rnd_huge_evil4.txt | TLE | - |
05_Rnd_huge_evil5.txt | TLE | - |
05_Rnd_huge_evil6.txt | TLE | - |
05_Rnd_huge_evil7.txt | TLE | - |
99_evil_01.txt | TLE | - |
ソースコード
class Modint: MOD = int(1e9+7) def __init__(self, value: int) -> None: self.num = int(value) % self.MOD def __str__(self) -> str: return str(self.num) __repr__ = __str__ def __add__(self, __x): if isinstance(__x, Modint): return Modint((self.num + __x.num)) return Modint(self.num + __x) def __sub__(self, __x): if isinstance(__x, Modint): return Modint(self.num - __x.num) return Modint(self.num - __x) def __mul__(self, __x): if isinstance(__x, Modint): return Modint(self.num * __x.num) return Modint(self.num * __x) __radd__ = __add__ __rmul__ = __mul__ def __rsub__(self, __x): if isinstance(__x, Modint): return Modint(__x.num - self.num) return Modint(__x - self.num) def __pow__(self, __x): if isinstance(__x, Modint): return Modint(pow(self.num, __x.num, self.MOD)) return Modint(pow(self.num, __x, self.MOD)) def __rpow__(self, __x): if isinstance(__x, Modint): return Modint(pow(__x.num, self.num, self.MOD)) return Modint(pow(__x, self.num, self.MOD)) def __truediv__(self, __x): if isinstance(__x, Modint): return Modint(self.num * pow(__x.num, self.MOD - 2, self.MOD)) return Modint(self.num * pow(__x, self.MOD - 2, self.MOD)) def __rtruediv__(self, __x): if isinstance(__x, Modint): return Modint(__x.num * pow(self.num, self.MOD - 2, self.MOD)) return Modint(__x * pow(self.num, self.MOD - 2, self.MOD)) def main(): N = int(input()) A_patterns = Modint(1) other_patterns = Modint(0) for second in range(N): A_patterns, other_patterns = other_patterns*3, A_patterns + other_patterns*2 print(A_patterns) if __name__ == "__main__": main()