oj.uz

답안 #658849

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
658849 2022-11-15T04:49:45 Z Darren0724 Let's Win the Election (JOI22_ho_t3) C++17
21 / 100
 436 ms 2564 KB 
#include<bits/stdc++.h>
using namespace std;
#define all(x) x.begin(),x.end()
#define int long long
int INF=1e9;

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n;cin>>n;
    int k;cin>>k;
    vector<pair<int,int>> v(n+1);
    for(int i=1;i<=n;i++){
        cin>>v[i].first>>v[i].second;
        if(v[i].second==-1){
            v[i].second=INF;
        }
    }
    sort(all(v),[&](pair<int,int> a,pair<int,int> b){
        return a.second<b.second;
    });
    double ans=INF;
    for(int t=0;t<k;t++){
        vector<vector<double>> dp(t+1,vector<double>(n+1,INF));
        dp[0][0]=0;
        for(int i=1;i<=n;i++){
            dp[0][i]=dp[0][i-1]+v[i].first/(t+1);
        }
        for(int i=1;i<=t;i++){
            for(int j=1;j<=n;j++){
                dp[i][j]=min(dp[i][j],dp[i-1][j-1]+(double)v[j].second/i);
                dp[i][j]=min(dp[i][j],dp[i][j-1]+(double)v[j].first/(t+1));
            }
        }
        double total=0;
        double mn=INF;
        priority_queue<double,vector<double>,greater<double>> pq;
        for(int i=n;i>k;i--){
            pq.push((double)v[i].first/(t+1));
        }
        for(int i=k;i>=t;i--){
            mn=min(mn,dp[t][i]+total);
            pq.push((double)v[i].first/(t+1));
            while(pq.size()>n-k){
                total+=pq.top();
                pq.pop();
            }
        }
        ans=min(ans,mn);
    }
    cout<<setprecision(9)<<ans<<endl;
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:44:28: warning: comparison of integer expressions of different signedness: 'std::priority_queue<double, std::vector<double>, std::greater<double> >::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   44 |             while(pq.size()>n-k){
      |                   ~~~~~~~~~^~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 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 4 ms 512 KB Output is correct
6 Correct 25 ms 836 KB Output is correct
7 Correct 112 ms 1292 KB Output is correct
8 Correct 228 ms 1788 KB Output is correct
9 Correct 417 ms 2436 KB Output is correct
10 Correct 198 ms 1696 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 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 4 ms 512 KB Output is correct
6 Correct 25 ms 836 KB Output is correct
7 Correct 112 ms 1292 KB Output is correct
8 Correct 228 ms 1788 KB Output is correct
9 Correct 417 ms 2436 KB Output is correct
10 Correct 198 ms 1696 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 39 ms 916 KB Output is correct
13 Correct 35 ms 908 KB Output is correct
14 Correct 35 ms 920 KB Output is correct
15 Correct 202 ms 1856 KB Output is correct
16 Correct 205 ms 1812 KB Output is correct
17 Correct 198 ms 1760 KB Output is correct
18 Correct 400 ms 2364 KB Output is correct
19 Correct 423 ms 2564 KB Output is correct
20 Correct 414 ms 2400 KB Output is correct

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 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 1 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 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Incorrect 0 ms 316 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 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 1 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 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Incorrect 0 ms 316 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 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 1 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 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Incorrect 0 ms 316 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 436 ms 2332 KB Output is correct
2 Correct 433 ms 2352 KB Output is correct
3 Correct 410 ms 2300 KB Output is correct
4 Correct 414 ms 2348 KB Output is correct
5 Correct 430 ms 2444 KB Output is correct
6 Correct 405 ms 2360 KB Output is correct
7 Correct 421 ms 2384 KB Output is correct

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 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 4 ms 512 KB Output is correct
6 Correct 25 ms 836 KB Output is correct
7 Correct 112 ms 1292 KB Output is correct
8 Correct 228 ms 1788 KB Output is correct
9 Correct 417 ms 2436 KB Output is correct
10 Correct 198 ms 1696 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 39 ms 916 KB Output is correct
13 Correct 35 ms 908 KB Output is correct
14 Correct 35 ms 920 KB Output is correct
15 Correct 202 ms 1856 KB Output is correct
16 Correct 205 ms 1812 KB Output is correct
17 Correct 198 ms 1760 KB Output is correct
18 Correct 400 ms 2364 KB Output is correct
19 Correct 423 ms 2564 KB Output is correct
20 Correct 414 ms 2400 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 1 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 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Incorrect 0 ms 316 KB Output isn't correct
34 Halted 0 ms 0 KB -