Submission #703404

# Submission time Handle Problem Language Result Execution time Memory
703404 2023-02-27T09:07:57 Z niter Let's Win the Election (JOI22_ho_t3) C++14
10 / 100
29 ms 340 KB
#include <bits/stdc++.h>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define pii pair<int,int>
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define STL(i, x) for(auto &i:x) cout << i << " "; cout << "\n";
#define iNf 2147483647
using namespace std;

ostream& operator<<(ostream &os, pii XXX){
    cout << "[" << XXX.ff << ", " << XXX.ss << "]";
}
void db(){
    cout << "\n";
}
template<class T, class ...U>
void db(T XXX, U ...YYY){
    cout << XXX;  db(YYY...);
}

bool cmp_ff(pii XXX, pii YYY){
    return (XXX.ff != YYY.ff) ? (XXX.ff < YYY.ff) : (XXX.ss < YYY.ss);
}
bool cmp_ss(pii XXX, pii YYY){
    return (XXX.ss != YYY.ss) ? (XXX.ss < YYY.ss) : (XXX.ff < YYY.ff);
}

int main(){
    int n, k;
    cin >> n >> k;
    int a[505], b[505];
    vector<pii> org(n), dp;
    loop(i,0,n){
        cin >> a[i] >> b[i];
        if(b[i] == -1)
            b[i] = iNf;
        org[i] = mp(a[i], b[i]);
    }
    long double ans = (1e300), tmp_ans;
    int tmp_get, tmp_now;
    loop(i,0,k+1){
        dp = org;
        tmp_ans = 0;
        tmp_get = 0;
        tmp_now = 1;
        sort(dp.begin(), dp.end(), cmp_ss);
        loop(j,0,i){
            if(dp[j].ss == iNf) break;
            tmp_ans += (long double)dp[j].ss / tmp_now;
            dp[j].ff = iNf;
            tmp_get++;
            tmp_now++;
        }
        sort(dp.begin(), dp.end(), cmp_ff);
        loop(j,0,n){
            tmp_ans += (long double)dp[j].ff / tmp_now;
            tmp_get++;
            if(tmp_get == k){
                ans = min(ans, tmp_ans);
                break;
            }
        }
    }
    cout << fixed << setprecision(10) << ans << "\n";
    return 0;
}
/*
3
3
1 5
2 3
4 5
*/

Compilation message

Main.cpp: In function 'std::ostream& operator<<(std::ostream&, std::pair<int, int>)':
Main.cpp:14:1: warning: no return statement in function returning non-void [-Wreturn-type]
   14 | }
      | ^
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 3 ms 212 KB Output is correct
6 Correct 6 ms 300 KB Output is correct
7 Correct 11 ms 300 KB Output is correct
8 Correct 18 ms 212 KB Output is correct
9 Correct 25 ms 212 KB Output is correct
10 Correct 13 ms 308 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 3 ms 212 KB Output is correct
6 Correct 6 ms 300 KB Output is correct
7 Correct 11 ms 300 KB Output is correct
8 Correct 18 ms 212 KB Output is correct
9 Correct 25 ms 212 KB Output is correct
10 Correct 13 ms 308 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 8 ms 212 KB Output is correct
13 Correct 9 ms 312 KB Output is correct
14 Correct 8 ms 304 KB Output is correct
15 Correct 17 ms 212 KB Output is correct
16 Correct 18 ms 308 KB Output is correct
17 Correct 17 ms 212 KB Output is correct
18 Correct 26 ms 212 KB Output is correct
19 Correct 25 ms 300 KB Output is correct
20 Correct 24 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 288 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 340 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 Incorrect 0 ms 212 KB Output isn't correct
10 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 288 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 340 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 Incorrect 0 ms 212 KB Output isn't correct
10 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 288 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 340 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 Incorrect 0 ms 212 KB Output isn't correct
10 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 29 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 3 ms 212 KB Output is correct
6 Correct 6 ms 300 KB Output is correct
7 Correct 11 ms 300 KB Output is correct
8 Correct 18 ms 212 KB Output is correct
9 Correct 25 ms 212 KB Output is correct
10 Correct 13 ms 308 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 8 ms 212 KB Output is correct
13 Correct 9 ms 312 KB Output is correct
14 Correct 8 ms 304 KB Output is correct
15 Correct 17 ms 212 KB Output is correct
16 Correct 18 ms 308 KB Output is correct
17 Correct 17 ms 212 KB Output is correct
18 Correct 26 ms 212 KB Output is correct
19 Correct 25 ms 300 KB Output is correct
20 Correct 24 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 288 KB Output is correct
23 Correct 1 ms 300 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Incorrect 0 ms 212 KB Output isn't correct
30 Halted 0 ms 0 KB -