oj.uz

답안 #824345

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
824345 2023-08-14T03:38:57 Z peteza Let's Win the Election (JOI22_ho_t3) C++14
0 / 100
 1 ms 468 KB 
#include <bits/stdc++.h>
using namespace std;

int n, k, bbs=0;
int a[505], b[505];
vector<int> sA, sB;
bool vis[505];

int main() {
    cin.tie(0) -> sync_with_stdio(0);
    cin >> n >> k;
    for(int i=0;i<n;i++) {
        cin >> a[i] >> b[i];
        sA.emplace_back(i); 
        if(b[i] != -1) sB.emplace_back(i);
        bbs += (b[i] != -1);
    }
    sort(sA.begin(), sA.end(), [&](int i, int j){
        return a[i] <= a[j];
    });
    sort(sB.begin(), sB.end(), [&](int i, int j){
        
        return b[i] <= b[j];
    });
    long double ans, cans = 1e18;
    for(int bs=0;bs<=min(bbs, k);bs++) {
        memset(vis, 0, sizeof vis);
        int cnt = 0;
        ans = 0;
        for(int i=0;i<bs;i++) {
            cnt++;
            vis[sB[i]] = 1;
            ans += 1.00*b[sB[i]]/(i+1);
        }
        for(int i=0;cnt!=k;i++) {
            if(vis[sA[i]]) continue;
            cnt++;
            ans += 1.00*a[sA[i]]/(bs+1);
        }
        cans = min(cans, ans);
    }
    cout << fixed << setprecision(10) << cans;
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Runtime error 1 ms 468 KB Execution killed with signal 11
11 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Runtime error 1 ms 468 KB Execution killed with signal 11
11 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

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

Subtask #4
0 / 12.0

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

Subtask #5
0 / 33.0

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

Subtask #6
0 / 11.0

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

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Runtime error 1 ms 468 KB Execution killed with signal 11
11 Halted 0 ms 0 KB -