oj.uz

Submission #778939

# Submission time Handle Problem Language Result Execution time Memory
778939 2023-07-11T04:02:54 Z bachhoangxuan Let's Win the Election (JOI22_ho_t3) C++17
100 / 100
 194 ms 2380 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld double
#define pii pair<int,int>
#define piii pair<pii,int>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e9;
const int mod=1e9+7;
const int maxn=505;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=250000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;
ld dp[maxn][maxn];
void solve(){
    int n,k;cin >> n >> k;
    vector<pii> p(n);
    for(int i=0;i<n;i++) cin >> p[i].se >> p[i].fi,p[i].fi=(p[i].fi==-1?inf:p[i].fi);
    sort(p.begin(),p.end());
    ld res=inf;
    for(int d=0;d<=k;d++){
        for(int i=0;i<=n;i++) for(int j=0;j<=k-d;j++) dp[i][j]=inf;
        dp[0][0]=0;
        for(int i=0;i<n;i++){
            for(int j=0;j<=k-d;j++){
                if(j<k-d) dp[i+1][j+1]=min(dp[i+1][j+1],dp[i][j]+(ld)p[i].se/(d+1));
                dp[i+1][j]=min(dp[i+1][j],dp[i][j]+(i-j<d?ld(p[i].fi)/(i-j+1):0));
            }
        }
        res=min(res,dp[n][k-d]);
    }
    cout << setprecision(10) << fixed << res << '\n';
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 3 ms 2260 KB Output is correct
6 Correct 11 ms 2260 KB Output is correct
7 Correct 42 ms 2260 KB Output is correct
8 Correct 100 ms 2300 KB Output is correct
9 Correct 190 ms 2304 KB Output is correct
10 Correct 85 ms 2296 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 3 ms 2260 KB Output is correct
6 Correct 11 ms 2260 KB Output is correct
7 Correct 42 ms 2260 KB Output is correct
8 Correct 100 ms 2300 KB Output is correct
9 Correct 190 ms 2304 KB Output is correct
10 Correct 85 ms 2296 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 15 ms 2320 KB Output is correct
13 Correct 15 ms 2260 KB Output is correct
14 Correct 15 ms 2316 KB Output is correct
15 Correct 89 ms 2260 KB Output is correct
16 Correct 95 ms 2380 KB Output is correct
17 Correct 86 ms 2256 KB Output is correct
18 Correct 186 ms 2300 KB Output is correct
19 Correct 186 ms 2300 KB Output is correct
20 Correct 194 ms 2304 KB Output is correct

Subtask #3
11.0 / 11.0

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

Subtask #4
12.0 / 12.0

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

Subtask #5
33.0 / 33.0

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

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 185 ms 2260 KB Output is correct
2 Correct 190 ms 2304 KB Output is correct
3 Correct 191 ms 2308 KB Output is correct
4 Correct 186 ms 2300 KB Output is correct
5 Correct 186 ms 2260 KB Output is correct
6 Correct 186 ms 2296 KB Output is correct
7 Correct 185 ms 2300 KB Output is correct

Subtask #7
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 3 ms 2260 KB Output is correct
6 Correct 11 ms 2260 KB Output is correct
7 Correct 42 ms 2260 KB Output is correct
8 Correct 100 ms 2300 KB Output is correct
9 Correct 190 ms 2304 KB Output is correct
10 Correct 85 ms 2296 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 15 ms 2320 KB Output is correct
13 Correct 15 ms 2260 KB Output is correct
14 Correct 15 ms 2316 KB Output is correct
15 Correct 89 ms 2260 KB Output is correct
16 Correct 95 ms 2380 KB Output is correct
17 Correct 86 ms 2256 KB Output is correct
18 Correct 186 ms 2300 KB Output is correct
19 Correct 186 ms 2300 KB Output is correct
20 Correct 194 ms 2304 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 328 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 336 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 332 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 336 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 332 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 1 ms 336 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 1 ms 328 KB Output is correct
61 Correct 1 ms 724 KB Output is correct
62 Correct 1 ms 724 KB Output is correct
63 Correct 1 ms 724 KB Output is correct
64 Correct 1 ms 720 KB Output is correct
65 Correct 1 ms 724 KB Output is correct
66 Correct 1 ms 724 KB Output is correct
67 Correct 1 ms 724 KB Output is correct
68 Correct 1 ms 724 KB Output is correct
69 Correct 2 ms 724 KB Output is correct
70 Correct 2 ms 716 KB Output is correct
71 Correct 2 ms 724 KB Output is correct
72 Correct 2 ms 724 KB Output is correct
73 Correct 1 ms 724 KB Output is correct
74 Correct 1 ms 724 KB Output is correct
75 Correct 2 ms 724 KB Output is correct
76 Correct 1 ms 724 KB Output is correct
77 Correct 1 ms 724 KB Output is correct
78 Correct 1 ms 724 KB Output is correct
79 Correct 1 ms 724 KB Output is correct
80 Correct 1 ms 728 KB Output is correct
81 Correct 185 ms 2260 KB Output is correct
82 Correct 190 ms 2304 KB Output is correct
83 Correct 191 ms 2308 KB Output is correct
84 Correct 186 ms 2300 KB Output is correct
85 Correct 186 ms 2260 KB Output is correct
86 Correct 186 ms 2296 KB Output is correct
87 Correct 185 ms 2300 KB Output is correct
88 Correct 3 ms 2260 KB Output is correct
89 Correct 3 ms 2256 KB Output is correct
90 Correct 11 ms 2260 KB Output is correct
91 Correct 11 ms 2248 KB Output is correct
92 Correct 41 ms 2260 KB Output is correct
93 Correct 43 ms 2256 KB Output is correct
94 Correct 105 ms 2296 KB Output is correct
95 Correct 98 ms 2300 KB Output is correct
96 Correct 148 ms 2300 KB Output is correct
97 Correct 147 ms 2252 KB Output is correct
98 Correct 84 ms 2300 KB Output is correct
99 Correct 91 ms 2304 KB Output is correct
100 Correct 84 ms 2260 KB Output is correct
101 Correct 85 ms 2300 KB Output is correct
102 Correct 84 ms 2300 KB Output is correct
103 Correct 86 ms 2296 KB Output is correct
104 Correct 88 ms 2304 KB Output is correct
105 Correct 85 ms 2260 KB Output is correct