oj.uz

답안 #536746

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
536746 2022-03-14T01:09:59 Z kym Let's Win the Election (JOI22_ho_t3) C++14
10 / 100
 712 ms 1008556 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));
			}
		}
	}
	cout << fixed << setprecision(10);
	double ans = oo;
	FOR(i,1,MAXN-1) {
		chmin(ans, dp[n][m][i]);
	}
	cout << ans;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 447 ms 1008416 KB Output is correct
2 Correct 414 ms 1008380 KB Output is correct
3 Correct 453 ms 1008400 KB Output is correct
4 Correct 419 ms 1008312 KB Output is correct
5 Correct 439 ms 1008384 KB Output is correct
6 Correct 511 ms 1008324 KB Output is correct
7 Correct 549 ms 1008440 KB Output is correct
8 Correct 590 ms 1008440 KB Output is correct
9 Correct 560 ms 1008440 KB Output is correct
10 Correct 562 ms 1008556 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 447 ms 1008416 KB Output is correct
2 Correct 414 ms 1008380 KB Output is correct
3 Correct 453 ms 1008400 KB Output is correct
4 Correct 419 ms 1008312 KB Output is correct
5 Correct 439 ms 1008384 KB Output is correct
6 Correct 511 ms 1008324 KB Output is correct
7 Correct 549 ms 1008440 KB Output is correct
8 Correct 590 ms 1008440 KB Output is correct
9 Correct 560 ms 1008440 KB Output is correct
10 Correct 562 ms 1008556 KB Output is correct
11 Correct 426 ms 1008320 KB Output is correct
12 Correct 519 ms 1008504 KB Output is correct
13 Correct 483 ms 1008464 KB Output is correct
14 Correct 455 ms 1008396 KB Output is correct
15 Correct 605 ms 1008444 KB Output is correct
16 Correct 608 ms 1008320 KB Output is correct
17 Correct 550 ms 1008468 KB Output is correct
18 Correct 710 ms 1008420 KB Output is correct
19 Correct 623 ms 1008440 KB Output is correct
20 Correct 620 ms 1008332 KB Output is correct

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 422 ms 1008328 KB Output is correct
2 Correct 443 ms 1008344 KB Output is correct
3 Correct 406 ms 1008332 KB Output is correct
4 Correct 424 ms 1008404 KB Output is correct
5 Correct 413 ms 1008424 KB Output is correct
6 Correct 412 ms 1008392 KB Output is correct
7 Correct 427 ms 1008316 KB Output is correct
8 Correct 418 ms 1008332 KB Output is correct
9 Incorrect 416 ms 1008372 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 422 ms 1008328 KB Output is correct
2 Correct 443 ms 1008344 KB Output is correct
3 Correct 406 ms 1008332 KB Output is correct
4 Correct 424 ms 1008404 KB Output is correct
5 Correct 413 ms 1008424 KB Output is correct
6 Correct 412 ms 1008392 KB Output is correct
7 Correct 427 ms 1008316 KB Output is correct
8 Correct 418 ms 1008332 KB Output is correct
9 Incorrect 416 ms 1008372 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 422 ms 1008328 KB Output is correct
2 Correct 443 ms 1008344 KB Output is correct
3 Correct 406 ms 1008332 KB Output is correct
4 Correct 424 ms 1008404 KB Output is correct
5 Correct 413 ms 1008424 KB Output is correct
6 Correct 412 ms 1008392 KB Output is correct
7 Correct 427 ms 1008316 KB Output is correct
8 Correct 418 ms 1008332 KB Output is correct
9 Incorrect 416 ms 1008372 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 712 ms 1008436 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 447 ms 1008416 KB Output is correct
2 Correct 414 ms 1008380 KB Output is correct
3 Correct 453 ms 1008400 KB Output is correct
4 Correct 419 ms 1008312 KB Output is correct
5 Correct 439 ms 1008384 KB Output is correct
6 Correct 511 ms 1008324 KB Output is correct
7 Correct 549 ms 1008440 KB Output is correct
8 Correct 590 ms 1008440 KB Output is correct
9 Correct 560 ms 1008440 KB Output is correct
10 Correct 562 ms 1008556 KB Output is correct
11 Correct 426 ms 1008320 KB Output is correct
12 Correct 519 ms 1008504 KB Output is correct
13 Correct 483 ms 1008464 KB Output is correct
14 Correct 455 ms 1008396 KB Output is correct
15 Correct 605 ms 1008444 KB Output is correct
16 Correct 608 ms 1008320 KB Output is correct
17 Correct 550 ms 1008468 KB Output is correct
18 Correct 710 ms 1008420 KB Output is correct
19 Correct 623 ms 1008440 KB Output is correct
20 Correct 620 ms 1008332 KB Output is correct
21 Correct 422 ms 1008328 KB Output is correct
22 Correct 443 ms 1008344 KB Output is correct
23 Correct 406 ms 1008332 KB Output is correct
24 Correct 424 ms 1008404 KB Output is correct
25 Correct 413 ms 1008424 KB Output is correct
26 Correct 412 ms 1008392 KB Output is correct
27 Correct 427 ms 1008316 KB Output is correct
28 Correct 418 ms 1008332 KB Output is correct
29 Incorrect 416 ms 1008372 KB Output isn't correct
30 Halted 0 ms 0 KB -