結果
問題 | No.1136 Four Points Tour |
ユーザー | k |
提出日時 | 2020-08-03 22:54:06 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 2,026 bytes |
コンパイル時間 | 2,230 ms |
コンパイル使用メモリ | 206,308 KB |
実行使用メモリ | 4,352 KB |
最終ジャッジ日時 | 2023-10-11 18:43:33 |
合計ジャッジ時間 | 4,201 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,348 KB |
testcase_01 | AC | 2 ms
4,348 KB |
testcase_02 | AC | 2 ms
4,352 KB |
testcase_03 | AC | 2 ms
4,348 KB |
testcase_04 | AC | 1 ms
4,352 KB |
testcase_05 | AC | 2 ms
4,352 KB |
testcase_06 | AC | 2 ms
4,348 KB |
testcase_07 | AC | 2 ms
4,348 KB |
testcase_08 | AC | 1 ms
4,348 KB |
testcase_09 | AC | 1 ms
4,348 KB |
testcase_10 | AC | 2 ms
4,352 KB |
testcase_11 | AC | 1 ms
4,352 KB |
testcase_12 | AC | 2 ms
4,352 KB |
testcase_13 | AC | 2 ms
4,352 KB |
testcase_14 | AC | 1 ms
4,352 KB |
testcase_15 | AC | 1 ms
4,348 KB |
testcase_16 | AC | 1 ms
4,348 KB |
testcase_17 | AC | 1 ms
4,352 KB |
testcase_18 | AC | 2 ms
4,348 KB |
testcase_19 | AC | 2 ms
4,348 KB |
testcase_20 | AC | 1 ms
4,348 KB |
testcase_21 | AC | 2 ms
4,348 KB |
01_Sample03_evil.txt | AC | 1 ms
4,352 KB |
04_Rnd_large_evil1.txt | AC | 2 ms
4,348 KB |
04_Rnd_large_evil2.txt | AC | 2 ms
4,348 KB |
04_Rnd_large_evil3.txt | AC | 1 ms
4,352 KB |
04_Rnd_large_evil4.txt | AC | 2 ms
4,348 KB |
04_Rnd_large_evil5.txt | AC | 1 ms
4,348 KB |
04_Rnd_large_evil6.txt | AC | 1 ms
4,348 KB |
04_Rnd_large_evil7.txt | AC | 1 ms
4,348 KB |
04_Rnd_large_evil8.txt | AC | 1 ms
4,348 KB |
04_Rnd_large_evil9.txt | AC | 1 ms
4,348 KB |
04_Rnd_large_evil10.txt | AC | 1 ms
4,348 KB |
05_Rnd_huge_evil1.txt | AC | 2 ms
4,352 KB |
05_Rnd_huge_evil2.txt | AC | 1 ms
4,356 KB |
05_Rnd_huge_evil3.txt | AC | 2 ms
4,352 KB |
05_Rnd_huge_evil4.txt | AC | 2 ms
4,352 KB |
05_Rnd_huge_evil5.txt | AC | 1 ms
4,348 KB |
05_Rnd_huge_evil6.txt | AC | 2 ms
4,352 KB |
05_Rnd_huge_evil7.txt | AC | 2 ms
4,352 KB |
99_evil_01.txt | AC | 2 ms
4,348 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define REP(i,n) for(int i=0; i<(int)(n); i++) #define FOR(i,b,e) for (int i=(int)(b); i<(int)(e); i++) #define ALL(x) (x).begin(), (x).end() const double PI = acos(-1); typedef vector<long long> vec; typedef vector<vec> matrix; matrix eye(int n) { matrix mat(n, vec(n)); for (int i = 0; i < n; i++) { mat[i][i] = 1; } return mat; } matrix zeros(int r, int c) { return matrix(r, vec(c)); } matrix zeros(int n) { return zeros(n, n); } matrix add(const matrix &a, const matrix &b) { matrix c = zeros(a.size(), a[0].size()); for (int i = 0; i < c.size(); i++) { for (int j = 0; j < c[0].size(); j++) { c[i][j] = a[i][j] + b[i][j]; } } return c; } matrix mul(const matrix &a, const matrix &b) { matrix c = zeros(a.size(), b[0].size()); for (int i = 0; i < a.size(); i++) { for (int k = 0; k < b.size(); k++) { for (int j = 0; j < b[0].size(); j++) { c[i][j] += a[i][k] * b[k][j]; } } } return c; } matrix modmul(const matrix &a, const matrix &b, long long mod) { matrix c = zeros(a.size(), b[0].size()); for (int i = 0; i < a.size(); i++) { for (int k = 0; k < b.size(); k++) { for (int j = 0; j < b[0].size(); j++) { c[i][j] = (c[i][j] + a[i][k] * b[k][j]) % mod; } } } return c; } matrix pow(const matrix &a, long long p) { matrix ret = eye(a.size()); matrix x = a; while (p) { if (p & 1) ret = mul(ret, x); x = mul(x, x); p >>= 1; } return ret; } matrix modpow(const matrix &a, long long p, long long mod) { matrix ret = eye(a.size()); matrix x = a; while (p) { if (p & 1) ret = modmul(ret, x, mod); x = modmul(x, x, mod); p >>= 1; } return ret; } const long long MOD = 1e9 + 7; int main() { ios_base::sync_with_stdio(0); cin.tie(0); matrix x = zeros(4); REP (i, 4) REP (j, 4) x[i][j] = i != j; long long t; cin >> t; x = modpow(x, t, MOD); cout << x[0][0] << endl; return 0; }