Submission #1268535

#TimeUsernameProblemLanguageResultExecution timeMemory
1268535lambd47Let's Win the Election (JOI22_ho_t3)C++20
Compilation error
0 ms0 KiB
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>

#define int long long 
using namespace std;

#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define pii pair<int,int>

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

const int MOD=1e9+7;
void solve() {
    int n,m;
    cin>>n>>m;
    vector<pii> vec(n);
    L(i,0,n-1){
        cin>>vec[i].first>>vec[i].second;
        if(vec[i].second==-1)vec[i].second=MOD;
    }

    sort(all(vec),[&](pii a, pii b){
            if(a.second==b.second)return a.first<b.first;
            return a.second<b.second;
    });

    auto testa=[&](int k)->double{
        vector<vector<double>> dp(k+1,vector<double> (m-k+1,(double)MOD));
        dp[0][0]=0;
        L(i,0,n-1){
            R(j,k,0){
                R(f,m-k,0){
                    if(j!=k && vec[i].second!=MOD)dp[j+1][f]=min(dp[j+1][f],dp[j][f]+(double)vec[i].second/(j+1));
                    if(f!=(m-k))dp[j][f+1]=min(dp[j][f+1],dp[j][f]+(double)vec[i].first/(k+1));
                }
            }
        }
        return dp[k][m-k];
    };
    cout<<fixed<<setprecision(8);
    double resp=(double) MOD;




    cout<<resp<<"\n";
}
 
int32_t main() {
    std::cin.tie(0)->sync_with_stdio(0); 
    std::cin.exceptions(std::cin.failbit);

    int T = 1;
//    std::cin >> T;
    while(T--) {
        solve();
    }

	return 0;
}


Compilation message (stderr)

In file included from /usr/include/c++/13/string:43,
                 from /usr/include/c++/13/bitset:52,
                 from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:52,
                 from Main.cpp:4:
/usr/include/c++/13/bits/allocator.h: In destructor 'constexpr std::_Vector_base<std::pair<long long int, long long int>, std::allocator<std::pair<long long int, long long int> > >::_Vector_impl::~_Vector_impl()':
/usr/include/c++/13/bits/allocator.h:184:7: error: inlining failed in call to 'always_inline' 'constexpr std::allocator< <template-parameter-1-1> >::~allocator() noexcept [with _Tp = std::pair<long long int, long long int>]': target specific option mismatch
  184 |       ~allocator() _GLIBCXX_NOTHROW { }
      |       ^
In file included from /usr/include/c++/13/vector:66,
                 from /usr/include/c++/13/functional:64,
                 from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:53:
/usr/include/c++/13/bits/stl_vector.h:133:14: note: called from here
  133 |       struct _Vector_impl
      |              ^~~~~~~~~~~~