oj.uz

Submission #681798

# Submission time Handle Problem Language Result Execution time Memory
681798 2023-01-14T11:16:54 Z sysia Let's Win the Election (JOI22_ho_t3) C++17
10 / 100
 1336 ms 8532 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+1, 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+1, oo));
        for (int ck = 0; ck <= k; ck++){
            for (int col = 1; col <= n; 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 102 ms 1128 KB Output is correct
6 Correct 324 ms 2316 KB Output is correct
7 Correct 542 ms 4440 KB Output is correct
8 Correct 876 ms 6468 KB Output is correct
9 Correct 1184 ms 8392 KB Output is correct
10 Correct 768 ms 5944 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 102 ms 1128 KB Output is correct
6 Correct 324 ms 2316 KB Output is correct
7 Correct 542 ms 4440 KB Output is correct
8 Correct 876 ms 6468 KB Output is correct
9 Correct 1184 ms 8392 KB Output is correct
10 Correct 768 ms 5944 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 365 ms 2852 KB Output is correct
13 Correct 343 ms 2700 KB Output is correct
14 Correct 320 ms 2828 KB Output is correct
15 Correct 949 ms 6096 KB Output is correct
16 Correct 818 ms 6008 KB Output is correct
17 Correct 798 ms 6168 KB Output is correct
18 Correct 1326 ms 8348 KB Output is correct
19 Correct 1241 ms 8516 KB Output is correct
20 Correct 1190 ms 8532 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 0 ms 212 KB Output is correct
6 Correct 0 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 0 ms 212 KB Output is correct
6 Correct 0 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 0 ms 212 KB Output is correct
6 Correct 0 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 1336 ms 8416 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 102 ms 1128 KB Output is correct
6 Correct 324 ms 2316 KB Output is correct
7 Correct 542 ms 4440 KB Output is correct
8 Correct 876 ms 6468 KB Output is correct
9 Correct 1184 ms 8392 KB Output is correct
10 Correct 768 ms 5944 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 365 ms 2852 KB Output is correct
13 Correct 343 ms 2700 KB Output is correct
14 Correct 320 ms 2828 KB Output is correct
15 Correct 949 ms 6096 KB Output is correct
16 Correct 818 ms 6008 KB Output is correct
17 Correct 798 ms 6168 KB Output is correct
18 Correct 1326 ms 8348 KB Output is correct
19 Correct 1241 ms 8516 KB Output is correct
20 Correct 1190 ms 8532 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 0 ms 212 KB Output is correct
26 Correct 0 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 -