結果

問題 No.1136 Four Points Tour
ユーザー 8UqsVg4r8UqsVg4r
提出日時 2021-02-06 11:29:58
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 9,649 bytes
コンパイル時間 2,092 ms
コンパイル使用メモリ 186,504 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-07-02 18:26:34
合計ジャッジ時間 2,993 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 1 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 1 ms
5,376 KB
testcase_05 AC 1 ms
5,376 KB
testcase_06 AC 1 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 1 ms
5,376 KB
testcase_11 AC 1 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 1 ms
5,376 KB
testcase_18 AC 1 ms
5,376 KB
testcase_19 AC 1 ms
5,376 KB
testcase_20 AC 2 ms
5,376 KB
testcase_21 AC 1 ms
5,376 KB
01_Sample03_evil.txt AC 2 ms
5,376 KB
04_Rnd_large_evil1.txt AC 2 ms
5,376 KB
04_Rnd_large_evil2.txt AC 2 ms
5,376 KB
04_Rnd_large_evil3.txt AC 1 ms
5,376 KB
04_Rnd_large_evil4.txt AC 2 ms
5,376 KB
04_Rnd_large_evil5.txt AC 2 ms
5,376 KB
04_Rnd_large_evil6.txt AC 2 ms
5,376 KB
04_Rnd_large_evil7.txt AC 2 ms
5,376 KB
04_Rnd_large_evil8.txt AC 2 ms
5,376 KB
04_Rnd_large_evil9.txt AC 2 ms
5,376 KB
04_Rnd_large_evil10.txt AC 2 ms
5,376 KB
05_Rnd_huge_evil1.txt AC 2 ms
5,376 KB
05_Rnd_huge_evil2.txt AC 2 ms
5,376 KB
05_Rnd_huge_evil3.txt AC 1 ms
5,376 KB
05_Rnd_huge_evil4.txt AC 2 ms
5,376 KB
05_Rnd_huge_evil5.txt AC 2 ms
5,376 KB
05_Rnd_huge_evil6.txt AC 1 ms
5,376 KB
05_Rnd_huge_evil7.txt AC 2 ms
5,376 KB
99_evil_01.txt AC 2 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

/////////////////////////////////////////////////
/////             Give me AC!!!!            /////
/////////////////////////////////////////////////
//↑これじゃ気合いが足りない！
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////
/////             お願いしますACをくださいそうじゃないと僕泣きますお願いしますACをくださいJudge様....            /////
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////
#include<bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<vector<ll>>;
#define rep(i,N) for(int i = 0; i < (N); i++)
#define erep(i,N) for(int i = N - 1; i >= 0; i--)
const ll MOD = 1e9+7;
const ll INF = numeric_limits<ll>::max();
const int MAX = 500000;
const ld PI = (acos(-1));
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true;} return false;}
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true;} return false;}
ld rad(ld a) {return a * 180 / PI;}
const int dx[8] = {1, 0, -1, 0, -1, 1, -1, 1};//2次元グリッド上のx軸方向
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};//2次元グリッド上のy軸方向
template<class T> void rm(vector<T> &vec) {vec.erase(unique(vec.begin(), vec.end()), vec.end());}
//using P = pair<int,int>;
struct UnionFind {
    vector<int> par;
    
    UnionFind(int n) : par(n, -1) { }
 
    int root(int x) {
        if (par[x] < 0) return x;
        else return par[x] = root(par[x]);
    }
    
    bool same(int x, int y) {
        return root(x) == root(y);
    }
    
    bool merge(int x, int y) {
        x = root(x); y = root(y);
        if (x == y) return false;
        if (par[x] > par[y]) swap(x, y); // merge technique
        par[x] += par[y];
        par[y] = x;
        return true;
    }
    
    int size(int x) {
        return -par[root(x)];
    }
};

