oj.uz

답안 #1004002

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1004002 2024-06-20T22:59:07 Z CSQ31 Let's Win the Election (JOI22_ho_t3) C++17
0 / 100
 2500 ms 4804 KB 
#pragma GCC optimize("Ofast") 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
ld dp[555][555];
int main()
{
    int n,K;
    cin>>n>>K;
    vector<PII>t(n);
    vector<ld>a(n),b(n);
    for(int i=0;i<n;i++){
        cin>>t[i].se>>t[i].fi;
        if(t[i].fi == -1)t[i].fi = 1e18;
    } 
    sort(all(t));
    for(int i=0;i<n;i++){
        a[i] = t[i].se;
        b[i] = t[i].fi;
        if(b[i] == 1e18)b[i] = -1;
    }
    ld ans = 1e18;
    for(int k=0;k<n;k++){
        for(int i=0;i<n;i++){
            for(int j=0;j<=n;j++)dp[i][j] = 1e18;
        }
        dp[0][0] = a[0]/(k+1);
        if(b[0] != -1)dp[0][1] = b[0];
        for(int i=1;i<n;i++){
            for(int j=0;j<=i+1;j++){
                dp[i][j] = min(dp[i][j],dp[i-1][j] + a[i]/(k+1));
                if(j && b[i] != -1){
                    dp[i][j] = min(dp[i][j],dp[i-1][j-1] + b[i]/j);
                }
            }
        }
        // for(int i=0;i<n;i++){
        //     for(int j=0;j<=i+1;j++)cout<<dp[i][j]<<" ";
        //     cout<<'\n';
        // }
        for(int i=0;i<K;i++){
            ld cost = dp[i][k];
            vector<ld>lf;
            for(int j=i+1;j<n;j++)lf.pb(a[j]/(k+1));
            sort(all(lf));
            for(int j=0;j<K-i-1;j++)cost += lf[j];
            ans = min(ans,cost);
        }
    }
    cout<<fixed<<setprecision(5)<<ans<<'\n';
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 0 ms 440 KB Output is correct
5 Correct 936 ms 4700 KB Output is correct
6 Correct 1416 ms 4804 KB Output is correct
7 Correct 2029 ms 4696 KB Output is correct
8 Correct 2409 ms 4700 KB Output is correct
9 Execution timed out 2557 ms 4700 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 0 ms 440 KB Output is correct
5 Correct 936 ms 4700 KB Output is correct
6 Correct 1416 ms 4804 KB Output is correct
7 Correct 2029 ms 4696 KB Output is correct
8 Correct 2409 ms 4700 KB Output is correct
9 Execution timed out 2557 ms 4700 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2554 ms 4700 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 0 ms 440 KB Output is correct
5 Correct 936 ms 4700 KB Output is correct
6 Correct 1416 ms 4804 KB Output is correct
7 Correct 2029 ms 4696 KB Output is correct
8 Correct 2409 ms 4700 KB Output is correct
9 Execution timed out 2557 ms 4700 KB Time limit exceeded
10 Halted 0 ms 0 KB -