| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 536764 |
2022-03-14T02:26:19 Z |
kym |
Self Study (JOI22_ho_t2) |
C++14 |
|
10 ms |
4308 KB |
#include <bits/stdc++.h>
using namespace std;
#define int ll
#define FOR(i,s,e) for(ll i = s; i <= (ll)e; ++i)
#define DEC(i,s,e) for(ll i = s; i >= (ll)e; --i)
#define IAMSPEED ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef LOCAL
#define db(x) cerr << #x << "=" << x << "\n"
#define db2(x, y) cerr << #x << "=" << x << " , " << #y << "=" << y << "\n"
#define db3(a,b,c) cerr<<#a<<"="<<a<<","<<#b<<"="<<b<<","<<#c<<"="<<c<<"\n"
#define dbv(v) cerr << #v << ":"; for (auto ite : v) cerr << ite << ' '; cerr <<"\n"
#define dbvp(v) cerr << #v << ":"; for (auto ite : v) cerr << "{" << ite.f << ',' << ite.s << "} "; cerr << "\n"
#define dba(a,ss,ee) cerr << #a << ":"; FOR(ite,ss,ee) cerr << a[ite] << ' '; cerr << "\n"
#define reach cerr << "LINE: " << __LINE__ << "\n";
#else
#define db(x)
#define db2(x,y)
#define db3(a,b,c)
#define dbv(v)
#define dbvp(v)
#define dba(a,ss,ee)
#define reach
#endif
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define ll long long
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define f first
#define s second
#define g0(x) get<0>(x)
#define g1(x) get<1>(x)
#define g2(x) get<2>(x)
#define g3(x) get<3>(x)
typedef pair <ll, ll> pi;
typedef tuple<ll,ll,ll> ti3;
typedef tuple<ll,ll,ll,ll> ti4;
ll rand(ll a, ll b) { return a + rng() % (b-a+1); }
const int MOD = 1e9 + 7;
const int inf = 1e9;
const long long oo = (ll)1e18 + 500;
template <typename T> void chmax(T& a, const T b) { a=max(a,b); }
template <typename T> void chmin(T& a, const T b) { a=min(a,b); }
const int MAXN = 505;
int n,m;
pi A[MAXN];
#define double long double
double dp[MAXN][MAXN]; //dp[index][votes]
int32_t main()
{
IAMSPEED
cin >> n >> m;
int cc=0;
FOR(i,1,n) {
cin >> A[i].f >> A[i].s;
if(A[i].s==-1)A[i].s=inf;
else ++cc;
}
sort(A+1,A+n+1,[](pi a, pi b) {
return a.s < b.s;
});
FOR(i,0,MAXN-1)FOR(j,0,MAXN-1)dp[i][j]=inf;
double ans = inf;
FOR(k,1,min(m+1,cc+1)) { //number of collaborators inc. first guy
FOR(i,0,MAXN-1)FOR(j,0,MAXN-1)dp[i][j]=inf;
dp[0][0] = 0;
FOR(i,1,n) { //index
FOR(j,0,i) {//number of votes
chmin(dp[i][j],dp[i-1][j]); //ignore
if(j>k-1) { //just vote
if(j>0)chmin(dp[i][j], dp[i-1][j-1] + (double)A[i].f/(double)k);
} else {
if(j>0 && k>1)chmin(dp[i][j], dp[i-1][j-1] + (double)A[i].s/(double)(j));
}
}
}
db(dp[n][m]);
chmin(ans, dp[n][m]);
}
cout << fixed << setprecision(10) << ans;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
7 ms |
4308 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
10 ms |
4308 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
7 ms |
4308 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
10 ms |
4308 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
7 ms |
4308 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
