oj.uz

Submission #529570

# Submission time Handle Problem Language Result Execution time Memory
529570 2022-02-23T08:00:06 Z wiwiho Let's Win the Election (JOI22_ho_t3) C++14
100 / 100
 1743 ms 4572 KB 
#include <bits/stdc++.h>
#include <bits/extc++.h>

#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define ef(a) emplace_front(a)
#define pob pop_back()
#define pof pop_front()
#define mp(a, b) make_pair(a, b)
#define F first
#define S second
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define tomax(a, b) ((a) = max((a), (b)))
#define tomin(a, b) ((a) = min((a), (b)))
#define topos(a) ((a) = (((a) % MOD + MOD) % MOD))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
    if(pvaspace) b << " "; pvaspace=true;\
    b << pva;\
}\
b << "\n";}

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using tiii = tuple<int, int, int>;

const ll MOD = 1000000007;
const ll MAX = 2147483647;

template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
    return o << '(' << p.F << ',' << p.S << ')';
}

ll ifloor(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a < 0) return (a - b + 1) / b;
    else return a / b;
}

ll iceil(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a > 0) return (a + b - 1) / b;
    else return a / b;
}

int n, K;
vector<int> a, b;

ld calc(int cnt){
    //cerr << "calc " << cnt << "\n";

    vector<vector<ld>> dp(cnt + 1, vector<ld>(n + 1, 1e87));
    dp[0][0] = 0;
    
    for(int i = 1; i <= n; i++){
        
        for(int j = K; j >= 1; j--){
            dp[cnt][j] = min(dp[cnt][j], dp[cnt][j - 1] + (ld)a[i] / (cnt + 1));
        }

        for(int j = cnt; j >= 0; j--){
            if(j != cnt) dp[j][i] = min(dp[j][i], dp[j][i - 1] + (ld)a[i] / (cnt + 1));
            if(j && b[i] != -1) dp[j][i] = min(dp[j][i], dp[j - 1][i - 1] + (ld)b[i] / j);
        }

        //cerr << "dp " << i << "\n";
        //for(int j = 0; j <= cnt; j++) printv(dp[j], cerr);
    }

    //cerr << "calc ok " << dp[cnt][K] << "\n";
    return dp[cnt][K];
}

