Submission #1191758
Source Code Expand
// need
#include <iostream>
#include <algorithm>
// data structure
#include <bitset>
//#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
//#include <array>
//#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <complex>
//#include <deque>
#include<valarray>
// stream
//#include <istream>
//#include <sstream>
//#include <ostream>
// etc
#include <cassert>
#include <functional>
#include <iomanip>
//#include <typeinfo>
#include <chrono>
#include <random>
#include <numeric>
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);
template<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }
template<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }
#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int i=0; i<n; ++i){MACRO_VEC_ROW_Scan(i, __VA_ARGS__);}
template<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }
template<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }
#define OUT(d) std::cout<<d;
#define FOUT(n, d) std::cout<<std::fixed<<std::setprecision(n)<<d;
#define SOUT(n, c, d) std::cout<<std::setw(n)<<std::setfill(c)<<d;
#define SP std::cout<<" ";
#define TAB std::cout<<"\t";
#define BR std::cout<<"\n";
#define ENDL std::cout<<std::endl;
#define FLUSH std::cout<<std::flush;
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& r:c)for(auto& i:r)std::cin>>i;
#define ALL(a) (a).begin(),(a).end()
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i)
#define REP(i, n) for(int i=0;i<int(n);++i)
#define RREP(i, n) for(int i=(n)-1;i>=0;--i)
#define FORLL(i, a, b) for(ll i=ll(a);i<ll(b);++i)
#define RFORLL(i, a, b) for(ll i=ll(b)-1;i>=ll(a);--i)
#define REPLL(i, n) for(ll i=0;i<ll(n);++i)
#define RREPLL(i, n) for(ll i=ll(n)-1;i>=0;--i)
#define PAIR std::pair<int, int>
#define PAIRLL std::pair<ll, ll>
#define IN(a, x, b) (a<=x && x<b)
#define SHOW(d) {std::cerr << #d << "\t:" << d << "\n";}
#define SHOWVECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOWVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << " ";}std::cerr << "\n";}}
#define SHOWPAIR(p) {std::cerr << #p << "\t:(" << p.first << ",\t" << p.second << ")\n";}
#define SHOWPAIRVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr<<'('<<yyy.first<<", "<<yyy.second<<") ";}std::cerr << "\n";}}
#define SHOWPAIRVECTOR(v) {for(const auto& xxx:v){std::cerr<<'('<<xxx.first<<", "<<xxx.second<<") ";}std::cerr<<"\n";}
#define SHOWQUEUE(a) {std::queue<decltype(a.front())> tmp(a);std::cerr << #a << "\t:";for(int i=0; i<static_cast<int>(a.size()); ++i){std::cerr << tmp.front() << "\n";tmp.pop();}std::cerr << "\n";}
template<typename T> inline T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; }
template<typename T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }
#define EXCEPTION(msg) throw std::string("Exception : " msg " [ in ") + __func__ + " : " + std::to_string(__LINE__) + " lines ]"
#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}
void CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); std::cerr << "[Time:" << res << "ns (" << res / (1.0e9) << "s)]\n"; }
#define int ll
using ll = long long;
using ull = unsigned long long;
constexpr int INFINT = 1 << 30; // 1.07x10^ 9
constexpr int INFINT_LIM = (1LL << 31) - 1; // 2.15x10^ 9
constexpr ll INFLL = 1LL << 60; // 1.15x10^18
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62); // 9.22x10^18
constexpr double EPS = 1e-7;
constexpr int MOD = 1000000007;
constexpr double PI = 3.141592653589793238462643383279;
template<class T>
class Matrix {
private:
std::valarray<std::valarray<T>> mat;
public:
Matrix(size_t m = 0, size_t n = 0, T init = 0) {
if (n == 0) n = m;
mat.resize(m);
for (size_t i = 0; i < m; ++i) mat[i].resize(n, init);
}
Matrix(std::valarray<std::valarray<T>> a) { mat = a; }
Matrix<T> init(size_t m = 0, size_t n = 0, T init = 0) {
if (n == 0) n = m;
mat.resize(m);
for (size_t i = 0; i < m; ++i) mat[i].resize(n, init);
return *this;
}
std::valarray<T>& operator[](size_t i) { return mat[i]; }
const std::valarray<T>& operator[](size_t i) const { return mat[i]; }
Matrix<T>& operator=(const Matrix<T>& r) {
for (size_t i = 0; i < mat.size(); ++i) mat[i] = r[i];
return *this;
}
bool operator==(const Matrix<T>& r) const {
REP(i, mat.size()) REP(j, mat[0].size()) {
if (mat[i][j] != r.mat[i][j]) return false;
}
return true;
}
bool operator!=(const Matrix<T>& r) const {
return !(*this == r);
}
Matrix<T> operator+() const { return mat; }
Matrix<T> operator-() const {
Matrix<T> res(mat.size());
for (size_t i = 0; i < mat.size(); ++i) res[i] = -mat[i];
return res;
}
Matrix<T>& operator+=(const Matrix<T>& r) {
for (size_t i = 0; i < mat.size(); ++i) mat[i] += r[i];
return *this;
}
Matrix<T>& operator+=(const T& x) {
for (size_t i = 0; i < mat.size(); ++i) mat[i] += x;
return *this;
}
Matrix<T>& operator-=(const Matrix<T>& r) { return *this += -r; }
Matrix<T>& operator-=(const T& x) { return *this += -x; }
Matrix<T>& operator*=(const Matrix<T>& r) { // O(N^3)
Matrix<T> res(mat.size(), r[0].size());
for (size_t i = 0; i < mat.size(); ++i) {
for (size_t j = 0; j < r[0].size(); ++j) {
for (size_t k = 0; k < mat[0].size(); ++k) {
res[i][j] += mat[i][k] * r[k][j];
}
}
}
return *this = res;
}
Matrix<T>& operator*=(const T& x) {
for (size_t i = 0; i < mat.size(); ++i) mat[i] *= x;
return *this;
}
Matrix<T>& operator^=(ll p) { // O(N^3 logP)
Matrix<T> res(mat.size());
for (size_t i = 0; i < mat.size(); ++i) res[i][i] = 1;
while (p) {
if (p & 1) res *= (*this);
(*this) *= (*this);
p >>= 1;
}
for (size_t i = 0; i < mat.size(); ++i) mat[i] = res[i];
return *this;
}
Matrix<T> operator+(const Matrix& r) const {
Matrix<T> res(mat);
return res += r;
}
Matrix<T> operator-(const Matrix& r) const {
Matrix<T> res(mat);
return res -= r;
}
Matrix<T> operator*(const Matrix& r) const {
Matrix<T> res(mat);
return res *= r;
}
Matrix<T> operator*(const T& r) const {
Matrix<T> res(mat);
return res *= r;
}
Matrix<T> operator^(const int& p) const {
Matrix<T> res(mat);
return res ^= p;
}
Matrix<T> t() const {
Matrix<T> res(mat[0].size(), mat.size(), 0);
for (size_t i = 0; i < mat[0].size(); ++i) {
for (size_t j = 0; j < mat.size(); ++j) {
res[i][j] = mat[j][i];
}
}
return res;
}
double det() const {
TRY(mat.size() != mat[0].size(), "Matrix is not square.");
Matrix<double> a(mat.size());
for (size_t i = 0; i < mat.size(); ++i) {
for (size_t j = 0; j < mat.size(); ++j) {
a[i][j] = static_cast<double>(mat[i][j]);
}
}
double d = 1;
for (int i = 0; i < mat.size(); ++i) {
int pivot = i;
for (size_t j = i + 1; j < mat.size(); ++j) {
if (std::abs(a[j][i]) > std::abs(a[pivot][i])) pivot = j;
}
std::swap(a[pivot], a[i]);
d *= a[i][i] * ((i != pivot) ? -1 : 1);
if (std::abs(a[i][i]) < EPS) break;
for (size_t j = i + 1; j < mat.size(); ++j) {
for (int k = mat.size() - 1; k >= i; --k) {
a[j][k] -= a[i][k] * a[j][i] / a[i][i];
}
}
}
return d;
}
T tr() const {
T res = 0;
for (size_t i = 0; i < mat.size(); ++i) {
res += mat[i][i];
}
return res;
}
size_t rank() const {
Matrix<double> a(mat.size());
for (size_t i = 0; i < mat.size(); ++i) {
for (size_t j = 0; j < mat.size(); ++j) {
a[i][j] = static_cast<double>(mat[i][j]);
}
}
size_t r = 0;
for (int i = 0; r < static_cast<int>(mat.size()) && i < static_cast<int>(mat[0].size()); ++i) {
int pivot = r;
for (size_t j = r + 1; j < mat.size(); ++j) {
if (std::abs(a[j][i]) > std::abs(a[pivot][i])) pivot = j;
}
std::swap(a[pivot], a[r]);
if (std::abs(a[r][i]) < EPS) continue;
for (int k = mat[0].size() - 1; k >= i; --k) {
a[r][k] /= a[r][i];
}
for (size_t j = r + 1; j < mat.size(); ++j) {
for (size_t k = i; k < mat[0].size(); ++k) {
a[j][k] -= a[r][k] * a[j][i];
}
}
++r;
}
return r;
}
static Matrix<T> getUnit(size_t n) {
Matrix<T> res(n, n, 0);
for (size_t i = 0; i < n; ++i) res[i][i] = 1;
return res;
}
void show() const {
for (const auto& r : mat) {
for (const auto & x : r) {
std::cerr << x << "\t";
}
std::cerr << std::endl;
}
}
};
signed main() {
INIT;
VAR(int, n);
Matrix<int> a(n, n), b(n, n), c(n, n);
REP(i, n) REP(j, n) std::cin >> a[i][j];
REP(i, n) REP(j, n) std::cin >> b[i][j];
REP(i, n) REP(j, n) std::cin >> c[i][j];
if (n == 1) {
OUT(((a*b == c) ? "YES" : "NO"))BR;
return 0;
}
std::random_device rnd;
std::mt19937 mt(rnd());
std::uniform_int_distribution<> rand(/* min */-1000, /* max */1000);
REP(_, 100) {
Matrix<int> x(n, 1);
REP(i, n) x[i][0] = rand(mt);
Matrix<int> p(a*(b*x));
Matrix<int> q(c*x);
if (p != q) {
OUT("NO")BR;
return 0;
}
}
OUT("YES")BR;
return 0;
}
Submission Info
Submission Time |
|
Task |
D - A mul B Problem |
User |
satanic0258 |
Language |
C++14 (Clang 3.8.0) |
Score |
99 |
Code Size |
10311 Byte |
Status |
TLE |
Exec Time |
5177 ms |
Memory |
39632 KB |
Judge Result
Set Name |
Partial 1 |
All |
Score / Max Score |
99 / 99 |
0 / 1 |
Status |
|
|
Set Name |
Test Cases |
Partial 1 |
0_00_sample_00, 0_10_Random_00_0001, 0_20_Same_00_0001, 0_20_Same_01_0001, 0_20_Same_02_0001, 0_20_Same_03_0001, 0_20_Same_04_0001, 0_20_Same_05_0001, 0_20_Same_06_0001, 0_20_Same_07_0001, 0_20_Same_08_0001, 0_20_Same_09_0001 |
All |
0_00_sample_00, 0_10_Random_00_0001, 0_20_Same_00_0001, 0_20_Same_01_0001, 0_20_Same_02_0001, 0_20_Same_03_0001, 0_20_Same_04_0001, 0_20_Same_05_0001, 0_20_Same_06_0001, 0_20_Same_07_0001, 0_20_Same_08_0001, 0_20_Same_09_0001, 1_00_sample_01, 1_00_sample_02, 1_10_Random_01_0010, 1_10_Random_02_0010, 1_10_Random_03_0005, 1_10_Random_04_0038, 1_10_Random_05_0036, 1_10_Random_06_0021, 1_10_Random_07_0507, 1_10_Random_08_0922, 1_10_Random_09_0182, 1_10_Random_10_0923, 1_10_Random_11_0606, 1_10_Random_12_0921, 1_20_Same_10_0002, 1_20_Same_11_0003, 1_20_Same_12_0006, 1_20_Same_13_0077, 1_20_Same_14_0024, 1_20_Same_15_0082, 1_20_Same_16_0208, 1_20_Same_17_0497, 1_20_Same_18_0907, 1_20_Same_19_0126, 1_20_Same_20_0106, 1_20_Same_21_0756, 1_20_Same_22_1000, 1_20_Same_23_1000, 1_20_Same_24_1000, 1_20_Same_25_1000, 1_20_Same_26_1000, 1_30_Yes_00_0004, 1_30_Yes_01_0003, 1_30_Yes_02_0003, 1_30_Yes_03_0031, 1_30_Yes_04_0028, 1_30_Yes_05_0080, 1_30_Yes_06_0965, 1_30_Yes_07_0750, 1_30_Yes_08_0842, 1_30_Yes_09_0525, 1_30_Yes_10_0160, 1_30_Yes_11_0497, 1_30_Yes_12_1000, 1_30_Yes_13_1000, 1_30_Yes_14_1000, 1_30_Yes_15_1000, 1_30_Yes_16_1000, 1_40_Zero_00_0004, 1_40_Zero_01_0008, 1_40_Zero_02_0008, 1_40_Zero_03_0094, 1_40_Zero_04_0080, 1_40_Zero_05_0023, 1_40_Zero_06_0514, 1_40_Zero_07_0167, 1_40_Zero_08_0564, 1_40_Zero_09_0561, 1_40_Zero_10_0182, 1_40_Zero_11_0735 |
Case Name |
Status |
Exec Time |
Memory |
0_00_sample_00 |
AC |
1 ms |
256 KB |
0_10_Random_00_0001 |
AC |
1 ms |
256 KB |
0_20_Same_00_0001 |
AC |
1 ms |
256 KB |
0_20_Same_01_0001 |
AC |
1 ms |
256 KB |
0_20_Same_02_0001 |
AC |
1 ms |
256 KB |
0_20_Same_03_0001 |
AC |
1 ms |
256 KB |
0_20_Same_04_0001 |
AC |
1 ms |
256 KB |
0_20_Same_05_0001 |
AC |
1 ms |
256 KB |
0_20_Same_06_0001 |
AC |
1 ms |
256 KB |
0_20_Same_07_0001 |
AC |
1 ms |
256 KB |
0_20_Same_08_0001 |
AC |
1 ms |
256 KB |
0_20_Same_09_0001 |
AC |
1 ms |
256 KB |
1_00_sample_01 |
AC |
1 ms |
256 KB |
1_00_sample_02 |
AC |
2 ms |
256 KB |
1_10_Random_01_0010 |
AC |
1 ms |
256 KB |
1_10_Random_02_0010 |
AC |
1 ms |
256 KB |
1_10_Random_03_0005 |
AC |
1 ms |
256 KB |
1_10_Random_04_0038 |
AC |
4 ms |
384 KB |
1_10_Random_05_0036 |
AC |
4 ms |
384 KB |
1_10_Random_06_0021 |
AC |
2 ms |
256 KB |
1_10_Random_07_0507 |
AC |
494 ms |
10444 KB |
1_10_Random_08_0922 |
AC |
1624 ms |
33696 KB |
1_10_Random_09_0182 |
AC |
65 ms |
1648 KB |
1_10_Random_10_0923 |
AC |
1135 ms |
33792 KB |
1_10_Random_11_0606 |
AC |
490 ms |
14744 KB |
1_10_Random_12_0921 |
AC |
1132 ms |
33648 KB |
1_20_Same_10_0002 |
AC |
1 ms |
256 KB |
1_20_Same_11_0003 |
AC |
1 ms |
256 KB |
1_20_Same_12_0006 |
AC |
1 ms |
256 KB |
1_20_Same_13_0077 |
AC |
13 ms |
512 KB |
1_20_Same_14_0024 |
AC |
2 ms |
256 KB |
1_20_Same_15_0082 |
AC |
14 ms |
512 KB |
1_20_Same_16_0208 |
AC |
203 ms |
2056 KB |
1_20_Same_17_0497 |
AC |
555 ms |
10072 KB |
1_20_Same_18_0907 |
AC |
1857 ms |
32588 KB |
1_20_Same_19_0126 |
AC |
77 ms |
964 KB |
1_20_Same_20_0106 |
AC |
53 ms |
780 KB |
1_20_Same_21_0756 |
AC |
1288 ms |
22824 KB |
1_20_Same_22_1000 |
AC |
1486 ms |
39632 KB |
1_20_Same_23_1000 |
AC |
1485 ms |
39632 KB |
1_20_Same_24_1000 |
AC |
4412 ms |
39632 KB |
1_20_Same_25_1000 |
AC |
4989 ms |
39632 KB |
1_20_Same_26_1000 |
TLE |
5177 ms |
39632 KB |
1_30_Yes_00_0004 |
AC |
2 ms |
256 KB |
1_30_Yes_01_0003 |
AC |
2 ms |
256 KB |
1_30_Yes_02_0003 |
AC |
2 ms |
256 KB |
1_30_Yes_03_0031 |
AC |
6 ms |
256 KB |
1_30_Yes_04_0028 |
AC |
6 ms |
256 KB |
1_30_Yes_05_0080 |
AC |
26 ms |
512 KB |
1_30_Yes_06_0965 |
AC |
4617 ms |
36900 KB |
1_30_Yes_07_0750 |
AC |
2597 ms |
22480 KB |
1_30_Yes_08_0842 |
AC |
3383 ms |
28204 KB |
1_30_Yes_09_0525 |
AC |
1258 ms |
11180 KB |
1_30_Yes_10_0160 |
AC |
124 ms |
1356 KB |
1_30_Yes_11_0497 |
AC |
1139 ms |
10072 KB |
1_30_Yes_12_1000 |
AC |
4179 ms |
39632 KB |
1_30_Yes_13_1000 |
AC |
4172 ms |
39632 KB |
1_30_Yes_14_1000 |
AC |
4164 ms |
39632 KB |
1_30_Yes_15_1000 |
AC |
4968 ms |
39632 KB |
1_30_Yes_16_1000 |
TLE |
5064 ms |
39632 KB |
1_40_Zero_00_0004 |
AC |
2 ms |
256 KB |
1_40_Zero_01_0008 |
AC |
2 ms |
256 KB |
1_40_Zero_02_0008 |
AC |
2 ms |
256 KB |
1_40_Zero_03_0094 |
AC |
38 ms |
680 KB |
1_40_Zero_04_0080 |
AC |
26 ms |
512 KB |
1_40_Zero_05_0023 |
AC |
5 ms |
256 KB |
1_40_Zero_06_0514 |
AC |
1208 ms |
10768 KB |
1_40_Zero_07_0167 |
AC |
135 ms |
1540 KB |
1_40_Zero_08_0564 |
AC |
1460 ms |
12876 KB |
1_40_Zero_09_0561 |
AC |
1220 ms |
12732 KB |
1_40_Zero_10_0182 |
AC |
159 ms |
1660 KB |
1_40_Zero_11_0735 |
AC |
952 ms |
21520 KB |