# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
703403 | 2023-02-27T09:06:23 Z | niter | Let's Win the Election (JOI22_ho_t3) | C++14 | 33 ms | 300 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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Incorrect | 1 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Incorrect | 1 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Incorrect | 1 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Incorrect | 1 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Incorrect | 1 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 33 ms | 300 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Incorrect | 1 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |