#567384 (C++14) No.1258 コインゲーム

• 問題: No.1258 コインゲーム
• ユーザー: simasima_71
• 提出日時: 2020-10-16 21:27:27
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 272 ms / 2,000 ms
• コード長: 4,075 bytes
• コンパイル時間: 3,563 ms
• コンパイル使用メモリ: 176,532 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-07-20 21:09:55
• 合計ジャッジ時間: 13,563 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	50 ms; 5,248 KB
testcase_01	AC	66 ms; 5,248 KB
testcase_02	AC	24 ms; 5,376 KB
testcase_03	AC	209 ms; 5,376 KB
testcase_04	AC	239 ms; 5,376 KB
testcase_05	AC	39 ms; 5,376 KB
testcase_06	AC	169 ms; 5,376 KB
testcase_07	AC	19 ms; 5,376 KB
testcase_08	AC	17 ms; 5,376 KB
testcase_09	AC	89 ms; 5,376 KB
testcase_10	AC	202 ms; 5,376 KB
testcase_11	AC	224 ms; 5,376 KB
testcase_12	AC	169 ms; 5,376 KB
testcase_13	AC	51 ms; 5,376 KB
testcase_14	AC	16 ms; 5,376 KB
testcase_15	AC	199 ms; 5,376 KB
testcase_16	AC	42 ms; 5,376 KB
testcase_17	AC	231 ms; 5,376 KB
testcase_18	AC	82 ms; 5,376 KB
testcase_19	AC	75 ms; 5,376 KB
testcase_20	AC	163 ms; 5,376 KB
testcase_21	AC	203 ms; 5,376 KB
testcase_22	AC	147 ms; 5,376 KB
testcase_23	AC	111 ms; 5,376 KB
testcase_24	AC	42 ms; 5,376 KB
testcase_25	AC	109 ms; 5,376 KB
testcase_26	AC	97 ms; 5,376 KB
testcase_27	AC	220 ms; 5,376 KB
testcase_28	AC	53 ms; 5,376 KB
testcase_29	AC	59 ms; 5,376 KB
testcase_30	AC	262 ms; 5,376 KB
testcase_31	AC	60 ms; 5,376 KB
testcase_32	AC	29 ms; 5,376 KB
testcase_33	AC	177 ms; 5,376 KB
testcase_34	AC	205 ms; 5,376 KB
testcase_35	AC	74 ms; 5,376 KB
testcase_36	AC	213 ms; 5,376 KB
testcase_37	AC	84 ms; 5,376 KB
testcase_38	AC	199 ms; 5,376 KB
testcase_39	AC	56 ms; 5,376 KB
testcase_40	AC	256 ms; 5,376 KB
testcase_41	AC	264 ms; 5,376 KB
testcase_42	AC	255 ms; 5,376 KB
testcase_43	AC	265 ms; 5,376 KB
testcase_44	AC	257 ms; 5,376 KB
testcase_45	AC	272 ms; 5,376 KB
testcase_46	AC	259 ms; 5,376 KB
testcase_47	AC	263 ms; 5,376 KB
testcase_48	AC	263 ms; 5,376 KB
testcase_49	AC	270 ms; 5,376 KB

ソースコード

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <functional>
#include <ctime>
#include <fstream>
#include <cmath>
#include <limits>
#include <chrono>
#include <numeric>
#include <type_traits>
#include <iomanip>
#include <float.h>
#include <math.h>
#include <cassert>
#include <atcoder/all>
#pragma warning (disable: 4996)
using namespace std;
using namespace atcoder;

using ll = long long;
unsigned euclidean_gcd(unsigned a, unsigned b) {
    if (a < b) return euclidean_gcd(b, a);
    unsigned r;
    while ((r = a % b)) {
        a = b;
        b = r;
    }
    return b;
}

ll ll_gcd(ll a, ll b) {
    if (a < b) return ll_gcd(b, a);
    ll r;
    while ((r = a % b)) {
        a = b;
        b = r;
    }
    return b;
}

struct UnionFind {
    vector <ll> par;
    vector <ll> siz;
    UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
        for (ll i = 0; i < sz_; ++i) par[i] = i;
    }
    void init(ll sz_) {
        par.resize(sz_);
        siz.assign(sz_, 1LL);
        for (ll i = 0; i < sz_; ++i) par[i] = i;
    }
    ll root(ll x) {
        while (par[x] != x) {
            x = par[x] = par[par[x]];
        }
        return x;
    }
    bool merge(ll x, ll y) {
        x = root(x);
        y = root(y);
        if (x == y) return false;
        if (siz[x] < siz[y]) swap(x, y);
        siz[x] += siz[y];
        par[y] = x;
        return true;
    }

    bool issame(ll x, ll y) {
        return root(x) == root(y);
    }

    ll size(ll x) {
        return siz[root(x)];
    }
};

long long modpow(long long a, long long n, long long mod) {
    if (n < 0)return 0;
    long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}

long long modinv(long long a, long long mod) {
    return modpow(a, mod - 2, mod);
}

ll merge_cnt(vector<ll>& a) {
    int n = a.size();
    if (n <= 1) { return 0; }

    ll cnt = 0;
    vector<ll> b(a.begin(), a.begin() + n / 2);
    vector<ll> c(a.begin() + n / 2, a.end());

    cnt += merge_cnt(b);
    cnt += merge_cnt(c);

    int ai = 0, bi = 0, ci = 0;
    while (ai < n) {
        if (bi < b.size() && (ci == c.size() || b[bi] <= c[ci])) {
            a[ai++] = b[bi++];
        }
        else {
            cnt += n / 2 - bi;
            a[ai++] = c[ci++];
        }
    }
    return cnt;
}

struct edge { ll to, cost; };
typedef pair<ll, ll> P;
struct graph {
    ll V;
    vector<vector<edge> > G;
    vector<ll> d;

    graph(ll n) {
        init(n);
    }

    void init(ll n) {
        V = n;
        G.resize(V);
        d.resize(V);
        for (int i = 0; i < V; i++) {
            d[i] = 2000000000000000000;
        }
    }

    void add_edge(ll s, ll t, ll cost) {
        edge e;
        e.to = t, e.cost = cost;
        G[s].push_back(e);
    }

    void dijkstra(ll s) {
        for (int i = 0; i < V; i++) {
            d[i] = 2000000000000000000;
        }
        d[s] = 0;
        priority_queue<P, vector<P>, greater<P> > que;
        que.push(P(0, s));
        while (!que.empty()) {
            P p = que.top(); que.pop();
            ll v = p.second;
            if (d[v] < p.first) continue;
            for (auto e : G[v]) {
                if (d[e.to] > d[v] + e.cost) {
                    d[e.to] = d[v] + e.cost;
                    que.push(P(d[e.to], e.to));
                }
            }
        }
    }
};



int main() {
    ll s;
    cin >> s;
    for (int i = 0; i < s; i++) {
        ll n, x, m;
        cin >> n >> m >> x;
        if (x % 2 == n % 2)cout << (modpow(m + 1, n, 1000000007) + modpow(m - 1, n, 1000000007)) * modinv(2, 1000000007) % 1000000007<< endl;
        else cout << (modpow(m + 1, n, 1000000007) - modpow(m - 1, n, 1000000007)[phone]) * modinv(2, 1000000007) % 1000000007 << endl;
    }
}