oj.uz

Submission #536752

# Submission time Handle Problem Language Result Execution time Memory
536752 2022-03-14T01:30:17 Z kym Let's Win the Election (JOI22_ho_t3) C++14
10 / 100
 743 ms 1008552 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 = 500005;
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];
double dp[MAXN][MAXN][MAXN]; //dp[index][votes][collaborators]
int32_t main() 
{
	IAMSPEED
	cin >> n >> m;
	FOR(i,1,n) {
		cin >> A[i].f >> A[i].s;
		if(A[i].s==-1)A[i].s=inf;
	}
	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)FOR(k,0,MAXN-1)dp[i][j][k]=inf;
	dp[0][0][1] = 0;
	FOR(i,1,n) {
		FOR(j,0,m) {
			FOR(k,1,i+1) {
				chmin(dp[i][j][k],dp[i-1][j][k]); // ignore
				if(j>0)chmin(dp[i][j][k],dp[i-1][j-1][k] + (double)(A[i].f)/(double)(k)); //only get votes
				if(A[i].s!=inf && k>1)chmin(dp[i][j][k],dp[i-1][j-1][k-1] + (double)(A[i].s)/(double)(k-1));//get collaborator
			}
		}
	}
	cout << fixed << setprecision(20);
	double ans = inf;
	FOR(i,1,n+1) {
		chmin(ans, dp[n][m][i]);
	}
	cout << ans;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 462 ms 1008328 KB Output is correct
2 Correct 435 ms 1008376 KB Output is correct
3 Correct 484 ms 1008328 KB Output is correct
4 Correct 438 ms 1008400 KB Output is correct
5 Correct 437 ms 1008384 KB Output is correct
6 Correct 473 ms 1008472 KB Output is correct
7 Correct 542 ms 1008368 KB Output is correct
8 Correct 556 ms 1008432 KB Output is correct
9 Correct 595 ms 1008436 KB Output is correct
10 Correct 555 ms 1008552 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 462 ms 1008328 KB Output is correct
2 Correct 435 ms 1008376 KB Output is correct
3 Correct 484 ms 1008328 KB Output is correct
4 Correct 438 ms 1008400 KB Output is correct
5 Correct 437 ms 1008384 KB Output is correct
6 Correct 473 ms 1008472 KB Output is correct
7 Correct 542 ms 1008368 KB Output is correct
8 Correct 556 ms 1008432 KB Output is correct
9 Correct 595 ms 1008436 KB Output is correct
10 Correct 555 ms 1008552 KB Output is correct
11 Correct 438 ms 1008328 KB Output is correct
12 Correct 520 ms 1008400 KB Output is correct
13 Correct 492 ms 1008316 KB Output is correct
14 Correct 477 ms 1008460 KB Output is correct
15 Correct 614 ms 1008440 KB Output is correct
16 Correct 563 ms 1008468 KB Output is correct
17 Correct 540 ms 1008448 KB Output is correct
18 Correct 684 ms 1008372 KB Output is correct
19 Correct 645 ms 1008436 KB Output is correct
20 Correct 580 ms 1008440 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 429 ms 1008348 KB Output is correct
2 Correct 431 ms 1008408 KB Output is correct
3 Correct 437 ms 1008416 KB Output is correct
4 Correct 438 ms 1008400 KB Output is correct
5 Correct 438 ms 1008340 KB Output is correct
6 Correct 433 ms 1008332 KB Output is correct
7 Correct 432 ms 1008356 KB Output is correct
8 Correct 430 ms 1008420 KB Output is correct
9 Incorrect 433 ms 1008332 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 429 ms 1008348 KB Output is correct
2 Correct 431 ms 1008408 KB Output is correct
3 Correct 437 ms 1008416 KB Output is correct
4 Correct 438 ms 1008400 KB Output is correct
5 Correct 438 ms 1008340 KB Output is correct
6 Correct 433 ms 1008332 KB Output is correct
7 Correct 432 ms 1008356 KB Output is correct
8 Correct 430 ms 1008420 KB Output is correct
9 Incorrect 433 ms 1008332 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 429 ms 1008348 KB Output is correct
2 Correct 431 ms 1008408 KB Output is correct
3 Correct 437 ms 1008416 KB Output is correct
4 Correct 438 ms 1008400 KB Output is correct
5 Correct 438 ms 1008340 KB Output is correct
6 Correct 433 ms 1008332 KB Output is correct
7 Correct 432 ms 1008356 KB Output is correct
8 Correct 430 ms 1008420 KB Output is correct
9 Incorrect 433 ms 1008332 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

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

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 462 ms 1008328 KB Output is correct
2 Correct 435 ms 1008376 KB Output is correct
3 Correct 484 ms 1008328 KB Output is correct
4 Correct 438 ms 1008400 KB Output is correct
5 Correct 437 ms 1008384 KB Output is correct
6 Correct 473 ms 1008472 KB Output is correct
7 Correct 542 ms 1008368 KB Output is correct
8 Correct 556 ms 1008432 KB Output is correct
9 Correct 595 ms 1008436 KB Output is correct
10 Correct 555 ms 1008552 KB Output is correct
11 Correct 438 ms 1008328 KB Output is correct
12 Correct 520 ms 1008400 KB Output is correct
13 Correct 492 ms 1008316 KB Output is correct
14 Correct 477 ms 1008460 KB Output is correct
15 Correct 614 ms 1008440 KB Output is correct
16 Correct 563 ms 1008468 KB Output is correct
17 Correct 540 ms 1008448 KB Output is correct
18 Correct 684 ms 1008372 KB Output is correct
19 Correct 645 ms 1008436 KB Output is correct
20 Correct 580 ms 1008440 KB Output is correct
21 Correct 429 ms 1008348 KB Output is correct
22 Correct 431 ms 1008408 KB Output is correct
23 Correct 437 ms 1008416 KB Output is correct
24 Correct 438 ms 1008400 KB Output is correct
25 Correct 438 ms 1008340 KB Output is correct
26 Correct 433 ms 1008332 KB Output is correct
27 Correct 432 ms 1008356 KB Output is correct
28 Correct 430 ms 1008420 KB Output is correct
29 Incorrect 433 ms 1008332 KB Output isn't correct
30 Halted 0 ms 0 KB -