提出 #34167063

---

ソースコード 拡げる

#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC target("popcnt")

using namespace std;
using namespace __gnu_pbds;

template <typename t>
using ordered_set = tree<t, null_type, less<t>, rb_tree_tag, tree_order_statistics_node_update>;

// #pragma gcc optimize("ofast")
// #pragma gcc target("avx,avx2,fma")


#define int long long

#define all(x) (x).begin(), (x).end()


#define pb push_back
#define endl '\n'
#define fi first
#define se second

// const int mod = 1e9 + 7;

const int mod=998'244'353;


const long long INF = 2e18 + 10;
// const int INF=1e9+10;

#define readv(x, n)   \
    vector<int> x(n); \
    for (auto &i : x) \
        cin >> i;



template <typename t>
    using v = vector<t>;

template <typename t>
    using vv = vector<vector<t>>;

template <typename t>
    using vvv = vector<vector<vector<t>>>;

typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<vector<int>> vvi;
typedef vector<vector<vector<int>>> vvvi;
typedef vector<vector<vector<vector<int>>>> vvvvi;
typedef vector<vector<double>> vvd;

typedef pair<int, int> pii;



int multiply(int a, int b, int in_mod) { return (int)(1ll * a * b % in_mod); }
int mult_identity(int a) { return 1; }



const double pi = acosl(-1);



auto power(auto a, auto b, const int in_mod)
{

    auto prod = mult_identity(a);
    auto mult = a % in_mod;
    while (b != 0)
    {
        if (b % 2)
        {
            prod = multiply(prod, mult, in_mod);
        }
        if(b/2)
        mult = multiply(mult, mult, in_mod);
        b /= 2;
    }
    return prod;
}
auto mod_inv(auto q, const int in_mod)
{
    return power(q, in_mod - 2, in_mod);
}


mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());



#define stp cout << fixed << setprecision(20);


const int MAXN=5e5+10;
vector<int> fac(MAXN);
vector<int> infac(MAXN);
void build_factorial()
{
    fac[0]=1;
    infac[0]=1;
    for(int i=1;i<MAXN;i++)
    {
        fac[i]=(fac[i-1]*i)%mod;
        
    }
    infac[MAXN-1] = power(fac[MAXN -1], mod - 2, mod);

    for(int i= MAXN-2;i>=0;i--)
    {
        infac[i] = infac[i+1] *(i + 1) % mod;
    }
}
int ncr(int n, int r)
{
    if(n< r)
        return 0;
    return 1LL*fac[n] * infac[r] %mod * infac[n-r]%mod;
}



auto cmp(int a, int b)
{
    int len_a = to_string(a).size();
    int len_b = to_string(b).size();

    if(len_b != len_a)
        return len_a < len_b;
    return a < b;

};
void solv()
{
    int n, m, k;
    cin>>n>>m>>k;

    readv(a,n);


    sort(all(a));

    int ans = 0;
    int free_guys = 0;

    for(int bit = 30;bit>=0;bit--)
    {
        vector<int> on, off;
        for(auto i:a)
            if( i & (1<<bit))
                on.push_back(i);
            else
                off.push_back(i);
        if(on.size()>=k)
        {
            ans |= (1<<bit);

            a = on;
        }
        else
        {
            sort(all(off));
            int needed = k - on.size();

            reverse(all(off));
            int sm = accumulate(off.begin(), off.begin() + needed, (int)0);

            int need = (needed * (1<<bit)) - sm;
            if( need <= m)
            {
                m -= need;

                ans |= (1<<bit);
                while(on.size() <=k)
                    on.push_back((1<<bit));
                a = on;
            }else{
                //continue;
            }

        }
        for(auto &i:a)
            if( i& (1<<bit))
                i ^= (1<<bit);

    }

    cout<<ans<<endl;
}








void solve()
{
    int t = 1;
    // cin>>t;
    while(t--)
    {
        solv();
    }
}




signed main()
{



    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cerr.tie(NULL);

#ifdef ONLINE_JUDGE
    #ifdef ASC

    namespace fs = std::filesystem;
    std::string path = "./";
    string filename;
    for (const auto & entry : fs::directory_iterator(path)){
        if( entry.path().extension().string() == ".in"){
            filename = entry.path().filename().stem().string();
        }
    }
    if(filename != ""){
        string input_file = filename +".in";
        string output_file = filename +".out";
        if (fopen(input_file.c_str(), "r"))
        {
            freopen(input_file.c_str(), "r", stdin);
            freopen(output_file.c_str(), "w", stdout);
        }
    }
    #endif
#endif
    auto clk = clock();
    // -------------------------------------Code starts here---------------------------------------------------------------------

    signed t = 1;
    // cin >> t;

    for (signed test = 1; test <= t; test++)
    {
        // cout<<"Case #"<<test<<": ";

        solve();
    }

    // -------------------------------------Code ends here------------------------------------------------------------------

    clk = clock() - clk;

    #ifndef ONLINE_JUDGE
    cerr << fixed << setprecision(6) << "\nTime: " << ((float)clk) / CLOCKS_PER_SEC << "\n";
    #endif
    return 0;
}

提出情報

コンパイルエラー

./Main.cpp: In function ‘long long int mult_identity(long long int)’:
./Main.cpp:63:23: warning: unused parameter ‘a’ [-Wunused-parameter]
   63 | int mult_identity(int a) { return 1; }
      |                       ^
./Main.cpp: At global scope:
./Main.cpp:71:12: warning: use of ‘auto’ in parameter declaration only available with ‘-fconcepts’
   71 | auto power(auto a, auto b, const int in_mod)
      |            ^~~~
./Main.cpp:71:20: warning: use of ‘auto’ in parameter declaration only available with ‘-fconcepts’
   71 | auto power(auto a, auto b, const int in_mod)
      |                    ^~~~
./Main.cpp:88:14: warning: use of ‘auto’ in parameter declaration only available with ‘-fconcepts’
   88 | auto mod_inv(auto q, const int in_mod)
      |              ^~~~
./Main.cpp: In function ‘void solv()’:
./Main.cpp:160:21: warning: comparison of integer expressions of different signedness: ‘std::vector<long long int>::size_type’ {aka ‘long unsigned int’} and ‘long long int’ [-Wsign-compare]
  160 |         if(on.size()>=k)
      |            ~~~~~~~~~^~~
./Main.cpp:180:33: warning: comparison of integer expressions of different signedness: ‘std::vector<long long int>::size_type’ {aka ‘long unsigned int’} and ‘long long int’ [-Wsign-compare]
  180 |                 while(on.size() <=k)
      |                       ~~~~~~~~~~^~~
./Main.cpp:150:9: warning: unused variable ‘free_guys’ [-Wunused-variable]
  150 |     int free_guys = 0;
      |         ^~~~~~~~~

ジャッジ結果