oj.uz

Submission #536763

# Submission time Handle Problem Language Result Execution time Memory
536763 2022-03-14T02:25:37 Z kym Let's Win the Election (JOI22_ho_t3) C++14
10 / 100
 190 ms 2320 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];
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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2260 KB Output is correct
2 Correct 1 ms 2260 KB Output is correct
3 Correct 2 ms 2260 KB Output is correct
4 Correct 1 ms 2260 KB Output is correct
5 Correct 2 ms 2260 KB Output is correct
6 Correct 2 ms 2260 KB Output is correct
7 Correct 2 ms 2260 KB Output is correct
8 Correct 2 ms 2260 KB Output is correct
9 Correct 2 ms 2260 KB Output is correct
10 Correct 2 ms 2260 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2260 KB Output is correct
2 Correct 1 ms 2260 KB Output is correct
3 Correct 2 ms 2260 KB Output is correct
4 Correct 1 ms 2260 KB Output is correct
5 Correct 2 ms 2260 KB Output is correct
6 Correct 2 ms 2260 KB Output is correct
7 Correct 2 ms 2260 KB Output is correct
8 Correct 2 ms 2260 KB Output is correct
9 Correct 2 ms 2260 KB Output is correct
10 Correct 2 ms 2260 KB Output is correct
11 Correct 1 ms 2260 KB Output is correct
12 Correct 51 ms 2304 KB Output is correct
13 Correct 52 ms 2320 KB Output is correct
14 Correct 36 ms 2304 KB Output is correct
15 Correct 123 ms 2304 KB Output is correct
16 Correct 110 ms 2312 KB Output is correct
17 Correct 34 ms 2260 KB Output is correct
18 Correct 168 ms 2312 KB Output is correct
19 Correct 101 ms 2312 KB Output is correct
20 Correct 32 ms 2260 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2260 KB Output is correct
2 Correct 1 ms 2260 KB Output is correct
3 Correct 2 ms 2260 KB Output is correct
4 Correct 2 ms 2260 KB Output is correct
5 Correct 2 ms 2260 KB Output is correct
6 Correct 2 ms 2260 KB Output is correct
7 Correct 2 ms 2260 KB Output is correct
8 Correct 2 ms 2260 KB Output is correct
9 Incorrect 2 ms 2260 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2260 KB Output is correct
2 Correct 1 ms 2260 KB Output is correct
3 Correct 2 ms 2260 KB Output is correct
4 Correct 2 ms 2260 KB Output is correct
5 Correct 2 ms 2260 KB Output is correct
6 Correct 2 ms 2260 KB Output is correct
7 Correct 2 ms 2260 KB Output is correct
8 Correct 2 ms 2260 KB Output is correct
9 Incorrect 2 ms 2260 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2260 KB Output is correct
2 Correct 1 ms 2260 KB Output is correct
3 Correct 2 ms 2260 KB Output is correct
4 Correct 2 ms 2260 KB Output is correct
5 Correct 2 ms 2260 KB Output is correct
6 Correct 2 ms 2260 KB Output is correct
7 Correct 2 ms 2260 KB Output is correct
8 Correct 2 ms 2260 KB Output is correct
9 Incorrect 2 ms 2260 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

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

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2260 KB Output is correct
2 Correct 1 ms 2260 KB Output is correct
3 Correct 2 ms 2260 KB Output is correct
4 Correct 1 ms 2260 KB Output is correct
5 Correct 2 ms 2260 KB Output is correct
6 Correct 2 ms 2260 KB Output is correct
7 Correct 2 ms 2260 KB Output is correct
8 Correct 2 ms 2260 KB Output is correct
9 Correct 2 ms 2260 KB Output is correct
10 Correct 2 ms 2260 KB Output is correct
11 Correct 1 ms 2260 KB Output is correct
12 Correct 51 ms 2304 KB Output is correct
13 Correct 52 ms 2320 KB Output is correct
14 Correct 36 ms 2304 KB Output is correct
15 Correct 123 ms 2304 KB Output is correct
16 Correct 110 ms 2312 KB Output is correct
17 Correct 34 ms 2260 KB Output is correct
18 Correct 168 ms 2312 KB Output is correct
19 Correct 101 ms 2312 KB Output is correct
20 Correct 32 ms 2260 KB Output is correct
21 Correct 1 ms 2260 KB Output is correct
22 Correct 1 ms 2260 KB Output is correct
23 Correct 2 ms 2260 KB Output is correct
24 Correct 2 ms 2260 KB Output is correct
25 Correct 2 ms 2260 KB Output is correct
26 Correct 2 ms 2260 KB Output is correct
27 Correct 2 ms 2260 KB Output is correct
28 Correct 2 ms 2260 KB Output is correct
29 Incorrect 2 ms 2260 KB Output isn't correct
30 Halted 0 ms 0 KB -