oj.uz

답안 #991741

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
991741 2024-06-03T04:25:23 Z Otalp Let's Win the Election (JOI22_ho_t3) C++14
10 / 100
 14 ms 2648 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define pii pair<int, int>
#define ff first
#define ss second
#define ld long double
#define pb push_back

pair<ld, ld> a[300100];
ll b[300100];
ll n, m;


bool cmp(int x, int y){
    return a[x].ss < a[y].ss;
}

void solve(){
    cin>>n>>m;
    int cnt = 0;
    vector<int> q;
    for(int i=1; i<=n; i++){
        cin>>a[i].ff>>a[i].ss;
        if(a[i].ss == -1) a[i].ss = 1e9;
        else cnt ++; 
    }
    sort(a + 1, a + 1 + n);
    for(int i=1; i<=n; i++){
        if(a[i].ss != -1) q.pb(i);
    }
    sort(q.begin(), q.end(), cmp);
    ld ans = 1e18;
    for(int d=0; d<=cnt; d++){
        ld res = 0;
        map<int, int> us;
        for(int i=0; i<d; i++){
            us[q[i]] = 1;
            res += a[q[i]].ss / (i + 1);
        }
        for(int i=1; us.size() < m; i++){
            if(!us[i]) res += a[i].ff / (d + 1), us[i] = 1;
        }
        //cout<<"##############\n";
        //cout<<d<<' '<<res<<'\n';
        //for(int i=0; i<d; i++){
            //cout<<q[i]<<'\n';
            //cout<<a[q[i]].ff<<' '<<a[q[i]].ss<<'\n';
        //}
        ans = min(ans, res);
    }
    cout<<fixed<<setprecision(9)<<ans<<'\n';
}


signed main(){
    solve();
}

Compilation message

Main.cpp: In function 'void solve()':
Main.cpp:42:32: warning: comparison of integer expressions of different signedness: 'std::map<long long int, long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   42 |         for(int i=1; us.size() < m; i++){
      |                      ~~~~~~~~~~^~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 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 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 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 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 6 ms 2408 KB Output is correct
13 Correct 4 ms 2396 KB Output is correct
14 Correct 2 ms 2396 KB Output is correct
15 Correct 10 ms 2396 KB Output is correct
16 Correct 6 ms 2396 KB Output is correct
17 Correct 3 ms 2396 KB Output is correct
18 Correct 14 ms 2396 KB Output is correct
19 Correct 9 ms 2396 KB Output is correct
20 Correct 4 ms 2396 KB Output is correct

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2392 KB Output is correct
7 Correct 1 ms 2648 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Incorrect 0 ms 2396 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2392 KB Output is correct
7 Correct 1 ms 2648 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Incorrect 0 ms 2396 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2392 KB Output is correct
7 Correct 1 ms 2648 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Incorrect 0 ms 2396 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

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

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 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 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 6 ms 2408 KB Output is correct
13 Correct 4 ms 2396 KB Output is correct
14 Correct 2 ms 2396 KB Output is correct
15 Correct 10 ms 2396 KB Output is correct
16 Correct 6 ms 2396 KB Output is correct
17 Correct 3 ms 2396 KB Output is correct
18 Correct 14 ms 2396 KB Output is correct
19 Correct 9 ms 2396 KB Output is correct
20 Correct 4 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 0 ms 2396 KB Output is correct
23 Correct 0 ms 2396 KB Output is correct
24 Correct 0 ms 2396 KB Output is correct
25 Correct 0 ms 2396 KB Output is correct
26 Correct 0 ms 2392 KB Output is correct
27 Correct 1 ms 2648 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Incorrect 0 ms 2396 KB Output isn't correct
30 Halted 0 ms 0 KB -