oj.uz

답안 #536765

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
536765 2022-03-14T02:26:29 Z kym Let's Win the Election (JOI22_ho_t3) C++14
10 / 100
 1371 ms 4428 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 = 1e9;
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];
#define double long double
double dp[MAXN][MAXN]; //dp[index][votes]
int32_t main() 
{
	IAMSPEED
	cin >> n >> m;
	int cc=0;
	FOR(i,1,n) {
		cin >> A[i].f >> A[i].s;
		if(A[i].s==-1)A[i].s=inf;
		else ++cc;
	}
	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)dp[i][j]=inf;
	double ans = inf;
	FOR(k,1,min(m+1,cc+1)) { //number of collaborators inc. first guy
		FOR(i,0,MAXN-1)FOR(j,0,MAXN-1)dp[i][j]=inf;
		dp[0][0] = 0;
		FOR(i,1,n) { //index
			FOR(j,0,i) {//number of votes
				chmin(dp[i][j],dp[i-1][j]); //ignore
				if(j>k-1) { //just vote
					if(j>0)chmin(dp[i][j], dp[i-1][j-1] + (double)A[i].f/(double)k);
				} else {
					if(j>0 && k>1)chmin(dp[i][j], dp[i-1][j-1] + (double)A[i].s/(double)(j));
				}
			}
		}
		db(dp[n][m]);
		chmin(ans, dp[n][m]);
	}
	cout << fixed << setprecision(10) << ans;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 4308 KB Output is correct
2 Correct 5 ms 4308 KB Output is correct
3 Correct 5 ms 4308 KB Output is correct
4 Correct 5 ms 4308 KB Output is correct
5 Correct 7 ms 4308 KB Output is correct
6 Correct 7 ms 4332 KB Output is correct
7 Correct 7 ms 4308 KB Output is correct
8 Correct 8 ms 4332 KB Output is correct
9 Correct 6 ms 4308 KB Output is correct
10 Correct 6 ms 4308 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 4308 KB Output is correct
2 Correct 5 ms 4308 KB Output is correct
3 Correct 5 ms 4308 KB Output is correct
4 Correct 5 ms 4308 KB Output is correct
5 Correct 7 ms 4308 KB Output is correct
6 Correct 7 ms 4332 KB Output is correct
7 Correct 7 ms 4308 KB Output is correct
8 Correct 8 ms 4332 KB Output is correct
9 Correct 6 ms 4308 KB Output is correct
10 Correct 6 ms 4308 KB Output is correct
11 Correct 6 ms 4308 KB Output is correct
12 Correct 423 ms 4308 KB Output is correct
13 Correct 417 ms 4312 KB Output is correct
14 Correct 270 ms 4308 KB Output is correct
15 Correct 948 ms 4308 KB Output is correct
16 Correct 794 ms 4428 KB Output is correct
17 Correct 258 ms 4308 KB Output is correct
18 Correct 1336 ms 4308 KB Output is correct
19 Correct 808 ms 4428 KB Output is correct
20 Correct 246 ms 4312 KB Output is correct

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4308 KB Output is correct
2 Correct 8 ms 4308 KB Output is correct
3 Correct 10 ms 4308 KB Output is correct
4 Correct 12 ms 4320 KB Output is correct
5 Correct 12 ms 4316 KB Output is correct
6 Correct 14 ms 4308 KB Output is correct
7 Correct 17 ms 4212 KB Output is correct
8 Correct 12 ms 4308 KB Output is correct
9 Incorrect 13 ms 4308 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4308 KB Output is correct
2 Correct 8 ms 4308 KB Output is correct
3 Correct 10 ms 4308 KB Output is correct
4 Correct 12 ms 4320 KB Output is correct
5 Correct 12 ms 4316 KB Output is correct
6 Correct 14 ms 4308 KB Output is correct
7 Correct 17 ms 4212 KB Output is correct
8 Correct 12 ms 4308 KB Output is correct
9 Incorrect 13 ms 4308 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4308 KB Output is correct
2 Correct 8 ms 4308 KB Output is correct
3 Correct 10 ms 4308 KB Output is correct
4 Correct 12 ms 4320 KB Output is correct
5 Correct 12 ms 4316 KB Output is correct
6 Correct 14 ms 4308 KB Output is correct
7 Correct 17 ms 4212 KB Output is correct
8 Correct 12 ms 4308 KB Output is correct
9 Incorrect 13 ms 4308 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

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

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 4308 KB Output is correct
2 Correct 5 ms 4308 KB Output is correct
3 Correct 5 ms 4308 KB Output is correct
4 Correct 5 ms 4308 KB Output is correct
5 Correct 7 ms 4308 KB Output is correct
6 Correct 7 ms 4332 KB Output is correct
7 Correct 7 ms 4308 KB Output is correct
8 Correct 8 ms 4332 KB Output is correct
9 Correct 6 ms 4308 KB Output is correct
10 Correct 6 ms 4308 KB Output is correct
11 Correct 6 ms 4308 KB Output is correct
12 Correct 423 ms 4308 KB Output is correct
13 Correct 417 ms 4312 KB Output is correct
14 Correct 270 ms 4308 KB Output is correct
15 Correct 948 ms 4308 KB Output is correct
16 Correct 794 ms 4428 KB Output is correct
17 Correct 258 ms 4308 KB Output is correct
18 Correct 1336 ms 4308 KB Output is correct
19 Correct 808 ms 4428 KB Output is correct
20 Correct 246 ms 4312 KB Output is correct
21 Correct 7 ms 4308 KB Output is correct
22 Correct 8 ms 4308 KB Output is correct
23 Correct 10 ms 4308 KB Output is correct
24 Correct 12 ms 4320 KB Output is correct
25 Correct 12 ms 4316 KB Output is correct
26 Correct 14 ms 4308 KB Output is correct
27 Correct 17 ms 4212 KB Output is correct
28 Correct 12 ms 4308 KB Output is correct
29 Incorrect 13 ms 4308 KB Output isn't correct
30 Halted 0 ms 0 KB -