結果
問題 | No.2444 一次変換と体積 |
ユーザー | risujiroh |
提出日時 | 2023-08-25 22:00:10 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 3,262 bytes |
コンパイル時間 | 2,704 ms |
コンパイル使用メモリ | 256,756 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-06-06 16:26:12 |
合計ジャッジ時間 | 3,383 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 1 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 1 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 1 ms
5,376 KB |
testcase_09 | AC | 1 ms
5,376 KB |
testcase_10 | AC | 2 ms
5,376 KB |
testcase_11 | AC | 2 ms
5,376 KB |
testcase_12 | AC | 1 ms
5,376 KB |
testcase_13 | AC | 1 ms
5,376 KB |
testcase_14 | AC | 2 ms
5,376 KB |
testcase_15 | AC | 1 ms
5,376 KB |
testcase_16 | AC | 2 ms
5,376 KB |
testcase_17 | AC | 2 ms
5,376 KB |
testcase_18 | AC | 2 ms
5,376 KB |
testcase_19 | AC | 2 ms
5,376 KB |
コンパイルメッセージ
In file included from main.cpp:7: main.cpp:43: warning: "assert" redefined 43 | #define assert(expr) (expr) || (__builtin_unreachable(), 0) | In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/cassert:44, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/x86_64-pc-linux-gnu/bits/stdc++.h:33, from main.cpp:3: /usr/include/assert.h:92: note: this is the location of the previous definition 92 | # define assert(expr) \ |
ソースコード
#if __INCLUDE_LEVEL__ == 0 #include <bits/stdc++.h> using namespace std; #include __BASE_FILE__ namespace { void solve() { int n, b; cin >> tie(n, b); atcoder::modint::set_mod(b); array<array<int64_t, 3>, 3> a; cin >> a; int64_t d = a[0][0] * a[1][1] * a[2][2] + a[0][1] * a[1][2] * a[2][0] + a[0][2] * a[1][0] * a[2][1] - a[0][0] * a[1][2] * a[2][1] - a[0][1] * a[1][0] * a[2][2] - a[0][2] * a[1][1] * a[2][0]; for (int j : rep(3)) { for (int i : rep(j)) { if (a[i] != a[j] && a[i][0] == -a[j][0] && a[i][1] == -a[j][1] && a[i][2] == -a[j][2]) { print("infty"); return; } } } print(atcoder::modint(abs(d)).pow(n)); } } // namespace int main() { ios::sync_with_stdio(false); cin.tie(nullptr); solve(); } #else // __INCLUDE_LEVEL__ #define assert(expr) (expr) || (__builtin_unreachable(), 0) #include <atcoder/modint> template <class T, class U = T> bool chmin(T& x, U&& y) { return y < x && (x = forward<U>(y), true); } template <class T, class U = T> bool chmax(T& x, U&& y) { return x < y && (x = forward<U>(y), true); } namespace std { template <class T1, class T2> istream& operator>>(istream& is, pair<T1, T2>& p) { return is >> p.first >> p.second; } template <class... Ts> istream& operator>>(istream& is, tuple<Ts...>& t) { return apply([&is](auto&... xs) -> istream& { return (is >> ... >> xs); }, t); } template <class... Ts> istream& operator>>(istream& is, tuple<Ts&...>&& t) { return is >> t; } template <class R, enable_if_t<!is_convertible_v<R, string>>* = nullptr> auto operator>>(istream& is, R&& r) -> decltype(is >> *begin(r)) { for (auto&& e : r) { is >> e; } return is; } template <class T1, class T2> ostream& operator<<(ostream& os, const pair<T1, T2>& p) { return os << p.first << ' ' << p.second; } template <class... Ts> ostream& operator<<(ostream& os, const tuple<Ts...>& t) { auto f = [&os](const auto&... xs) -> ostream& { [[maybe_unused]] auto sep = ""; ((os << exchange(sep, " ") << xs), ...); return os; }; return apply(f, t); } template <class R, enable_if_t<!is_convertible_v<R, string_view>>* = nullptr> auto operator<<(ostream& os, R&& r) -> decltype(os << *begin(r)) { auto sep = ""; for (auto&& e : r) { os << exchange(sep, " ") << e; } return os; } } // namespace std namespace atcoder { template <class T, internal::is_modint_t<T>* = nullptr> istream& operator>>(istream& is, T& x) { int v; is >> v; x = T::raw(v); return is; } template <class T, internal::is_modint_t<T>* = nullptr> ostream& operator<<(ostream& os, const T& x) { return os << x.val(); } } // namespace atcoder template <class... Ts> void print(Ts&&... xs) { cout << tie(xs...) << '\n'; } inline auto rep(int l, int r) { return views::iota(min(l, r), r); } inline auto rep(int n) { return rep(0, n); } inline auto rep1(int l, int r) { return rep(l, r + 1); } inline auto rep1(int n) { return rep(1, n + 1); } inline auto per(int l, int r) { return rep(l, r) | views::reverse; } inline auto per(int n) { return per(0, n); } inline auto per1(int l, int r) { return per(l, r + 1); } inline auto per1(int n) { return per(1, n + 1); } #endif // __INCLUDE_LEVEL__