int main(){
    StarBurstStream

    cin >> n >> K;
    a.resize(n + 1);
    b.resize(n + 1);

    vector<pii> tmp(n + 1);
    for(int i = 1; i <= n; i++) cin >> tmp[i].F >> tmp[i].S;

    sort(tmp.begin() + 1, tmp.end(), [&](pii a, pii b){
        if(a.S == b.S) return false;
        if(a.S == -1) return false;
        if(b.S == -1) return true;
        return a.S < b.S; 
    });
    for(int i = 1; i <= n; i++) tie(a[i], b[i]) = tmp[i];

    ld ans = 1e87;
    for(int i = 0; i <= K; i++) ans = min(ans, calc(i));
    
    cout << fixed << setprecision(20) << ans << "\n";

    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 14 ms 748 KB Output is correct
6 Correct 82 ms 1304 KB Output is correct
7 Correct 333 ms 2484 KB Output is correct
8 Correct 777 ms 3448 KB Output is correct
9 Correct 1344 ms 4336 KB Output is correct
10 Correct 655 ms 3376 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 14 ms 748 KB Output is correct
6 Correct 82 ms 1304 KB Output is correct
7 Correct 333 ms 2484 KB Output is correct
8 Correct 777 ms 3448 KB Output is correct
9 Correct 1344 ms 4336 KB Output is correct
10 Correct 655 ms 3376 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 152 ms 1504 KB Output is correct
13 Correct 155 ms 1848 KB Output is correct
14 Correct 125 ms 1580 KB Output is correct
15 Correct 833 ms 3280 KB Output is correct
16 Correct 758 ms 3064 KB Output is correct
17 Correct 691 ms 3080 KB Output is correct
18 Correct 1739 ms 4400 KB Output is correct
19 Correct 1569 ms 4340 KB Output is correct
20 Correct 1392 ms 4312 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 0 ms 204 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 0 ms 204 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 2 ms 332 KB Output is correct
44 Correct 3 ms 332 KB Output is correct
45 Correct 4 ms 332 KB Output is correct
46 Correct 4 ms 332 KB Output is correct
47 Correct 5 ms 332 KB Output is correct
48 Correct 6 ms 416 KB Output is correct
49 Correct 8 ms 436 KB Output is correct
50 Correct 7 ms 436 KB Output is correct
51 Correct 13 ms 480 KB Output is correct
52 Correct 13 ms 488 KB Output is correct
53 Correct 5 ms 332 KB Output is correct
54 Correct 6 ms 332 KB Output is correct
55 Correct 6 ms 408 KB Output is correct
56 Correct 6 ms 332 KB Output is correct
57 Correct 6 ms 332 KB Output is correct
58 Correct 6 ms 332 KB Output is correct
59 Correct 6 ms 332 KB Output is correct
60 Correct 6 ms 332 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1743 ms 4284 KB Output is correct
2 Correct 1716 ms 4376 KB Output is correct
3 Correct 1732 ms 4572 KB Output is correct
4 Correct 1740 ms 4512 KB Output is correct
5 Correct 1704 ms 4412 KB Output is correct
6 Correct 1700 ms 4476 KB Output is correct
7 Correct 1710 ms 4284 KB Output is correct

Subtask #7
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 14 ms 748 KB Output is correct
6 Correct 82 ms 1304 KB Output is correct
7 Correct 333 ms 2484 KB Output is correct
8 Correct 777 ms 3448 KB Output is correct
9 Correct 1344 ms 4336 KB Output is correct
10 Correct 655 ms 3376 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 152 ms 1504 KB Output is correct
13 Correct 155 ms 1848 KB Output is correct
14 Correct 125 ms 1580 KB Output is correct
15 Correct 833 ms 3280 KB Output is correct
16 Correct 758 ms 3064 KB Output is correct
17 Correct 691 ms 3080 KB Output is correct
18 Correct 1739 ms 4400 KB Output is correct
19 Correct 1569 ms 4340 KB Output is correct
20 Correct 1392 ms 4312 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 0 ms 204 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 0 ms 204 KB Output is correct
41 Correct 0 ms 204 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 0 ms 204 KB Output is correct
45 Correct 0 ms 204 KB Output is correct
46 Correct 0 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 0 ms 204 KB Output is correct
50 Correct 1 ms 204 KB Output is correct
51 Correct 0 ms 204 KB Output is correct
52 Correct 1 ms 204 KB Output is correct
53 Correct 0 ms 204 KB Output is correct
54 Correct 0 ms 204 KB Output is correct
55 Correct 1 ms 204 KB Output is correct
56 Correct 1 ms 204 KB Output is correct
57 Correct 0 ms 204 KB Output is correct
58 Correct 0 ms 204 KB Output is correct
59 Correct 1 ms 204 KB Output is correct
60 Correct 0 ms 204 KB Output is correct
61 Correct 1 ms 332 KB Output is correct
62 Correct 1 ms 332 KB Output is correct
63 Correct 2 ms 332 KB Output is correct
64 Correct 3 ms 332 KB Output is correct
65 Correct 4 ms 332 KB Output is correct
66 Correct 4 ms 332 KB Output is correct
67 Correct 5 ms 332 KB Output is correct
68 Correct 6 ms 416 KB Output is correct
69 Correct 8 ms 436 KB Output is correct
70 Correct 7 ms 436 KB Output is correct
71 Correct 13 ms 480 KB Output is correct
72 Correct 13 ms 488 KB Output is correct
73 Correct 5 ms 332 KB Output is correct
74 Correct 6 ms 332 KB Output is correct
75 Correct 6 ms 408 KB Output is correct
76 Correct 6 ms 332 KB Output is correct
77 Correct 6 ms 332 KB Output is correct
78 Correct 6 ms 332 KB Output is correct
79 Correct 6 ms 332 KB Output is correct
80 Correct 6 ms 332 KB Output is correct
81 Correct 1743 ms 4284 KB Output is correct
82 Correct 1716 ms 4376 KB Output is correct
83 Correct 1732 ms 4572 KB Output is correct
84 Correct 1740 ms 4512 KB Output is correct
85 Correct 1704 ms 4412 KB Output is correct
86 Correct 1700 ms 4476 KB Output is correct
87 Correct 1710 ms 4284 KB Output is correct
88 Correct 17 ms 676 KB Output is correct
89 Correct 17 ms 692 KB Output is correct
90 Correct 107 ms 1304 KB Output is correct
91 Correct 103 ms 1284 KB Output is correct
92 Correct 418 ms 2284 KB Output is correct
93 Correct 426 ms 2364 KB Output is correct
94 Correct 971 ms 3544 KB Output is correct
95 Correct 957 ms 3408 KB Output is correct
96 Correct 1370 ms 3980 KB Output is correct
97 Correct 1381 ms 4036 KB Output is correct
98 Correct 830 ms 3148 KB Output is correct
99 Correct 843 ms 3260 KB Output is correct
100 Correct 840 ms 3344 KB Output is correct
101 Correct 833 ms 3168 KB Output is correct
102 Correct 829 ms 3336 KB Output is correct
103 Correct 834 ms 3160 KB Output is correct
104 Correct 820 ms 3116 KB Output is correct
105 Correct 824 ms 3080 KB Output is correct