oj.uz

답안 #890525

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
890525 2023-12-21T11:59:23 Z irmuun Let's Win the Election (JOI22_ho_t3) C++17
11 / 100
 1 ms 460 KB 
#include<bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    ll n,k;
    cin>>n>>k;
    ll a[n+5],b[n+5],tot=1;
    for(ll i=1;i<=n;i++){
        cin>>a[i]>>b[i];
        if(n<=7){
            tot=tot*3;
        }
    }
    vector<ll>v1,v2;
    if(n<=7){
        double ans=1e18;
        for(ll p=0;p<tot;p++){
            ll c=p;
            v1.clear();
            v2.clear();
            for(ll i=1;i<=n;i++){
                if(c%3==1){
                    v1.pb(a[i]);
                }
                if(c%3==2){
                    if(b[i]>-1){
                        v2.pb(b[i]);
                    }
                }
                c/=3;
            }
            sort(all(v1));
            sort(all(v2));
            double cur=0;
            for(ll i=0;i<=min((ll)v2.size(),k);i++){
                if(i+v1.size()>=k){
                    double T=0;
                    for(ll j=0;j<k-i;j++){
                        T+=v1[j];
                    }
                    ans=min(ans,cur+(double)T/(i+1));
                }
                if(i<v2.size()){
                    cur+=(double)v2[i]/(i+1);
                }
            }
        }
        printf("%.10f",ans);
        return 0;
    }
    sort(all(v1));
    sort(all(v2));
    double ans=1e18;
    double cur=0;
    for(ll i=0;i<=min((ll)v2.size(),k);i++){
        if(i+v1.size()>=k){
            double T=0;
            for(ll j=0;j<k-i;j++){
                T+=v1[j];
            }
            ans=min(ans,cur+(double)T/(i+1));
        }
        if(i<v2.size()){
            cur+=(double)v2[i]/(i+1);
        }
    }
    printf("%.10f",ans);
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:45:31: warning: comparison of integer expressions of different signedness: 'long long unsigned int' and 'long long int' [-Wsign-compare]
   45 |                 if(i+v1.size()>=k){
      |                    ~~~~~~~~~~~^~~
Main.cpp:52:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |                 if(i<v2.size()){
      |                    ~^~~~~~~~~~
Main.cpp:65:23: warning: comparison of integer expressions of different signedness: 'long long unsigned int' and 'long long int' [-Wsign-compare]
   65 |         if(i+v1.size()>=k){
      |            ~~~~~~~~~~~^~~
Main.cpp:72:13: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |         if(i<v2.size()){
      |            ~^~~~~~~~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 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 0 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 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 0 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Incorrect 0 ms 348 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Incorrect 0 ms 348 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

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

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 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 0 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -