oj.uz

Submission #824502

# Submission time Handle Problem Language Result Execution time Memory
824502 2023-08-14T07:06:12 Z peteza Let's Win the Election (JOI22_ho_t3) C++14
10 / 100
 329 ms 320 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 i=0;i<vec.size();i++) {
        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);
    }
    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 i=0;i<vec.size();i++) {
      |                 ~^~~~~~~~~~~
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++) {
      |                        ~~~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 7 ms 212 KB Output is correct
6 Correct 6 ms 212 KB Output is correct
7 Correct 7 ms 212 KB Output is correct
8 Correct 7 ms 320 KB Output is correct
9 Correct 7 ms 320 KB Output is correct
10 Correct 8 ms 320 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 7 ms 212 KB Output is correct
6 Correct 6 ms 212 KB Output is correct
7 Correct 7 ms 212 KB Output is correct
8 Correct 7 ms 320 KB Output is correct
9 Correct 7 ms 320 KB Output is correct
10 Correct 8 ms 320 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 126 ms 300 KB Output is correct
13 Correct 58 ms 300 KB Output is correct
14 Correct 20 ms 212 KB Output is correct
15 Correct 202 ms 300 KB Output is correct
16 Correct 142 ms 304 KB Output is correct
17 Correct 37 ms 296 KB Output is correct
18 Correct 274 ms 212 KB Output is correct
19 Correct 154 ms 300 KB Output is correct
20 Correct 47 ms 300 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 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

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 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

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 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

# Verdict Execution time Memory Grader output
1 Incorrect 329 ms 304 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 7 ms 212 KB Output is correct
6 Correct 6 ms 212 KB Output is correct
7 Correct 7 ms 212 KB Output is correct
8 Correct 7 ms 320 KB Output is correct
9 Correct 7 ms 320 KB Output is correct
10 Correct 8 ms 320 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 126 ms 300 KB Output is correct
13 Correct 58 ms 300 KB Output is correct
14 Correct 20 ms 212 KB Output is correct
15 Correct 202 ms 300 KB Output is correct
16 Correct 142 ms 304 KB Output is correct
17 Correct 37 ms 296 KB Output is correct
18 Correct 274 ms 212 KB Output is correct
19 Correct 154 ms 300 KB Output is correct
20 Correct 47 ms 300 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Incorrect 0 ms 212 KB Output isn't correct
30 Halted 0 ms 0 KB -