結果
問題 | No.1682 Unfair Game |
ユーザー | ruthen71 |
提出日時 | 2021-09-17 23:31:37 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,989 bytes |
コンパイル時間 | 1,612 ms |
コンパイル使用メモリ | 170,620 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-06-29 22:20:01 |
合計ジャッジ時間 | 2,295 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,944 KB |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | AC | 2 ms
6,940 KB |
testcase_05 | WA | - |
testcase_06 | AC | 2 ms
6,944 KB |
testcase_07 | AC | 1 ms
6,940 KB |
testcase_08 | WA | - |
testcase_09 | AC | 2 ms
6,944 KB |
testcase_10 | WA | - |
testcase_11 | AC | 2 ms
6,944 KB |
testcase_12 | AC | 2 ms
6,940 KB |
testcase_13 | AC | 2 ms
6,940 KB |
testcase_14 | AC | 2 ms
6,944 KB |
testcase_15 | AC | 2 ms
6,940 KB |
testcase_16 | AC | 2 ms
6,940 KB |
testcase_17 | AC | 2 ms
6,940 KB |
testcase_18 | AC | 2 ms
6,944 KB |
testcase_19 | WA | - |
testcase_20 | AC | 2 ms
6,940 KB |
testcase_21 | WA | - |
ソースコード
#include <bits/stdc++.h> using namespace std; // clang-format off #include <atcoder/modint> using namespace atcoder; using ll = long long; using ld = long double; using pii = pair<int, int>; using pll = pair<ll, ll>; using pdd = pair<ld, ld>; using vii = vector<int>; using vll = vector<ll>; using vdd = vector<ld>; using vvii = vector<vector<int>>; using vvll = vector<vector<ll>>; using vvdd = vector<vector<ld>>; using vvvii = vector<vector<vector<int>>>; using vvvll = vector<vector<vector<ll>>>; using vvvdd = vector<vector<vector<ld>>>; template<class T, class U> using P = pair<T, U>; template<class T> using V1 = vector<T>; template<class T> using V2 = vector<vector<T>>; template<class T> using V3 = vector<vector<vector<T>>>; template<class T> using pque = priority_queue<T, vector<T>, greater<T>>; #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 rep(...) _overload3(__VA_ARGS__, rep3, rep2, rep1)(__VA_ARGS__) #define rrep1(n) for (ll i = (n) - 1; i >= 0; i--) #define rrep2(i, n) for (ll i = (n) - 1; i >= 0; i--) #define rrep3(i, a, b) for (ll i = (b) - 1; i >= (a); i--) #define rrep(...) _overload3(__VA_ARGS__, rrep3, rrep2, rrep1)(__VA_ARGS__) #define all(x) (x).begin(), (x).end() #define sz(x) ((int)(x).size()) #define fi first #define se second #define pb push_back #define endl '\n' #define popcnt(x) __builtin_popcountll(x) #define uniq(x) (x).erase(unique((x).begin(), (x).end()), (x).end()); #define IOS ios::sync_with_stdio(false); cin.tie(nullptr); const int inf = 1 << 30; const ll INF = 1ll << 60; const ld DINF = numeric_limits<ld>::infinity(); const ll mod = 1000000007; //const ll mod = 998244353; const ld EPS = 1e-9; const ld PI = 3.1415926535897932; const ll dx[8] = {1, 0, -1, 0, 1, -1, -1, 1}; const ll dy[8] = {0, 1, 0, -1, 1, 1, -1, -1}; template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; } template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; } template<typename T> T min(const vector<T> &x) { return *min_element(all(x)); } template<typename T> T max(const vector<T> &x) { return *max_element(all(x)); } template<class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &p) { return os << "(" << p.fi << ", " << p.se << ")"; } template<class T> ostream &operator<<(ostream &os, const vector<T> &v) { os << "[ "; for (auto &z : v) os << z << " "; os << "]"; return os; } #ifdef _DEBUG #define show(x) cout << #x << " = " << x << endl; #else #define show(x) #endif ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; } ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; } ll rem(ll a, ll b) { return (a % b + b) % b; } // clang-format on // using mint = modint998244353; using mint = modint1000000007; ll modpow(ll a, ll N, ll mod) { ll res = 1; // 例えば3=101(2)なので、下位bitから順に1ならa倍する while (N) { if (N & 1) res = res * a % mod; a = a * a % mod; N >>= 1; } return res; } int main() { // IOS; int N; cin >> N; vii P(N); rep(N) cin >> P[i]; // ans0 = 偶数, ans1 = 奇数 mint ans0 = 1, ans1 = 0; rep(i, N) { mint ans0c = ans0, ans1c = ans1; if (P[i] > 50) { ans0c += ans1; ans1c += ans0; } else { ans0c += ans0; ans1c += ans1; } ans0 = ans0c; ans1 = ans1c; } ans0--; cout << ans1.val() << endl; /* mint ans1 = 1, ans2 = 1; int cnt = 0; rep(i, N - 1) { if (P[i] > 50) { swap(ans1, ans2); cnt++; } ans1 *= 2; ans2 *= 2; } if (P[N - 1] > 50) { swap(ans1, ans2); cnt++; } if (cnt % 2 == 0) ans1--; else ans2--; cout << ans1.val() << endl; */ return 0; } /* メモ */