답안 #658846

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
658846	2022-11-15T04:02:45 Z	Darren0724	Let's Win the Election (JOI22_ho_t3)	C++17	10 / 100	496 ms	2532 KB

Main

#include<bits/stdc++.h>
using namespace std;
#define all(x) x.begin(),x.end()
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][j-1]+(double)v[j].first/(t+1));
            }
            for(int j=1;j<=n;j++){
                dp[i][j]=min(dp[i][j],dp[i-1][j-1]+(double)v[j].second/i);
            }
        }
        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:45: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 'int' [-Wsign-compare]
   45 |             while(pq.size()>n-k){
      |                   ~~~~~~~~~^~~~

Subtask #1
5.0 / 5.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	5 ms	540 KB	Output is correct
6	Correct	29 ms	800 KB	Output is correct
7	Correct	120 ms	1508 KB	Output is correct
8	Correct	282 ms	2028 KB	Output is correct
9	Correct	466 ms	2340 KB	Output is correct
10	Correct	233 ms	1676 KB	Output is correct

Subtask #2
5.0 / 5.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	5 ms	540 KB	Output is correct
6	Correct	29 ms	800 KB	Output is correct
7	Correct	120 ms	1508 KB	Output is correct
8	Correct	282 ms	2028 KB	Output is correct
9	Correct	466 ms	2340 KB	Output is correct
10	Correct	233 ms	1676 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	43 ms	916 KB	Output is correct
13	Correct	42 ms	920 KB	Output is correct
14	Correct	42 ms	916 KB	Output is correct
15	Correct	244 ms	1764 KB	Output is correct
16	Correct	237 ms	1704 KB	Output is correct
17	Correct	231 ms	1692 KB	Output is correct
18	Correct	490 ms	2392 KB	Output is correct
19	Correct	486 ms	2532 KB	Output is correct
20	Correct	469 ms	2336 KB	Output is correct

Subtask #3
0 / 11.0

#	결과	메모리	Grader output
1	Correct	212 KB	Output is correct
2	Correct	212 KB	Output is correct
3	Correct	212 KB	Output is correct
4	Correct	212 KB	Output is correct
5	Correct	212 KB	Output is correct
6	Correct	212 KB	Output is correct
7	Correct	212 KB	Output is correct
8	Correct	212 KB	Output is correct
9	Correct	212 KB	Output is correct
10	Incorrect	212 KB	Output isn't correct
11	Halted	0 KB	-

Subtask #4
0 / 12.0

#	결과	메모리	Grader output
1	Correct	212 KB	Output is correct
2	Correct	212 KB	Output is correct
3	Correct	212 KB	Output is correct
4	Correct	212 KB	Output is correct
5	Correct	212 KB	Output is correct
6	Correct	212 KB	Output is correct
7	Correct	212 KB	Output is correct
8	Correct	212 KB	Output is correct
9	Correct	212 KB	Output is correct
10	Incorrect	212 KB	Output isn't correct
11	Halted	0 KB	-

Subtask #5
0 / 33.0

#	결과	메모리	Grader output
1	Correct	212 KB	Output is correct
2	Correct	212 KB	Output is correct
3	Correct	212 KB	Output is correct
4	Correct	212 KB	Output is correct
5	Correct	212 KB	Output is correct
6	Correct	212 KB	Output is correct
7	Correct	212 KB	Output is correct
8	Correct	212 KB	Output is correct
9	Correct	212 KB	Output is correct
10	Incorrect	212 KB	Output isn't correct
11	Halted	0 KB	-

Subtask #6
0 / 11.0

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

Subtask #7
0 / 23.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	5 ms	540 KB	Output is correct
6	Correct	29 ms	800 KB	Output is correct
7	Correct	120 ms	1508 KB	Output is correct
8	Correct	282 ms	2028 KB	Output is correct
9	Correct	466 ms	2340 KB	Output is correct
10	Correct	233 ms	1676 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	43 ms	916 KB	Output is correct
13	Correct	42 ms	920 KB	Output is correct
14	Correct	42 ms	916 KB	Output is correct
15	Correct	244 ms	1764 KB	Output is correct
16	Correct	237 ms	1704 KB	Output is correct
17	Correct	231 ms	1692 KB	Output is correct
18	Correct	490 ms	2392 KB	Output is correct
19	Correct	486 ms	2532 KB	Output is correct
20	Correct	469 ms	2336 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	0 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	0 ms	212 KB	Output is correct
30	Incorrect	0 ms	212 KB	Output isn't correct
31	Halted	0 ms	0 KB	-

답안 #658846

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 5.0 / 5.0

Subtask #3 0 / 11.0

Subtask #4 0 / 12.0

Subtask #5 0 / 33.0

Subtask #6 0 / 11.0

Subtask #7 0 / 23.0

Subtask #1
5.0 / 5.0

Subtask #2
5.0 / 5.0

Subtask #3
0 / 11.0

Subtask #4
0 / 12.0

Subtask #5
0 / 33.0

Subtask #6
0 / 11.0

Subtask #7
0 / 23.0