結果

問題 No.2844 Birthday Party Decoration
コンテスト
ユーザー ja14378
提出日時 2024-08-23 21:53:24
言語 C++17
(gcc 15.2.0 + boost 1.90.0)
コンパイル:
g++-15 -O2 -lm -std=c++17 -Wuninitialized -DONLINE_JUDGE -o a.out _filename_
実行:
./a.out
結果
AC  
実行時間 22 ms / 2,000 ms
コード長 1,687 bytes
記録
記録タグの例:
初AC ショートコード 純ショートコード 純主流ショートコード 最速実行時間
コンパイル時間 2,734 ms
コンパイル使用メモリ 277,684 KB
実行使用メモリ 16,384 KB
最終ジャッジ日時 2026-07-05 12:10:48
合計ジャッジ時間 3,812 ms
ジャッジサーバーID
（参考情報） 		judge2_0 / judge1_0
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 4
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function 'int main()':
main.cpp:63:36: warning: ignoring return value of 'std::basic_ostream<_CharT, _Traits>* std::basic_ios<_CharT, _Traits>::tie() const [with _CharT = char; _Traits = std::char_traits<char>]', declared with attribute 'nodiscard' [-Wunused-result]
   63 |     ios::sync_with_stdio(0);cin.tie();
      |                             ~~~~~~~^~
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@15/15.3.0/include/c++/15/ios:48,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@15/15.3.0/include/c++/15/istream:42,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@15/15.3.0/include/c++/15/sstream:42,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@15/15.3.0/include/c++/15/complex:50,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@15/15.3.0/include/c++/15/x86_64-pc-linux-gnu/bits/stdc++.h:141,
                 from main.cpp:1:
/home/linuxbrew/.linuxbrew/Cellar/gcc@15/15.3.0/include/c++/15/bits/basic_ios.h:310:7: note: declared here
  310 |       tie() const
      |       ^~~

ソースコード

diff #
raw source code 

#include <bits/stdc++.h>
#include <atcoder/all>
using ll = long long;
#define MOD 1000000007
#define Mod 998244353
const int MAX = 1000000005;
const long long INF = 1000000000000000005LL;
using namespace std;
using namespace atcoder;

void solve() {
    int N;
    ll X;
    cin >> N >> X;
    vector<int> C(N);
    for (int i = 0; i < N; i++) cin >> C[i];
    vector<ll> dl(N), dr(N, INF);
    for (int i = 0; i < N; i++) {
        if (X & (1LL << C[i])) {
            dl[i] = 0;
            dr[i] = 0;
        } else {
            ll nl = X;
            nl = (nl >> C[i]);
            nl = (nl << C[i]);
            nl += (1LL << C[i]);
            dl[i] = nl - X;
            //cout << dl[i] << " " << dr[i] << endl;
            if ((1LL << C[i]) > X) continue;
            ll nr = 0;
            bool found = false;
            for (int j = 0; j < 60; j++) {
                if (found) {
                    if (X & (1LL << j)) nr += (1LL << j);
                } else {
                    if (j > C[i] && (X & (1LL << j))) found = true;
                    else nr += (1LL << j);
                }
            }
            dr[i] = X - nr;
        }
    }

    swap(dl, dr);
    ll ans = 8*INF;
    for (int i = 0; i < N; i++) {
        if (dl[i] == INF) continue;
        ll r = 0;
        for (int j = 0; j < N; j++) {
            if (dl[i] < dl[j]) r = max(r, dr[j]);
        }
        ans = min(ans, (dl[i] + r)*2);
    }
    ll r = 0;
    for (int i = 0; i < N; i++) {
        if (dl[i] > 0) r = max(r, dr[i]);
    }
    ans = min(ans, 2*r);
    cout << ans << endl;
}

int main() {
    ios::sync_with_stdio(0);cin.tie();
    int T;
    cin >> T;
    while (T--) {solve();}
}
0