template <typename T>
struct BIT {
    int n;          // 配列の要素数(数列の要素数+1)
    vector<T> bit;  // データの格納先
    BIT(int n_) : n(n_ + 1), bit(n, 0) {}
    void add(int i, T x) {
        for (int idx = i; idx < n; idx += (idx & -idx)) {
            bit[idx] += x;
        }
    }
    T sum(int i) {
        T s(0);
        for (int idx = i; idx > 0; idx -= (idx & -idx)) {
            s += bit[idx];
        }
        return s;
    }
};

map<ll,ll> factorize_list;
 
void factorize(ll k) {
    while(1){
        bool p = true;
        for (ll i = 2; i * i <= k; i++){
            if (k % i == 0){
                factorize_list[i]++;
                k /= i;
                p = false;
                break;
            }
        }
        if(p) {
            factorize_list[k]++;
            break;
        }
    }
    return ;
}
 
ll mod(ll val) {
  ll res = val % MOD;
  if (res < 0) res += MOD;
  return res;
}
 
char upper(char c){
    if('a' <= c && c <= 'z'){
        c = c - ('a' - 'A');
    }
    return c;
}
char lower(char c){
    if('A' <= c && c <= 'Z'){
        c = c + ('a' - 'A');
    }
    return c;
}

ll fac[MAX], finv[MAX], inv[MAX];

void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}

// 二項係数計算
ll COM(int n, int k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}

ll Expo(ll N,ll K) {
    N %= MOD;
    if (K == 0) {
        return 1;
    }
    ll Kc = K,rui = N,ans = 1;
    while(Kc) {
        if (Kc % 2) {
            ans *= rui;
            ans %= MOD;
        }
        rui *= rui;
        rui %= MOD;
        Kc >>= 1;
    }
    return ans;
}

int dp[100050];

ll extGCD(ll a, ll b, ll &x, ll &y) {
    if (b == 0) {
        x = 1;
        y = 0;
        return a;
    }
    ll d = extGCD(b, a%b, y, x); // 再帰的に解く
    y -= a / b * x;
    return d;
}

int op(int a,int b) {
    return a + b;
}

int e() {
    return (int)0;
}

template <class S, S (*op)(S, S), S (*e)()> struct segtree {
  public:
    int ceil_pow2(int n) {
        int x = 0;
        while ((1U << x) < (unsigned int)(n)) x++;
        return x;
    }
    segtree() : segtree(0) {}
    segtree(int n) : segtree(vector<S>(n, e())) {}
    segtree(const vector<S>& v) : _n(int(v.size())) {
        log = ceil_pow2(_n);
        size = 1 << log;
        d = vector<S>(2 * size, e());
        for (int i = 0; i < _n; i++) d[size + i] = v[i];
        for (int i = size - 1; i >= 1; i--) {
            update(i);
        }
    }

    void set(int p, S x) {
        assert(0 <= p && p < _n);
        p += size;
        d[p] = x;
        for (int i = 1; i <= log; i++) update(p >> i);
    }

    S get(int p) {
        assert(0 <= p && p < _n);
        return d[p + size];
    }

    S prod(int l, int r) {
        assert(0 <= l && l <= r && r <= _n);
        S sml = e(), smr = e();
        l += size;
        r += size;

        while (l < r) {
            if (l & 1) sml = op(sml, d[l++]);
            if (r & 1) smr = op(d[--r], smr);
            l >>= 1;
            r >>= 1;
        }
        return op(sml, smr);
    }

    S all_prod() { return d[1]; }

    template <bool (*f)(S)> int max_right(int l) {
        return max_right(l, [](S x) { return f(x); });
    }
    template <class F> int max_right(int l, F f) {
        assert(0 <= l && l <= _n);
        assert(f(e()));
        if (l == _n) return _n;
        l += size;
        S sm = e();
        do {
            while (l % 2 == 0) l >>= 1;
            if (!f(op(sm, d[l]))) {
                while (l < size) {
                    l = (2 * l);
                    if (f(op(sm, d[l]))) {
                        sm = op(sm, d[l]);
                        l++;
                    }
                }
                return l - size;
            }
            sm = op(sm, d[l]);
            l++;
        } while ((l & -l) != l);
        return _n;
    }

    template <bool (*f)(S)> int min_left(int r) {
        return min_left(r, [](S x) { return f(x); });
    }
    template <class F> int min_left(int r, F f) {
        assert(0 <= r && r <= _n);
        assert(f(e()));
        if (r == 0) return 0;
        r += size;
        S sm = e();
        do {
            r--;
            while (r > 1 && (r % 2)) r >>= 1;
            if (!f(op(d[r], sm))) {
                while (r < size) {
                    r = (2 * r + 1);
                    if (f(op(d[r], sm))) {
                        sm = op(d[r], sm);
                        r--;
                    }
                }
                return r + 1 - size;
            }
            sm = op(d[r], sm);
        } while ((r & -r) != r);
        return 0;
    }

  private:
    int _n, size, log;
    vector<S> d;

    void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
};

