Submission #843974

#TimeUsernameProblemLanguageResultExecution timeMemory
843974jmyszka2007Let's Win the Election (JOI22_ho_t3)C++17
100 / 100
388 ms604 KiB
#include <bits/stdc++.h> #include <fstream> using namespace std; template<class A, class B> ostream& operator<<(ostream& o, const pair<A, B>& p) {return o << '(' << p.first << ", " << p.second << ')';} template<size_t Index = 0, typename... Types> ostream& printTupleElements(ostream& o, const tuple<Types...>& t) {if constexpr (Index < sizeof...(Types)){if(Index > 0){o << ", ";}o << get<Index>(t);printTupleElements<Index + 1>(o, t);}return o;} template<typename... Types> ostream& operator<<(ostream& o, const tuple<Types...>& t){o << "(";printTupleElements(o, t);return o << ")";} template<class T> auto operator<<(ostream& o, const T& x) -> decltype(x.end(), o){o << '{';bool first = true;for (const auto& e : x){if (!first){o << ", ";}o << e;first = false;} return o << '}';} #define DEBUG #ifdef DEBUG #define fastio() #define debug(x...) cerr << "[" #x "]: ", [](auto... $) {((cerr << $ << "; "), ...); }(x), cerr << '\n' #define check(x) if (!(x)) { cerr << "Check failed: " << #x << " in line " << __LINE__ << endl; exit(1); } #else #define fastio() ios_base::sync_with_stdio(0); cin.tie(0); #define debug(...) #define check(x) #endif typedef long long ll; typedef long double ld; #define pi pair<int, int> #define pl pair<ll, ll> #define st first #define nd second #define vi vector<int> #define vll vector<ll> #define eb emplace_back #define all(x) (x).begin(), (x).end() #define sz(x) (int)(x).size() vector<pair<ld, ld> >prz; int n, k; ld cntdp(int x) { vector<ld>dp(k - x + 1, 1e9); dp[0] = 0; for(int i = 0; i < sz(prz); i++) { for(int j = min(i + 1, k - x); j >= 0; j--) { ld popdp = dp[j]; if(j > 0) { dp[j] = dp[j - 1] + prz[i].nd / (ld)(x + 1); } else { dp[j] = 1e9; } if(0 < (i + 1) - j && (i + 1) - j <= x) { dp[j] = min(dp[j], popdp + prz[i].st / (ld)((i + 1) - j)); } else { dp[j] = min(dp[j], popdp); } } } return dp[k - x]; } void solve() { //ifstream cin("nazwa.in"); //ofstream cout("nazwa.out"); cin >> n >> k; for(int i = 1; i <= n; i++) { int a, b; cin >> a >> b; if(b == -1) { b = 1e9; } prz.eb(b, a); } sort(all(prz)); ld ans = 1e9; for(int i = 0; i <= k; i++) { ans = min(ans, cntdp(i)); } cout.precision(9); cout << fixed << ans << '\n'; } int main() { fastio(); int t; //cin >> t; t = 1; while(t--) { solve(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...