oj.uz

Submission #536749

# Submission time Handle Problem Language Result Execution time Memory
536749 2022-03-14T01:22:30 Z kym Let's Win the Election (JOI22_ho_t3) C++14
10 / 100
 725 ms 1008540 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 = (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,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=oo;
	}
	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]=oo;
	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!=oo && 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 = oo;
	FOR(i,1,MAXN-1) {
		chmin(ans, dp[n][m][i]);
	}
	cout << ans;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 441 ms 1008532 KB Output is correct
2 Correct 467 ms 1008344 KB Output is correct
3 Correct 457 ms 1008364 KB Output is correct
4 Correct 455 ms 1008412 KB Output is correct
5 Correct 473 ms 1008372 KB Output is correct
6 Correct 480 ms 1008440 KB Output is correct
7 Correct 531 ms 1008440 KB Output is correct
8 Correct 587 ms 1008508 KB Output is correct
9 Correct 603 ms 1008436 KB Output is correct
10 Correct 555 ms 1008340 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 441 ms 1008532 KB Output is correct
2 Correct 467 ms 1008344 KB Output is correct
3 Correct 457 ms 1008364 KB Output is correct
4 Correct 455 ms 1008412 KB Output is correct
5 Correct 473 ms 1008372 KB Output is correct
6 Correct 480 ms 1008440 KB Output is correct
7 Correct 531 ms 1008440 KB Output is correct
8 Correct 587 ms 1008508 KB Output is correct
9 Correct 603 ms 1008436 KB Output is correct
10 Correct 555 ms 1008340 KB Output is correct
11 Correct 450 ms 1008344 KB Output is correct
12 Correct 547 ms 1008528 KB Output is correct
13 Correct 505 ms 1008436 KB Output is correct
14 Correct 499 ms 1008472 KB Output is correct
15 Correct 623 ms 1008480 KB Output is correct
16 Correct 567 ms 1008432 KB Output is correct
17 Correct 567 ms 1008432 KB Output is correct
18 Correct 711 ms 1008436 KB Output is correct
19 Correct 667 ms 1008520 KB Output is correct
20 Correct 622 ms 1008436 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 448 ms 1008452 KB Output is correct
2 Correct 507 ms 1008508 KB Output is correct
3 Correct 443 ms 1008428 KB Output is correct
4 Correct 456 ms 1008384 KB Output is correct
5 Correct 456 ms 1008336 KB Output is correct
6 Correct 440 ms 1008388 KB Output is correct
7 Correct 443 ms 1008540 KB Output is correct
8 Correct 452 ms 1008472 KB Output is correct
9 Incorrect 458 ms 1008324 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 448 ms 1008452 KB Output is correct
2 Correct 507 ms 1008508 KB Output is correct
3 Correct 443 ms 1008428 KB Output is correct
4 Correct 456 ms 1008384 KB Output is correct
5 Correct 456 ms 1008336 KB Output is correct
6 Correct 440 ms 1008388 KB Output is correct
7 Correct 443 ms 1008540 KB Output is correct
8 Correct 452 ms 1008472 KB Output is correct
9 Incorrect 458 ms 1008324 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 448 ms 1008452 KB Output is correct
2 Correct 507 ms 1008508 KB Output is correct
3 Correct 443 ms 1008428 KB Output is correct
4 Correct 456 ms 1008384 KB Output is correct
5 Correct 456 ms 1008336 KB Output is correct
6 Correct 440 ms 1008388 KB Output is correct
7 Correct 443 ms 1008540 KB Output is correct
8 Correct 452 ms 1008472 KB Output is correct
9 Incorrect 458 ms 1008324 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

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

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 441 ms 1008532 KB Output is correct
2 Correct 467 ms 1008344 KB Output is correct
3 Correct 457 ms 1008364 KB Output is correct
4 Correct 455 ms 1008412 KB Output is correct
5 Correct 473 ms 1008372 KB Output is correct
6 Correct 480 ms 1008440 KB Output is correct
7 Correct 531 ms 1008440 KB Output is correct
8 Correct 587 ms 1008508 KB Output is correct
9 Correct 603 ms 1008436 KB Output is correct
10 Correct 555 ms 1008340 KB Output is correct
11 Correct 450 ms 1008344 KB Output is correct
12 Correct 547 ms 1008528 KB Output is correct
13 Correct 505 ms 1008436 KB Output is correct
14 Correct 499 ms 1008472 KB Output is correct
15 Correct 623 ms 1008480 KB Output is correct
16 Correct 567 ms 1008432 KB Output is correct
17 Correct 567 ms 1008432 KB Output is correct
18 Correct 711 ms 1008436 KB Output is correct
19 Correct 667 ms 1008520 KB Output is correct
20 Correct 622 ms 1008436 KB Output is correct
21 Correct 448 ms 1008452 KB Output is correct
22 Correct 507 ms 1008508 KB Output is correct
23 Correct 443 ms 1008428 KB Output is correct
24 Correct 456 ms 1008384 KB Output is correct
25 Correct 456 ms 1008336 KB Output is correct
26 Correct 440 ms 1008388 KB Output is correct
27 Correct 443 ms 1008540 KB Output is correct
28 Correct 452 ms 1008472 KB Output is correct
29 Incorrect 458 ms 1008324 KB Output isn't correct
30 Halted 0 ms 0 KB -