struct edge {
    int to;
    ll cost;
};

template<class T>
constexpr auto unit() -> enable_if_t<is_integral<T>::value, T> {
	return 1;
}
template<class T>
constexpr auto unit() -> enable_if_t<is_floating_point<T>::value, T> {
	return 1e-10;
}

template<class T> T sqroot(T Ex) {
    T l = 0,r = min(Ex,(T)(1e9));
    while (r - l > unit<T>()) {
        T val = (l + r) / 2;
        if (val * val > Ex) r = val;
        else l = val;
    }
    return l;//Ex以下のT型の平方根
}

template<class T> using Graph = vector<vector<T>>;
#define Sugsugar cin.tie(0);ios::sync_with_stdio(false)

ll logN(ll btm,ll num) {
    if (btm <= 1) {
        return -1;
    }
    ll Ex = 0,x = 1;
    while (x <= num / btm) {
        Ex++;
        x *= btm;
    }
    return Ex;
}

template<class T> void sitpress(vector<T> &vec) {
    vector<T> array = vec;
    sort(array.begin(),array.end());
    rm(array);
    for (int i = 0; i < vec.size(); i++) {
        int l = -1,r = array.size();
        while (r - l > 1) {
            int mid = (l + r) / 2;
            if (array.at(mid) >= vec.at(i)) r = mid;
            else l = mid;
        }
        vec.at(i) = r;
    }
}

template<class T> ll Rolling(vector<T> Girl) {
    BIT<int> RG(Girl.size());
    int si = Girl.size();
    ll gl = 0;
    sitpress(Girl);
    for (int i = 0; i < si; i++) {
        Girl.at(i)++;
        gl += RG.sum(si) - RG.sum(Girl.at(i));
        RG.add(Girl.at(i),1);
    }
    return gl;
}

ll gcd(ll a,ll b){return b==0?a:gcd(b,a%b);}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}

vll mat(vll a, vll b) {
    assert(a.at(0).size() == b.size());
    int l = a.size(),m = b.size(),n = b.at(0).size();
    vll c(l,vector<ll>(n,0));
    for (int i = 0; i < l; i++) {
        for (int j = 0; j < n; j++) {
            for (int k = 0; k < m; k++) {
                c.at(i).at(j) += a.at(i).at(k) * b.at(k).at(j) % MOD;
                c.at(i).at(j) %= MOD;
            }
        }
    }
    return c;
}

vll Matpower(vll a,ll bit) { //この行列は正方行列のみ
    vll ans(a.size(),vector<ll>(a.size()));
    bool hoge = true;
    for (int i = 0; i <= 62; i++) {
        if ((bit >> i) & 1) {
            if (hoge) {
                ans = a;
                hoge = false;
            }
            else {
                ans = mat(ans,a);
            }
        }
        a = mat(a,a);
    }
    return ans;
}

signed main() {
    Sugsugar;
    ll N;
    cin >> N;
    vll A(4,vector<ll>(4,1));
    for (int i = 0; i < 4; i++) A.at(i).at(i) = 0;
    A = Matpower(A,N);
    cout << A.at(0).at(0) << endl;
    return 0;
}
0