oj.uz

Submission #536758

# Submission time Handle Problem Language Result Execution time Memory
536758 2022-03-14T02:14:27 Z kym Let's Win the Election (JOI22_ho_t3) C++14
10 / 100
 727 ms 1008636 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]=double(inf);
	dp[0][0][1] = 0L;
	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 && j>0)chmin(dp[i][j][k],dp[i-1][j-1][k-1] + (double)(A[i].s)/(double)(k-1));//get collaborator
			}
		}
	}
	cout << fixed << setprecision(10);
	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 458 ms 1008332 KB Output is correct
2 Correct 458 ms 1008436 KB Output is correct
3 Correct 434 ms 1008316 KB Output is correct
4 Correct 453 ms 1008380 KB Output is correct
5 Correct 508 ms 1008352 KB Output is correct
6 Correct 509 ms 1008432 KB Output is correct
7 Correct 527 ms 1008520 KB Output is correct
8 Correct 566 ms 1008432 KB Output is correct
9 Correct 603 ms 1008556 KB Output is correct
10 Correct 566 ms 1008528 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 458 ms 1008332 KB Output is correct
2 Correct 458 ms 1008436 KB Output is correct
3 Correct 434 ms 1008316 KB Output is correct
4 Correct 453 ms 1008380 KB Output is correct
5 Correct 508 ms 1008352 KB Output is correct
6 Correct 509 ms 1008432 KB Output is correct
7 Correct 527 ms 1008520 KB Output is correct
8 Correct 566 ms 1008432 KB Output is correct
9 Correct 603 ms 1008556 KB Output is correct
10 Correct 566 ms 1008528 KB Output is correct
11 Correct 467 ms 1008328 KB Output is correct
12 Correct 517 ms 1008412 KB Output is correct
13 Correct 541 ms 1008392 KB Output is correct
14 Correct 486 ms 1008416 KB Output is correct
15 Correct 621 ms 1008408 KB Output is correct
16 Correct 570 ms 1008476 KB Output is correct
17 Correct 558 ms 1008432 KB Output is correct
18 Correct 727 ms 1008444 KB Output is correct
19 Correct 634 ms 1008636 KB Output is correct
20 Correct 684 ms 1008516 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 444 ms 1008316 KB Output is correct
2 Correct 429 ms 1008332 KB Output is correct
3 Correct 441 ms 1008332 KB Output is correct
4 Correct 445 ms 1008300 KB Output is correct
5 Correct 438 ms 1008428 KB Output is correct
6 Correct 434 ms 1008476 KB Output is correct
7 Correct 452 ms 1008332 KB Output is correct
8 Correct 442 ms 1008412 KB Output is correct
9 Incorrect 448 ms 1008344 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 444 ms 1008316 KB Output is correct
2 Correct 429 ms 1008332 KB Output is correct
3 Correct 441 ms 1008332 KB Output is correct
4 Correct 445 ms 1008300 KB Output is correct
5 Correct 438 ms 1008428 KB Output is correct
6 Correct 434 ms 1008476 KB Output is correct
7 Correct 452 ms 1008332 KB Output is correct
8 Correct 442 ms 1008412 KB Output is correct
9 Incorrect 448 ms 1008344 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 444 ms 1008316 KB Output is correct
2 Correct 429 ms 1008332 KB Output is correct
3 Correct 441 ms 1008332 KB Output is correct
4 Correct 445 ms 1008300 KB Output is correct
5 Correct 438 ms 1008428 KB Output is correct
6 Correct 434 ms 1008476 KB Output is correct
7 Correct 452 ms 1008332 KB Output is correct
8 Correct 442 ms 1008412 KB Output is correct
9 Incorrect 448 ms 1008344 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

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

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 458 ms 1008332 KB Output is correct
2 Correct 458 ms 1008436 KB Output is correct
3 Correct 434 ms 1008316 KB Output is correct
4 Correct 453 ms 1008380 KB Output is correct
5 Correct 508 ms 1008352 KB Output is correct
6 Correct 509 ms 1008432 KB Output is correct
7 Correct 527 ms 1008520 KB Output is correct
8 Correct 566 ms 1008432 KB Output is correct
9 Correct 603 ms 1008556 KB Output is correct
10 Correct 566 ms 1008528 KB Output is correct
11 Correct 467 ms 1008328 KB Output is correct
12 Correct 517 ms 1008412 KB Output is correct
13 Correct 541 ms 1008392 KB Output is correct
14 Correct 486 ms 1008416 KB Output is correct
15 Correct 621 ms 1008408 KB Output is correct
16 Correct 570 ms 1008476 KB Output is correct
17 Correct 558 ms 1008432 KB Output is correct
18 Correct 727 ms 1008444 KB Output is correct
19 Correct 634 ms 1008636 KB Output is correct
20 Correct 684 ms 1008516 KB Output is correct
21 Correct 444 ms 1008316 KB Output is correct
22 Correct 429 ms 1008332 KB Output is correct
23 Correct 441 ms 1008332 KB Output is correct
24 Correct 445 ms 1008300 KB Output is correct
25 Correct 438 ms 1008428 KB Output is correct
26 Correct 434 ms 1008476 KB Output is correct
27 Correct 452 ms 1008332 KB Output is correct
28 Correct 442 ms 1008412 KB Output is correct
29 Incorrect 448 ms 1008344 KB Output isn't correct
30 Halted 0 ms 0 KB -