oj.uz

Submission #937948

# Submission time Handle Problem Language Result Execution time Memory
937948 2024-03-04T17:03:04 Z Maite_Morale Let's Win the Election (JOI22_ho_t3) C++14
32 / 100
 389 ms 4328 KB 
    #include<bits/stdc++.h>
    #define F first
    #define S second
    #define MAX 500
    #define oo 1e9+7
    #define mod 1000000007
    #define fast_in ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);cout.setf(ios::fixed);cout.precision(3);
    using namespace std;
    typedef long long ll;
    typedef long double db;
    #define pll pair<ll , ll>
    #define vll vector<ll>
    #define vvll vector<vll>
    #define vpll vector<pll>
     
    ll t,n,mn[MAX],m,l[MAX];
    pll aux[MAX];
    db dp[MAX][MAX],cost[MAX];
    pair<db,db> a[MAX];
    int main(){
        fast_in
        cin>>n>>m;t=n;
        for(int i=0;i<n;i++){
            cin>>a[i].S>>a[i].F;
            if(a[i].F==-1){a[i].F=oo;t--;}
            aux[i]={a[i].S,a[i].F};
            mn[i]=a[i].S;
        }
        sort(a,a+n);sort(mn,mn+n);sort(aux,aux+n);
        ll s=0,top=m-1;
        for(int i=0;i<n;i++){
            aux[i]={aux[i].S,i};
            if(i<m)s+=mn[i];
            l[i]=i;
        }sort(aux,aux+n);
        for(int i=0;i<m;i++){
           cost[i]=s;
           if(aux[i].S<top){
              s-=mn[aux[i].S];
              if(aux[i].S>0)l[aux[i].S]=l[aux[i].S-1];
           }
           else{
              s-=mn[top];top=l[top-1];
           }
        }
        db r=cost[0];
        cost[m]=s;
        for(int k=0;k<=min(t,m);k++){
            for(int j=0;j<=k;j++){
                for(int i=0;i+k<=m;i++){
                    dp[i][j]=oo;
                    if(i+j==0)dp[i][j]=0;
                    if(i>0)dp[i][j]=min(dp[i][j],dp[i-1][j]+a[i+j-1].S/(k+1));
                    if(j>0)dp[i][j]=min(dp[i][j],dp[i][j-1]+a[i+j-1].F/j);
                  //  if(i>0)cout<<dp[i-1][j][k]<<"+"<<a[i+j-1].S/k<<".\n";
                  //  if(j>0)cout<<dp[i][j-1][k]<<"+"<<a[i+j-1].F/j<<"'\n";
                    if(j==k){
                    //    cout<<i<<" "<<k<<" "<<" "<<dp[i][k][k]<<"+"<<cost[i+k]<<"\n";
                        if(cost[i+k]==0)r=min(r,dp[i][j]);
                        else            r=min(r,dp[i][j]+cost[i+k]/(k+1));
                    }
                }
            }
        }
        cout<<r;
    return 0;
    }

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2908 KB Output is correct
9 Correct 1 ms 3416 KB Output is correct
10 Correct 1 ms 2908 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2908 KB Output is correct
9 Correct 1 ms 3416 KB Output is correct
10 Correct 1 ms 2908 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 11 ms 2652 KB Output is correct
13 Correct 12 ms 2648 KB Output is correct
14 Correct 8 ms 2648 KB Output is correct
15 Correct 130 ms 3408 KB Output is correct
16 Correct 117 ms 2980 KB Output is correct
17 Correct 25 ms 2908 KB Output is correct
18 Correct 379 ms 3932 KB Output is correct
19 Correct 240 ms 4044 KB Output is correct
20 Correct 33 ms 3672 KB Output is correct

Subtask #3
11.0 / 11.0

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

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Incorrect 1 ms 344 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Incorrect 1 ms 344 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 364 ms 3896 KB Output is correct
2 Correct 371 ms 4164 KB Output is correct
3 Correct 369 ms 3924 KB Output is correct
4 Correct 370 ms 3940 KB Output is correct
5 Correct 364 ms 3920 KB Output is correct
6 Correct 381 ms 4328 KB Output is correct
7 Correct 389 ms 3920 KB Output is correct

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2908 KB Output is correct
9 Correct 1 ms 3416 KB Output is correct
10 Correct 1 ms 2908 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 11 ms 2652 KB Output is correct
13 Correct 12 ms 2648 KB Output is correct
14 Correct 8 ms 2648 KB Output is correct
15 Correct 130 ms 3408 KB Output is correct
16 Correct 117 ms 2980 KB Output is correct
17 Correct 25 ms 2908 KB Output is correct
18 Correct 379 ms 3932 KB Output is correct
19 Correct 240 ms 4044 KB Output is correct
20 Correct 33 ms 3672 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 600 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Incorrect 1 ms 344 KB Output isn't correct
44 Halted 0 ms 0 KB -