# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
867885 | 2023-10-29T16:35:35 Z | efedmrlr | Let's Win the Election (JOI22_ho_t3) | C++17 | 1765 ms | 8788 KB |
#include <bits/stdc++.h> using namespace std; #define n_l '\n' #define dbg(...) cout << "[" << #__VA_ARGS__ << "]: "; cout << to_string(__VA_ARGS__) << endl template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)), __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); } #define dbgm(...) cout << "[" << #__VA_ARGS__ << "]: "; dbgm(__VA_ARGS__); cout << endl #define lli long long int #define MP make_pair #define pb push_back #define REP(i,n) for(int (i) = 0; (i) < (n); (i)++) #define ld long double void fastio() { ios_base::sync_with_stdio(false); cin.tie(NULL); } const double EPS = 0.0001; const ld INF = 1e16; const int N = 600; const int M = 3e5+5; const int ALPH = 26; const int LGN = 25; const int MOD = 1e9+7; int n,m,q,K; vector<array<ld,2> > a; vector<vector<ld> > dp, dpnew; inline void solve() { cin >> n >> K; a.resize(n+1); a[0] = {0, 0}; REP(i,n) { cin >> a[i + 1][1] >> a[i + 1][0]; if(a[i + 1][0] == -1) a[i + 1][0] = INF; } sort(a.begin(), a.end()); dp.assign(n + 10, vector<ld>(n + 10, INF)); dpnew.assign(n + 10, vector<ld> (n + 10, INF)); dp[0][0] = 0; for(int i = 1; i<=n; i++) { for(int k = 0; k<=K; k++) { for(int b = 0; b<=K; b++) { dpnew[k][b] = dp[k][b]; if(k > 0) { dpnew[k][b] = min(dpnew[k][b], dp[k - 1][b] + a[i][1] / (ld)(b + 1)); if(b > 0 && abs(a[i][0] - INF) >= EPS) { dpnew[k][b] = min(dpnew[k][b], dp[k - 1][b - 1] + (a[i][0] / (ld)b)); } } } } swap(dp, dpnew); } ld ans = INF; for(int b = 0; b<=K; b++) { ans = min(ans , dp[K][b]); } cout<< setprecision(9) << fixed << ans <<"\n"; } signed main() { fastio(); int test = 1; //cin>>test; while(test--) { solve(); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 16 ms | 8672 KB | Output is correct |
6 | Correct | 92 ms | 8540 KB | Output is correct |
7 | Correct | 315 ms | 8540 KB | Output is correct |
8 | Correct | 748 ms | 8652 KB | Output is correct |
9 | Correct | 1280 ms | 8648 KB | Output is correct |
10 | Correct | 617 ms | 8644 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 16 ms | 8672 KB | Output is correct |
6 | Correct | 92 ms | 8540 KB | Output is correct |
7 | Correct | 315 ms | 8540 KB | Output is correct |
8 | Correct | 748 ms | 8652 KB | Output is correct |
9 | Correct | 1280 ms | 8648 KB | Output is correct |
10 | Correct | 617 ms | 8644 KB | Output is correct |
11 | Correct | 0 ms | 348 KB | Output is correct |
12 | Correct | 174 ms | 8540 KB | Output is correct |
13 | Correct | 143 ms | 8536 KB | Output is correct |
14 | Correct | 123 ms | 8540 KB | Output is correct |
15 | Correct | 847 ms | 8540 KB | Output is correct |
16 | Correct | 780 ms | 8652 KB | Output is correct |
17 | Correct | 680 ms | 8652 KB | Output is correct |
18 | Correct | 1765 ms | 8652 KB | Output is correct |
19 | Correct | 1552 ms | 8652 KB | Output is correct |
20 | Correct | 1358 ms | 8788 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Correct | 0 ms | 344 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 1 ms | 544 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 0 ms | 372 KB | Output is correct |
8 | Correct | 0 ms | 348 KB | Output is correct |
9 | Incorrect | 0 ms | 348 KB | Output isn't correct |
10 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Correct | 0 ms | 344 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 1 ms | 544 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 0 ms | 372 KB | Output is correct |
8 | Correct | 0 ms | 348 KB | Output is correct |
9 | Incorrect | 0 ms | 348 KB | Output isn't correct |
10 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Correct | 0 ms | 344 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 1 ms | 544 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 0 ms | 372 KB | Output is correct |
8 | Correct | 0 ms | 348 KB | Output is correct |
9 | Incorrect | 0 ms | 348 KB | Output isn't correct |
10 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1735 ms | 8648 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 16 ms | 8672 KB | Output is correct |
6 | Correct | 92 ms | 8540 KB | Output is correct |
7 | Correct | 315 ms | 8540 KB | Output is correct |
8 | Correct | 748 ms | 8652 KB | Output is correct |
9 | Correct | 1280 ms | 8648 KB | Output is correct |
10 | Correct | 617 ms | 8644 KB | Output is correct |
11 | Correct | 0 ms | 348 KB | Output is correct |
12 | Correct | 174 ms | 8540 KB | Output is correct |
13 | Correct | 143 ms | 8536 KB | Output is correct |
14 | Correct | 123 ms | 8540 KB | Output is correct |
15 | Correct | 847 ms | 8540 KB | Output is correct |
16 | Correct | 780 ms | 8652 KB | Output is correct |
17 | Correct | 680 ms | 8652 KB | Output is correct |
18 | Correct | 1765 ms | 8652 KB | Output is correct |
19 | Correct | 1552 ms | 8652 KB | Output is correct |
20 | Correct | 1358 ms | 8788 KB | Output is correct |
21 | Correct | 1 ms | 344 KB | Output is correct |
22 | Correct | 0 ms | 344 KB | Output is correct |
23 | Correct | 0 ms | 344 KB | Output is correct |
24 | Correct | 0 ms | 348 KB | Output is correct |
25 | Correct | 1 ms | 544 KB | Output is correct |
26 | Correct | 0 ms | 348 KB | Output is correct |
27 | Correct | 0 ms | 372 KB | Output is correct |
28 | Correct | 0 ms | 348 KB | Output is correct |
29 | Incorrect | 0 ms | 348 KB | Output isn't correct |
30 | Halted | 0 ms | 0 KB | - |