結果
問題 | No.1595 The Final Digit |
ユーザー | tatyam |
提出日時 | 2021-07-09 21:30:02 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 15,419 bytes |
コンパイル時間 | 2,921 ms |
コンパイル使用メモリ | 228,556 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-01 15:16:37 |
合計ジャッジ時間 | 3,582 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
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 | 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 | 2 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 | 2 ms
5,376 KB |
testcase_12 | AC | 2 ms
5,376 KB |
testcase_13 | AC | 2 ms
5,376 KB |
testcase_14 | AC | 2 ms
5,376 KB |
testcase_15 | AC | 2 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 |
ソースコード
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using ull = unsigned long long; using uint = unsigned; using pcc = pair<char, char>; using pii = pair<int, int>; using pll = pair<ll, ll>; using pdd = pair<ld, ld>; using tuplis = array<ll, 3>; template<class T> using pq = priority_queue<T, vector<T>, greater<T>>; const ll LINF=0x1fffffffffffffff; const ll MINF=0x7fffffffffff; const int INF=0x3fffffff; const int MOD=1000000007; const int MODD=998244353; const ld DINF=numeric_limits<ld>::infinity(); const ld EPS=1e-9; const ld PI=3.1415926535897932; const ll dx[] = {0, 1, 0, -1, 1, -1, 1, -1}; const ll dy[] = {1, 0, -1, 0, 1, 1, -1, -1}; #define overload4(_1,_2,_3,_4,name,...) name #define overload3(_1,_2,_3,name,...) name #define rep1(n) for(ll i=0;i<n;++i) #define rep2(i,n) for(ll i=0;i<n;++i) #define rep3(i,a,b) for(ll i=a;i<b;++i) #define rep4(i,a,b,c) for(ll i=a;i<b;i+=c) #define rep(...) overload4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__) #define rrep1(n) for(ll i=n;i--;) #define rrep2(i,n) for(ll i=n;i--;) #define rrep3(i,a,b) for(ll i=b;i-->(a);) #define rrep4(i,a,b,c) for(ll i=(a)+((b)-(a)-1)/(c)*(c);i>=(a);i-=c) #define rrep(...) overload4(__VA_ARGS__,rrep4,rrep3,rrep2,rrep1)(__VA_ARGS__) #define each1(i,a) for(auto&&i:a) #define each2(x,y,a) for(auto&&[x,y]:a) #define each3(x,y,z,a) for(auto&&[x,y,z]:a) #define each(...) overload4(__VA_ARGS__,each3,each2,each1)(__VA_ARGS__) #define all1(i) begin(i),end(i) #define all2(i,a) begin(i),begin(i)+a #define all3(i,a,b) begin(i)+a,begin(i)+b #define all(...) overload3(__VA_ARGS__,all3,all2,all1)(__VA_ARGS__) #define rall1(i) (i).rbegin(),(i).rend() #define rall2(i,k) (i).rbegin(),(i).rbegin()+k #define rall3(i,a,b) (i).rbegin()+a,(i).rbegin()+b #define rall(...) overload3(__VA_ARGS__,rall3,rall2,rall1)(__VA_ARGS__) #define sum(...) accumulate(all(__VA_ARGS__),0LL) #define dsum(...) accumulate(all(__VA_ARGS__),0.0L) #define Msum(...) accumulate(all(__VA_ARGS__),0_M) #define elif else if #define unless(a) if(!(a)) #define INT(...) int __VA_ARGS__;in(__VA_ARGS__) #define LL(...) ll __VA_ARGS__;in(__VA_ARGS__) #define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__) #define STR(...) string __VA_ARGS__;in(__VA_ARGS__) #define CHR(...) char __VA_ARGS__;in(__VA_ARGS__) #define DBL(...) double __VA_ARGS__;in(__VA_ARGS__) #define LD(...) ld __VA_ARGS__;in(__VA_ARGS__) #define Sort(a) sort(all(a)) #define Rev(a) reverse(all(a)) #define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a)) #define vec(type,name,...) vector<type>name(__VA_ARGS__) #define VEC(type,name,size) vector<type>name(size);in(name) #define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__)) #define VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name) #define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__))) template<class T> auto min(const T& a){ return *min_element(all(a)); } template<class T> auto max(const T& a){ return *max_element(all(a)); } inline ll popcnt(ull a){ return __builtin_popcountll(a); } ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; } template<class T> bool chmin(T& a, const T& b){ if(a > b){ a = b; return 1; } return 0; } template<class T> bool chmax(T& a, const T& b){ if(a < b){ a = b; return 1; } return 0; } template<class T, class U> bool chmin(T& a, const U& b){ if(a > T(b)){ a = b; return 1; } return 0; } template<class T, class U> bool chmax(T& a, const U& b){ if(a < T(b)){ a = b; return 1; } return 0; } vector<ll> iota(ll n, ll begin = 0){ vector<ll> a(n); iota(a.begin(), a.end(), begin); return a; } vector<pll> factor(ull x){ vector<pll> ans; for(ull i = 2; i * i <= x; i++) if(x % i == 0){ ans.push_back({i, 1}); while((x /= i) % i == 0) ans.back().second++; } if(x != 1) ans.push_back({x, 1}); return ans; } vector<ll> divisor(ull x){ vector<ll> ans; for(ull i = 1; i * i <= x; i++) if(x % i == 0) ans.push_back(i); rrep(ans.size() - (ans.back() * ans.back() == x)) ans.push_back(x / ans[i]); return ans; } template<class T> unordered_map<T, ll> press(vector<T> a){ Uniq(a); unordered_map<T, ll> ans; rep(a.size()) ans[a[i]] = i; return ans; } template<class T> map<T, ll> press_map(vector<T> a){ Uniq(a); map<T, ll> ans; rep(a.size()) ans[a[i]] = i; return ans; } int scan(){ return getchar(); } void scan(int& a){ scanf("%d", &a); } void scan(unsigned& a){ scanf("%u", &a); } void scan(long& a){ scanf("%ld", &a); } void scan(long long& a){ scanf("%lld", &a); } void scan(unsigned long long& a){ scanf("%llu", &a); } void scan(char& a){ do{ a = getchar(); }while(a == ' ' || a == '\n'); } void scan(float& a){ scanf("%f", &a); } void scan(double& a){ scanf("%lf", &a); } void scan(long double& a){ scanf("%Lf", &a); } void scan(vector<bool>& a){ for(unsigned i = 0; i < a.size(); i++){ int b; scan(b); a[i] = b; } } void scan(char a[]){ scanf("%s", a); } void scan(string& a){ cin >> a; } template<class T> void scan(vector<T>&); template<class T, size_t size> void scan(array<T, size>&); template<class T, class L> void scan(pair<T, L>&); template<class T, size_t size> void scan(T(&)[size]); template<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); } template<class T> void scan(deque<T>& a){ for(auto&& i : a) scan(i); } template<class T, size_t size> void scan(array<T, size>& a){ for(auto&& i : a) scan(i); } template<class T, class L> void scan(pair<T, L>& p){ scan(p.first); scan(p.second); } template<class T, size_t size> void scan(T (&a)[size]){ for(auto&& i : a) scan(i); } template<class T> void scan(T& a){ cin >> a; } void in(){} template <class... T> void in(T&... a){ (void)initializer_list<int>{ (scan(a), 0)... }; } void print(){ putchar(' '); } void print(bool a){ printf("%d", a); } void print(int a){ printf("%d", a); } void print(unsigned a){ printf("%u", a); } void print(long a){ printf("%ld", a); } void print(long long a){ printf("%lld", a); } void print(unsigned long long a){ printf("%llu", a); } void print(char a){ printf("%c", a); } void print(char a[]){ printf("%s", a); } void print(const char a[]){ printf("%s", a); } void print(float a){ printf("%.15f", a); } void print(double a){ printf("%.15f", a); } void print(long double a){ printf("%.15Lf", a); } void print(const string& a){ for(auto&& i : a) print(i); } template<class T> void print(const complex<T>& a){ if(a.real() >= 0) print('+'); print(a.real()); if(a.imag() >= 0) print('+'); print(a.imag()); print('i'); } template<class T> void print(const vector<T>&); template<class T, size_t size> void print(const array<T, size>&); template<class T, class L> void print(const pair<T, L>& p); template<class T, size_t size> void print(const T (&)[size]); template<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } } template<class T> void print(const deque<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } } template<class T, size_t size> void print(const array<T, size>& a){ print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } } template<class T, class L> void print(const pair<T, L>& p){ print(p.first); putchar(' '); print(p.second); } template<class T, size_t size> void print(const T (&a)[size]){ print(a[0]); for(auto i = a; ++i != end(a); ){ putchar(' '); print(*i); } } template<class T> void print(const T& a){ cout << a; } int out(){ putchar('\n'); return 0; } template<class T> int out(const T& t){ print(t); putchar('\n'); return 0; } template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; } #ifdef DEBUG inline ll __lg(ull x){ return 63 - __builtin_clzll(x); } #define debug(...) { print(#__VA_ARGS__); print(":"); out(__VA_ARGS__); } #else #define debug(...) void(0) #endif int first(bool i = true){ return out(i?"first":"second"); } int First(bool i = true){ return out(i?"First":"Second"); } int yes(bool i = true){ return out(i?"yes":"no"); } int Yes(bool i = true){ return out(i?"Yes":"No"); } int No(){ return out("No"); } int YES(bool i = true){ return out(i?"YES":"NO"); } int NO(){ return out("NO"); } int Yay(bool i = true){ return out(i?"Yay!":":("); } int possible(bool i = true){ return out(i?"possible":"impossible"); } int Possible(bool i = true){ return out(i?"Possible":"Impossible"); } int POSSIBLE(bool i = true){ return out(i?"POSSIBLE":"IMPOSSIBLE"); } void Case(ll i){ printf("Case #%lld: ", i); } constexpr uint mod = 10; struct Modint{ uint num = 0; constexpr Modint() noexcept {} constexpr Modint(const Modint &x) noexcept : num(x.num){} constexpr operator ll() const noexcept { return num; } constexpr Modint& operator+=(Modint x) noexcept { num += x.num; if(num >= mod) num -= mod; return *this; } constexpr Modint& operator++() noexcept { if(num == mod - 1) num = 0; else num++; return *this; } constexpr Modint operator++(int) noexcept { Modint ans(*this); operator++(); return ans; } constexpr Modint operator-() const noexcept { return Modint(0) -= *this; } constexpr Modint& operator-=(Modint x) noexcept { if(num < x.num) num += mod; num -= x.num; return *this; } constexpr Modint& operator--() noexcept { if(num == 0) num = mod - 1; else num--; return *this; } constexpr Modint operator--(int) noexcept { Modint ans(*this); operator--(); return ans; } constexpr Modint& operator*=(Modint x) noexcept { num = ull(num) * x.num % mod; return *this; } constexpr Modint& operator/=(Modint x) noexcept { return operator*=(x.inv()); } template<class T> constexpr Modint(T x) noexcept { using U = typename conditional<sizeof(T) >= 4, T, int>::type; U y = x; y %= U(mod); if(y < 0) y += mod; num = uint(y); } template<class T> constexpr Modint operator+(T x) const noexcept { return Modint(*this) += x; } template<class T> constexpr Modint& operator+=(T x) noexcept { return operator+=(Modint(x)); } template<class T> constexpr Modint operator-(T x) const noexcept { return Modint(*this) -= x; } template<class T> constexpr Modint& operator-=(T x) noexcept { return operator-=(Modint(x)); } template<class T> constexpr Modint operator*(T x) const noexcept { return Modint(*this) *= x; } template<class T> constexpr Modint& operator*=(T x) noexcept { return operator*=(Modint(x)); } template<class T> constexpr Modint operator/(T x) const noexcept { return Modint(*this) /= x; } template<class T> constexpr Modint& operator/=(T x) noexcept { return operator/=(Modint(x)); } constexpr Modint inv() const noexcept { ll x = 0, y = 0; extgcd(num, mod, x, y); return x; } static constexpr ll extgcd(ll a, ll b, ll &x, ll &y) noexcept { ll g = a; x = 1; y = 0; if(b){ g = extgcd(b, a % b, y, x); y -= a / b * x; } return g; } constexpr Modint pow(ull x) const noexcept { Modint ans = 1, cnt = *this; while(x){ if(x & 1) ans *= cnt; cnt *= cnt; x /= 2; } return ans; } }; std::istream& operator>>(std::istream& is, Modint& x){ ll a; in(a); x = a; return is; } constexpr Modint operator""_M(ull x) noexcept { return Modint(x); } std::vector<Modint> fac(1, 1), inv(1, 1); void reserve(ll a){ if(fac.size() >= a) return; if(a < fac.size() * 2) a = fac.size() * 2; if(a >= mod) a = mod; while(fac.size() < a) fac.push_back(fac.back() * Modint(fac.size())); inv.resize(fac.size()); inv.back() = fac.back().inv(); for(ll i = inv.size() - 1; !inv[i - 1]; i--) inv[i - 1] = inv[i] * i; } Modint fact(ll n){ if(n < 0) return 0; reserve(n + 1); return fac[n]; } Modint perm(ll n, ll r){ if(r < 0 || n < r) return 0; if(n >> 24){ Modint ans = 1; for(ll i = 0; i < r; i++) ans *= n--; return ans; } reserve(n + 1); return fac[n] * inv[n - r]; } Modint comb(ll n, ll r){ if(r < 0 || n < r) return 0; reserve(r + 1); return perm(n, r) * inv[r]; } Modint Mcomb(ll n, ll r){ return comb(n + r - 1, n - 1); } // r balls into n boxes Modint catalan(ll n){ reserve(n * 2 + 1); return fac[n * 2] * inv[n] * inv[n + 1]; } template<class T> struct Matrix{ ll h,w; vector<vector<T>> data; inline constexpr Matrix(ll h, ll w, bool identity = false) : h(h), w(w), data(h, vector<T>(w)) { if(identity){ reserve(w, h); rep(h) data[i][i] = 1; } } inline constexpr Matrix(vector<vector<T>> data) : h(data.size()), w(data[0].size()), data(data) {} inline constexpr Matrix(Matrix &x) : h(x.h), w(x.w), data(x.data) {} inline constexpr Matrix reserve(ll _h, ll _w){ if(_h > h){ h = _h; data.resize(h); } if(_w > w){ w = _w; for(auto &i : data) i.resize(w); } return *this;} inline constexpr Matrix resize(ll _h, ll _w){ h = _h; w = _w; data.resize(h); for(auto &i : data) i.resize(w); return *this; } inline constexpr vector<T>& operator[](ll x){ return data[x]; } inline constexpr const vector<T>& operator[](ll x) const { return data[x]; } inline constexpr T& operator[](pll x){ return data[x.first][x.second]; } inline constexpr const T& operator[](pll x) const { return data[x.first][x.second]; } inline constexpr T& operator()(ll x, ll y){ return data[x][y]; } inline constexpr const T& operator()(ll x, ll y) const { return data[x][y]; } inline constexpr Matrix operator= (const Matrix &&x){ h = x.h; w = x.w; data = move(x.data); return *this; } inline constexpr Matrix operator= (const Matrix &x){ h = x.h; w = x.w; data = x.data; return *this; } inline constexpr Matrix operator+ (T x){ auto ans = *this; for(auto &i : ans.data) for(auto &j : i) j += x; return ans; } inline constexpr Matrix operator+ (const Matrix &x){ auto ans = *this; ans.reserve(x.h, x.w); rep(x.h) rep(j, x.w) ans[i][j] += x[i][j]; return ans; } inline constexpr Matrix operator+=(T x){ for(auto &i : data) for(auto &j : i) j += x; return *this; } inline constexpr Matrix operator+=(const Matrix &x){ reserve(x.h, x.w); rep(x.h) rep(j, x.w) data[i][j] += x[i][j]; return *this; } inline constexpr Matrix operator- (T x){ auto ans = *this; for(auto &i : ans.data) for(auto &j : i) j -= x; return ans; } inline constexpr Matrix operator- (const Matrix &x){ auto ans = *this; ans.reserve(x.h, x.w); rep(x.h) rep(j, x.w) ans[i][j] -= x[i][j]; return ans; } inline constexpr Matrix operator-=(T x){ for(auto &i : data) for(auto &j : i) j -= x; return *this; } inline constexpr Matrix operator-=(const Matrix &x){ reserve(x.h, x.w); rep(x.h) rep(j, x.w) data[i][j] -= x[i][j]; return *this; } inline constexpr Matrix operator* (T x){ auto ans = *this; for(auto &i : ans.data) for(auto &j : i) j *= x; return ans; } inline constexpr Matrix operator* (const Matrix &x){ Matrix ans(h, x.w); rep(ans.h) rep(j, ans.w) rep(k, min(w, x.h)) ans[i][j] += data[i][k] * x[k][j]; return ans; } inline constexpr Matrix operator*=(T x){ for(auto &i : data) for(auto &j : i) j *= x; return *this; } inline constexpr Matrix operator*=(const Matrix &x){ *this = *this * x; return *this; } inline constexpr Matrix pow(ull x){ reserve(w, h); Matrix ans(h, w, true), cnt = *this; while(x){ if(x & 1) ans *= cnt; cnt *= cnt; x /= 2; } return ans; } }; int main(){ LL(p,q,r,k); Matrix<Modint>a(3,3); a[1][0]=a[2][1]=1; a[0][2]=a[1][2]=a[2][2]=1; k--; a=a.pow(k); out(a[0][0]*p+a[1][0]*q+a[2][0]*r); }