oj.uz

답안 #824505

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
824505 2023-08-14T07:09:19 Z peteza Let's Win the Election (JOI22_ho_t3) C++14
0 / 100
 62 ms 212 KB 
#include <bits/stdc++.h>
using namespace std;
 
bool vis[505];
int n, k;
int as, bs;
vector<pair<int, int>> a, b;
 
int todo=0,ptr=0;
long double cans=1e18, ans = 1e18, csum = 0;
vector<int> vec;
int av[1005], bv[1005];

int main() {
    cin >> n >> k;
    for(int i=0;i<n;i++) {
        cin >> as >> bs; av[i] = as; bv[i] = bs;
        a.emplace_back(as, i);
        b.emplace_back(bs==-1 ? INT_MAX :bs, i);
        vec.push_back(i);
    }
    sort(vec.begin(), vec.end(), [&](int i, int j){
        if(bv[i] == -1) return (bool)0;
        if(bv[j] == -1) return (bool)1;
        if(bv[i]-av[i] == bv[j]-av[j]) return av[i] > av[j];
        return bv[j]-av[i] > bv[j]-av[j];
    });
    //blablbalbllba
    for(int k=0;k<vec.size();k++) {
        ans = 1e18; csum = 0;
        sort(a.begin(), a.end()); sort(b.begin(), b.end());
        for(int selb=0;selb<=b.size();selb++) {
            vector<bool> vis(n, 0);
            todo = k; csum = 0; ptr = 0;
            bool broke = 0;
            for(int i=0;i<selb;i++) {
                if(b[i].first == INT_MAX) broke = 1;
                vis[b[i].second] = 1;
                csum += 1.00*b[i].first/(i+1); todo--;
            }
            if(broke) break;
            while(ptr<n&&todo > 0){
                if(vis[a[ptr].second]){ptr++; continue;}
                csum += 1.00*a[ptr].first/(selb+1);
                todo--; ptr++;
            }
            if(todo<=0) ans = min(ans, csum);
        }
        cans = min(cans, ans);
        for(int j=0;j<b.size();j++) if(b[j].second == vec[k]) b[j].first = INT_MAX;
        if(bv[vec[k]] == -1) break;
    }
    cout << cans;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:29:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |     for(int k=0;k<vec.size();k++) {
      |                 ~^~~~~~~~~~~
Main.cpp:32:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |         for(int selb=0;selb<=b.size();selb++) {
      |                        ~~~~^~~~~~~~~~
Main.cpp:50:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |         for(int j=0;j<b.size();j++) if(b[j].second == vec[k]) b[j].first = INT_MAX;
      |                     ~^~~~~~~~~

Subtask #1
0 / 5.0

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

Subtask #2
0 / 5.0

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

Subtask #3
0 / 11.0

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

Subtask #4
0 / 12.0

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

Subtask #5
0 / 33.0

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

Subtask #6
0 / 11.0

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

Subtask #7
0 / 23.0

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