結果
問題 | No.2486 Don't come next to me |
ユーザー | au7777 |
提出日時 | 2023-10-03 00:30:28 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 127 ms / 2,000 ms |
コード長 | 2,972 bytes |
コンパイル時間 | 4,306 ms |
コンパイル使用メモリ | 240,512 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-26 13:57:19 |
合計ジャッジ時間 | 6,318 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 111 ms
5,248 KB |
testcase_01 | AC | 98 ms
5,376 KB |
testcase_02 | AC | 30 ms
5,376 KB |
testcase_03 | AC | 71 ms
5,376 KB |
testcase_04 | AC | 96 ms
5,376 KB |
testcase_05 | AC | 69 ms
5,376 KB |
testcase_06 | AC | 81 ms
5,376 KB |
testcase_07 | AC | 16 ms
5,376 KB |
testcase_08 | AC | 33 ms
5,376 KB |
testcase_09 | AC | 96 ms
5,376 KB |
testcase_10 | AC | 72 ms
5,376 KB |
testcase_11 | AC | 42 ms
5,376 KB |
testcase_12 | AC | 21 ms
5,376 KB |
testcase_13 | AC | 127 ms
5,376 KB |
testcase_14 | AC | 36 ms
5,376 KB |
testcase_15 | AC | 70 ms
5,376 KB |
testcase_16 | AC | 16 ms
5,376 KB |
testcase_17 | AC | 30 ms
5,376 KB |
testcase_18 | AC | 27 ms
5,376 KB |
testcase_19 | AC | 34 ms
5,376 KB |
testcase_20 | AC | 2 ms
5,376 KB |
testcase_21 | AC | 2 ms
5,376 KB |
testcase_22 | AC | 2 ms
5,376 KB |
ソースコード
#include <bits/stdc++.h>#include <atcoder/all>typedef long long int ll;using namespace std;typedef pair<ll, ll> P;using namespace atcoder;template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;#define USE998244353#ifdef USE998244353const ll MOD = 998244353;// const double PI = 3.1415926535897932;using mint = modint998244353;#elseconst ll MOD = 1000000007;using mint = modint1000000007;#endifconst int MAX = 2000001;long long 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;}}long long 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 gcd(ll x, ll y) {if (y == 0) return x;else if (y > x) {return gcd (y, x);}else return gcd(x % y, y);}ll lcm(ll x, ll y) {return x / gcd(x, y) * y;}ll my_sqrt(ll x) {//ll m = 0;ll M = 3000000001;while (M - m > 1) {ll now = (M + m) / 2;if (now * now <= x) {m = now;}else {M = now;}}return m;}ll keta(ll num, ll arity) {ll ret = 0;while (num) {num /= arity;ret++;}return ret;}ll ceil(ll n, ll m) {// n > 0, m > 0ll ret = n / m;if (n % m) ret++;return ret;}ll pow_ll(ll x, ll n) {if (n == 0) return 1;if (n % 2) {return pow_ll(x, n - 1) * x;}else {ll tmp = pow_ll(x, n / 2);return tmp * tmp;}}vector<ll> compress(vector<ll>& v) {// [3 5 5 6 1 1 10 1] -> [1 2 2 3 0 0 4 0]vector<ll> u = v;sort(u.begin(), u.end());u.erase(unique(u.begin(),u.end()),u.end());map<ll, ll> mp;for (int i = 0; i < u.size(); i++) {mp[u[i]] = i;}for (int i = 0; i < v.size(); i++) {v[i] = mp[v[i]];}return v;}vector<ll> Eratosthenes( const ll N ){vector<bool> is_prime( N + 1 );for( ll i = 0; i <= N; i++ ){is_prime[ i ] = true;}vector<ll> P;for( ll i = 2; i <= N; i++ ){if( is_prime[ i ] ){for( ll j = 2 * i; j <= N; j += i ){is_prime[ j ] = false;}P.emplace_back( i );}}return P;}ll f(ll n) {if (n == 1) return 1;if (n % 2 == 0) return n;ll tmp = f(n / 2);return tmp * 2;}int main() {ll n, m;cin >> n >> m;ll a[m + 2];a[0] = 0;a[m + 1] = n + 1;for (int i = 1; i <= m; i++) {cin >> a[i];}ll ans = 0;for (int i = 1; i <= m + 1; i++) {ans += f(a[i] - a[i - 1] - 1);}cout << ans << endl;return 0;}