oj.uz

Submission #619584

# Submission time Handle Problem Language Result Execution time Memory
619584 2022-08-02T13:13:18 Z StrawHatWess Let's Win the Election (JOI22_ho_t3) C++17
28 / 100
 2500 ms 4436 KB 
//Never stop trying
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
typedef string str;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
ll random(ll a, ll b){
    return a + rng() % (b - a + 1);
}
#ifndef LOCAL  
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl; 
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;

void IO() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin); 
    freopen("output.txt", "w", stdout);
#endif
}
/////////////////////////ONLY CLEAN CODES ALLOWED/////////////////////////

const int MX=510;

int N,K; 
vi a(MX),b(MX),p; 

ld memo[MX][MX]; 
int nbCollTarget; 
ld solve(int i, int nbCollCur){
	ld &ind=memo[i][nbCollCur]; 
	//if(ind!=-1) return ind; 


	int nbNormalCur=i-nbCollCur; 
	if(nbCollCur==nbCollTarget){
		int r = K - nbCollTarget - nbNormalCur; 

		vi vec; 
		FOR(j,i,N) vec.pb(a[p[j]]); 
		sort(all(vec)); 

		//dbgv(vec)

		ld ans=0; 
		FOR(j,0,r){
			int x=vec[j];
			ans+=((ld)(x))/(nbCollTarget+1); 
		}  
		return ans; 
	}

	ld ans=solve(i+1,nbCollCur+1) + ((ld)(b[p[i]]))/(nbCollCur+1); 

	if(nbNormalCur+nbCollTarget<K){
		ckmin(ans,solve(i+1,nbCollCur) + ((ld)(a[p[i]]))/(nbCollTarget+1) ); 
	}

	return ind=ans; 
}

int main() {
    boost; IO();

    cin>>N>>K; 

    FOR(i,0,N){
    	cin>>a[i]>>b[i]; 
    	p.pb(i); 
    	if(b[i]==-1) b[i]=1e9; 
    }

    sort(all(p), [&](int i, int j){
    	return b[i] < b[j]; 
    }); 

    //dbgv(p)

    ld ans=1e9; 
    FOR(n,0,K+1){
    	if(n && b[p[n-1]]==1e9) break; 

    	//nb collab wanted
    	nbCollTarget=n; 
    	memset(memo,-1.0,sizeof(memo)); 
    	ckmin(ans,solve(0,0)); 
    }

    cout << fixed << setprecision(10) << ans << endl;
    
    

    return 0;
}
//Change your approach

