Submission #537783

#	Time	Username	Problem	Language	Result	Execution time	Memory
537783		kym	Let's Win the Election (JOI22_ho_t3)	C++14	100 / 100	255 ms	2368 KiB

Main

#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 = (int)1e9 + 500;
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,k;
pi A[MAXN];
double dp[MAXN][MAXN]; // dp[index][no. of votes]
int32_t main() 
{
	IAMSPEED
	cin >> n >> k;
	FOR(i,1,n) cin >> A[i].f >> A[i].s;
	int cc = 0;
	FOR(i,1,n) {
		if(A[i].s == -1) A[i].s = oo;
		else ++cc;
	}
	sort(A+1,A+n+1,[](pi a, pi b) {
		return a.s < b.s;
	});
	FOR(i,1,n) {
		db2(A[i].f, A[i].s);
	}
	double ans = oo;
	FOR(m,0,min(cc,k)) { //number of extra collaborators. no empties until i get m collaborators.
		FOR(i,0,n) {
			FOR(j,0,n) dp[i][j] = oo;
		}
		dp[0][0] = 0;
		FOR(i,1,n) {
			FOR(j,0,k-m) { // number pure votes
				int f = i - j;
				if(j)chmin(dp[i][j], dp[i-1][j-1] + (double)A[i].f / (double)(m+1));
				if(f>=0 && f<=m)chmin(dp[i][j], dp[i-1][j] + (double)A[i].s / (double)(f));
				else chmin(dp[i][j], dp[i-1][j]);
			}
		}
		db3(n,m,dp[n][k-m]);
		chmin(ans, dp[n][k-m]);
		reach
	}
	cout << fixed << setprecision(10);
	cout << ans;
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 11 / 11
• Subtask 4: 12 / 12
• Subtask 5: 33 / 33
• Subtask 6: 11 / 11
• Subtask 7: 23 / 23