結果
問題 | No.3018 簡易版ページランク |
ユーザー | satanic |
提出日時 | 2017-03-18 00:03:10 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 9,531 bytes |
コンパイル時間 | 1,226 ms |
コンパイル使用メモリ | 128,112 KB |
実行使用メモリ | 32,128 KB |
最終ジャッジ日時 | 2024-07-04 13:45:18 |
合計ジャッジ時間 | 4,902 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
10,624 KB |
testcase_01 | AC | 1 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 2 ms
5,376 KB |
testcase_07 | AC | 1 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 2 ms
5,376 KB |
testcase_10 | AC | 2 ms
5,376 KB |
testcase_11 | AC | 3 ms
5,376 KB |
testcase_12 | AC | 14 ms
5,376 KB |
testcase_13 | AC | 14 ms
5,376 KB |
testcase_14 | AC | 15 ms
5,376 KB |
testcase_15 | AC | 14 ms
5,376 KB |
testcase_16 | AC | 14 ms
5,376 KB |
testcase_17 | AC | 15 ms
5,376 KB |
testcase_18 | TLE | - |
testcase_19 | -- | - |
testcase_20 | -- | - |
testcase_21 | -- | - |
testcase_22 | -- | - |
ソースコード
// 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; } 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, m); VEC_ROW(int, m, a, b, c); std::vector<int> sum(n); REP(i, m) { sum[a[i]] += c[i]; } Matrix<double> mat(n, n); REP(i, m) { mat[a[i]][b[i]] = 1.*c[i]/sum[a[i]]; } mat ^= 100; mat *= 10; REP(i, n) { double ans = 0; REP(j, n) ans += mat[j][i]; FOUT(6, ans)BR; } return 0; }