Subtask #1
5.0 / 5.0

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

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4308 KB Output is correct
2 Correct 2 ms 4308 KB Output is correct
3 Correct 2 ms 4308 KB Output is correct
4 Correct 3 ms 4308 KB Output is correct
5 Correct 2 ms 4300 KB Output is correct
6 Correct 2 ms 4308 KB Output is correct
7 Correct 2 ms 4308 KB Output is correct
8 Correct 3 ms 4308 KB Output is correct
9 Correct 2 ms 4304 KB Output is correct
10 Correct 2 ms 4308 KB Output is correct
11 Correct 3 ms 4308 KB Output is correct
12 Execution timed out 2576 ms 4308 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4308 KB Output is correct
2 Correct 2 ms 4308 KB Output is correct
3 Correct 3 ms 4308 KB Output is correct
4 Correct 3 ms 4308 KB Output is correct
5 Correct 3 ms 4308 KB Output is correct
6 Correct 2 ms 4308 KB Output is correct
7 Correct 4 ms 4308 KB Output is correct
8 Correct 3 ms 4308 KB Output is correct
9 Correct 3 ms 4308 KB Output is correct
10 Correct 3 ms 4308 KB Output is correct
11 Correct 3 ms 4308 KB Output is correct
12 Correct 4 ms 4304 KB Output is correct
13 Correct 3 ms 4308 KB Output is correct
14 Correct 2 ms 4308 KB Output is correct
15 Correct 3 ms 4436 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4308 KB Output is correct
2 Correct 2 ms 4308 KB Output is correct
3 Correct 3 ms 4308 KB Output is correct
4 Correct 3 ms 4308 KB Output is correct
5 Correct 3 ms 4308 KB Output is correct
6 Correct 2 ms 4308 KB Output is correct
7 Correct 4 ms 4308 KB Output is correct
8 Correct 3 ms 4308 KB Output is correct
9 Correct 3 ms 4308 KB Output is correct
10 Correct 3 ms 4308 KB Output is correct
11 Correct 3 ms 4308 KB Output is correct
12 Correct 4 ms 4304 KB Output is correct
13 Correct 3 ms 4308 KB Output is correct
14 Correct 2 ms 4308 KB Output is correct
15 Correct 3 ms 4436 KB Output is correct
16 Correct 2 ms 4308 KB Output is correct
17 Correct 3 ms 4304 KB Output is correct
18 Correct 3 ms 4308 KB Output is correct
19 Correct 5 ms 4308 KB Output is correct
20 Correct 5 ms 4308 KB Output is correct
21 Correct 5 ms 4400 KB Output is correct
22 Correct 7 ms 4396 KB Output is correct
23 Correct 6 ms 4308 KB Output is correct
24 Correct 6 ms 4400 KB Output is correct
25 Correct 71 ms 4376 KB Output is correct
26 Correct 67 ms 4380 KB Output is correct
27 Correct 5 ms 4308 KB Output is correct
28 Correct 6 ms 4308 KB Output is correct
29 Correct 5 ms 4308 KB Output is correct
30 Correct 11 ms 4328 KB Output is correct
31 Correct 6 ms 4308 KB Output is correct
32 Correct 9 ms 4308 KB Output is correct
33 Correct 5 ms 4308 KB Output is correct
34 Correct 6 ms 4308 KB Output is correct
35 Correct 7 ms 4308 KB Output is correct
36 Correct 5 ms 4304 KB Output is correct
37 Correct 6 ms 4308 KB Output is correct
38 Correct 5 ms 4308 KB Output is correct
39 Correct 6 ms 4300 KB Output is correct
40 Correct 5 ms 4308 KB Output is correct

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4308 KB Output is correct
2 Correct 2 ms 4308 KB Output is correct
3 Correct 3 ms 4308 KB Output is correct
4 Correct 3 ms 4308 KB Output is correct
5 Correct 3 ms 4308 KB Output is correct
6 Correct 2 ms 4308 KB Output is correct
7 Correct 4 ms 4308 KB Output is correct
8 Correct 3 ms 4308 KB Output is correct
9 Correct 3 ms 4308 KB Output is correct
10 Correct 3 ms 4308 KB Output is correct
11 Correct 3 ms 4308 KB Output is correct
12 Correct 4 ms 4304 KB Output is correct
13 Correct 3 ms 4308 KB Output is correct
14 Correct 2 ms 4308 KB Output is correct
15 Correct 3 ms 4436 KB Output is correct
16 Correct 2 ms 4308 KB Output is correct
17 Correct 3 ms 4304 KB Output is correct
18 Correct 3 ms 4308 KB Output is correct
19 Correct 5 ms 4308 KB Output is correct
20 Correct 5 ms 4308 KB Output is correct
21 Correct 5 ms 4400 KB Output is correct
22 Correct 7 ms 4396 KB Output is correct
23 Correct 6 ms 4308 KB Output is correct
24 Correct 6 ms 4400 KB Output is correct
25 Correct 71 ms 4376 KB Output is correct
26 Correct 67 ms 4380 KB Output is correct
27 Correct 5 ms 4308 KB Output is correct
28 Correct 6 ms 4308 KB Output is correct
29 Correct 5 ms 4308 KB Output is correct
30 Correct 11 ms 4328 KB Output is correct
31 Correct 6 ms 4308 KB Output is correct
32 Correct 9 ms 4308 KB Output is correct
33 Correct 5 ms 4308 KB Output is correct
34 Correct 6 ms 4308 KB Output is correct
35 Correct 7 ms 4308 KB Output is correct
36 Correct 5 ms 4304 KB Output is correct
37 Correct 6 ms 4308 KB Output is correct
38 Correct 5 ms 4308 KB Output is correct
39 Correct 6 ms 4300 KB Output is correct
40 Correct 5 ms 4308 KB Output is correct
41 Correct 41 ms 4308 KB Output is correct
42 Correct 50 ms 4376 KB Output is correct
43 Execution timed out 2573 ms 4308 KB Time limit exceeded
44 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2588 ms 4436 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4308 KB Output is correct
2 Correct 2 ms 4308 KB Output is correct
3 Correct 2 ms 4308 KB Output is correct
4 Correct 3 ms 4308 KB Output is correct
5 Correct 2 ms 4300 KB Output is correct
6 Correct 2 ms 4308 KB Output is correct
7 Correct 2 ms 4308 KB Output is correct
8 Correct 3 ms 4308 KB Output is correct
9 Correct 2 ms 4304 KB Output is correct
10 Correct 2 ms 4308 KB Output is correct
11 Correct 3 ms 4308 KB Output is correct
12 Execution timed out 2576 ms 4308 KB Time limit exceeded
13 Halted 0 ms 0 KB -