oj.uz

Submission #682135

# Submission time Handle Problem Language Result Execution time Memory
682135 2023-01-15T21:55:31 Z sysia Let's Win the Election (JOI22_ho_t3) C++17
10 / 100
 1365 ms 8464 KB 
//Sylwia Sapkowska
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;
 
void __print(int x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
 
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef LOCAL
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
 
#define int long long
typedef pair<int, int> T;
typedef long double ld;
const int oo = 1e18, oo2 = 1e9+7, K = 30;
const int mod = 998244353;
 
void solve(){
    int n, k; cin >> n >> k;
    vector<T>tab;
    tab.emplace_back(-oo, -oo);
    for (int i = 1; i<=n; i++){
        int x, y; cin >> x >> y;
        if (y == -1) y = oo2;
        tab.emplace_back(x, y);
    }
    sort(tab.begin(), tab.end(),[](auto x, auto y){return x.second == y.second ? x.first < y.first : x.second < y.second;});
    vector dp(k+1, vector<ld>(n+2, oo));
    dp[0][1] = 0;
    for (int i = 1; i<=n; i++){
        auto [a, b] = tab[i];
        vector new_dp(k+1, vector<ld>(n+2, oo));
        for (int ck = 0; ck <= k; ck++){
            for (int col = 1; col <= n+1; col++){
                //dp[i][ck][col]-->
                //nic nie robimy --> dokladamy glos --> dokladamy glos i kolaboranta
                new_dp[ck][col] = min({dp[ck][col], 
                                    (ck ? dp[ck-1][col] + (ld)(a)/(ld)(col) : (ld)oo), 
                                    (ck && col >= 2 && b != oo2 ? dp[ck-1][col-1] + (ld)(b)/(ld)(col-1) : (ld)oo)
                                });
            }
        }
        dp.swap(new_dp);
    }
    ld ans = oo;
    for (int i = 1; i<=n; i++) ans = min(ans, dp[k][i]);
    cout << fixed << setprecision(17) << ans << "\n";
}
 
int32_t main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
 
    solve();
 
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 127 ms 1148 KB Output is correct
6 Correct 277 ms 2384 KB Output is correct
7 Correct 636 ms 4700 KB Output is correct
8 Correct 880 ms 6336 KB Output is correct
9 Correct 1188 ms 8440 KB Output is correct
10 Correct 815 ms 6060 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 127 ms 1148 KB Output is correct
6 Correct 277 ms 2384 KB Output is correct
7 Correct 636 ms 4700 KB Output is correct
8 Correct 880 ms 6336 KB Output is correct
9 Correct 1188 ms 8440 KB Output is correct
10 Correct 815 ms 6060 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 360 ms 2824 KB Output is correct
13 Correct 440 ms 2776 KB Output is correct
14 Correct 381 ms 2936 KB Output is correct
15 Correct 896 ms 6044 KB Output is correct
16 Correct 878 ms 6068 KB Output is correct
17 Correct 810 ms 6100 KB Output is correct
18 Correct 1351 ms 8352 KB Output is correct
19 Correct 1365 ms 8464 KB Output is correct
20 Correct 1314 ms 8376 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Incorrect 0 ms 212 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Incorrect 0 ms 212 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Incorrect 0 ms 212 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1341 ms 8268 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 127 ms 1148 KB Output is correct
6 Correct 277 ms 2384 KB Output is correct
7 Correct 636 ms 4700 KB Output is correct
8 Correct 880 ms 6336 KB Output is correct
9 Correct 1188 ms 8440 KB Output is correct
10 Correct 815 ms 6060 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 360 ms 2824 KB Output is correct
13 Correct 440 ms 2776 KB Output is correct
14 Correct 381 ms 2936 KB Output is correct
15 Correct 896 ms 6044 KB Output is correct
16 Correct 878 ms 6068 KB Output is correct
17 Correct 810 ms 6100 KB Output is correct
18 Correct 1351 ms 8352 KB Output is correct
19 Correct 1365 ms 8464 KB Output is correct
20 Correct 1314 ms 8376 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Incorrect 0 ms 212 KB Output isn't correct
30 Halted 0 ms 0 KB -