제출 #760955

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
760955		devedude	Star Trek (CEOI20_startrek)	C++17	7 / 100	1 ms	296 KiB

startrek

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll, ll> ii;
typedef vector<ii> vii;

#define FOR(x, a, b) for (int x = a; x < (b); ++x)

ll possibilities(ll N, ll D, vii UV);

int main() {
    ll N, D;
    cin >> N >> D;
    vii UV(N);
    FOR(i, 0, N) {
        ll a, b;
        cin >> a >> b;
        UV[i] = make_pair(a, b);
    }
    cout << possibilities(N, D, UV) << '\n';
}

ll M = 1000000007;

ll modpow(ll b, ll e, ll m) {
    ll r = 1;
    while (e) {
        if (e & 1) {
            r *= b;
            r %= m;
        }
        b *= b;
        b %= m;
        e >>= 1;
    }
    return r;
}

ll possibilities(ll N, ll D, vii UV) {
    return modpow(4, D, M);
}

• Subtask 1: 0 / 0
• Subtask 2: 7 / 7
• Subtask 3: 0 / 8
• Subtask 4: 0 / 15
• Subtask 5: 0 / 15
• Subtask 6: 0 / 20
• Subtask 7: 0 / 20
• Subtask 8: 0 / 15