oj.uz

답안 #991637

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
991637 2024-06-02T17:25:16 Z Otalp Let's Win the Election (JOI22_ho_t3) C++14
5 / 100
 2500 ms 4792 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;
ll us[200100];


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 ++, q.pb(i);
    }
    sort(a + 1, a + 1 + n);
    ld ans = 1e18;
    for(int k=0; k<(1 << n); k++){
        ld res = 0;
        vector<int> q;
        for(int i=0; i<n; i++){
            us[i + 1] = 0;
            if((k & (1 << i))){
                q.pb(i + 1);
                if(a[i + 1].ss == 1e9) res = -1;
            }
        }
        if(res == -1) continue;
        sort(q.begin(), q.end());
        for(int i=0; i<q.size(); i++){
            us[q[i]] = 1;
            res += a[q[i]].ss / (i + 1);
        }
        int cnt = q.size();
        for(int i=1; i<=n; i++){
            if(cnt >= m) break;
            if(us[i]) continue;
            us[i] = 1;
            res += a[i].ff / (q.size() + 1);
            cnt ++;
        }
        ans = min(ans, res);
    }
    cout<<fixed<<setprecision(9)<<ans<<'\n';
}


signed main(){
    solve();
}

Compilation message

Main.cpp: In function 'void solve()':
Main.cpp:44:23: 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]
   44 |         for(int i=0; i<q.size(); i++){
      |                      ~^~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1681 ms 4696 KB Output is correct
6 Correct 1706 ms 4440 KB Output is correct
7 Correct 1743 ms 4540 KB Output is correct
8 Correct 1692 ms 4792 KB Output is correct
9 Correct 1646 ms 4440 KB Output is correct
10 Correct 1715 ms 4544 KB Output is correct

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1681 ms 4696 KB Output is correct
6 Correct 1706 ms 4440 KB Output is correct
7 Correct 1743 ms 4540 KB Output is correct
8 Correct 1692 ms 4792 KB Output is correct
9 Correct 1646 ms 4440 KB Output is correct
10 Correct 1715 ms 4544 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Execution timed out 2585 ms 4444 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

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

Subtask #4
0 / 12.0

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

Subtask #5
0 / 33.0

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

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2517 ms 4440 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1681 ms 4696 KB Output is correct
6 Correct 1706 ms 4440 KB Output is correct
7 Correct 1743 ms 4540 KB Output is correct
8 Correct 1692 ms 4792 KB Output is correct
9 Correct 1646 ms 4440 KB Output is correct
10 Correct 1715 ms 4544 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Execution timed out 2585 ms 4444 KB Time limit exceeded
13 Halted 0 ms 0 KB -