oj.uz

답안 #619587

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
619587 2022-08-02T13:16:13 Z StrawHatWess Let's Win the Election (JOI22_ho_t3) C++17
100 / 100
 1459 ms 4416 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; 

vector<vector<ld>>memo; 
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; 

    	memo.resize(N+5); 
    	FOR(i,0,N+5) memo[i].assign(N+5,-1); 

    	ckmin(ans,solve(0,0)); 
    }

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

    return 0;
}
//Change your approach

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 3 ms 4308 KB Output is correct
6 Correct 3 ms 4308 KB Output is correct
7 Correct 2 ms 4308 KB Output is correct
8 Correct 2 ms 4308 KB Output is correct
9 Correct 2 ms 4308 KB Output is correct
10 Correct 3 ms 4308 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 150 ms 4340 KB Output is correct
13 Correct 223 ms 4348 KB Output is correct
14 Correct 210 ms 4308 KB Output is correct
15 Correct 555 ms 4368 KB Output is correct
16 Correct 902 ms 4368 KB Output is correct
17 Correct 436 ms 4368 KB Output is correct
18 Correct 1082 ms 4388 KB Output is correct
19 Correct 1126 ms 4388 KB Output is correct
20 Correct 504 ms 4296 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 340 KB Output is correct

Subtask #5
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 468 KB Output is correct
42 Correct 1 ms 512 KB Output is correct
43 Correct 2 ms 468 KB Output is correct
44 Correct 2 ms 468 KB Output is correct
45 Correct 6 ms 460 KB Output is correct
46 Correct 4 ms 468 KB Output is correct
47 Correct 5 ms 456 KB Output is correct
48 Correct 6 ms 468 KB Output is correct
49 Correct 9 ms 516 KB Output is correct
50 Correct 9 ms 516 KB Output is correct
51 Correct 18 ms 468 KB Output is correct
52 Correct 9 ms 468 KB Output is correct
53 Correct 6 ms 468 KB Output is correct
54 Correct 5 ms 456 KB Output is correct
55 Correct 6 ms 468 KB Output is correct
56 Correct 5 ms 468 KB Output is correct
57 Correct 5 ms 468 KB Output is correct
58 Correct 5 ms 468 KB Output is correct
59 Correct 4 ms 468 KB Output is correct
60 Correct 5 ms 468 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1414 ms 4388 KB Output is correct
2 Correct 1437 ms 4392 KB Output is correct
3 Correct 1459 ms 4388 KB Output is correct
4 Correct 1438 ms 4392 KB Output is correct
5 Correct 1430 ms 4388 KB Output is correct
6 Correct 1439 ms 4388 KB Output is correct
7 Correct 1281 ms 4392 KB Output is correct

Subtask #7
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 3 ms 4308 KB Output is correct
6 Correct 3 ms 4308 KB Output is correct
7 Correct 2 ms 4308 KB Output is correct
8 Correct 2 ms 4308 KB Output is correct
9 Correct 2 ms 4308 KB Output is correct
10 Correct 3 ms 4308 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 150 ms 4340 KB Output is correct
13 Correct 223 ms 4348 KB Output is correct
14 Correct 210 ms 4308 KB Output is correct
15 Correct 555 ms 4368 KB Output is correct
16 Correct 902 ms 4368 KB Output is correct
17 Correct 436 ms 4368 KB Output is correct
18 Correct 1082 ms 4388 KB Output is correct
19 Correct 1126 ms 4388 KB Output is correct
20 Correct 504 ms 4296 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 1 ms 256 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 0 ms 340 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 0 ms 212 KB Output is correct
54 Correct 0 ms 212 KB Output is correct
55 Correct 0 ms 340 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 1 ms 212 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 1 ms 468 KB Output is correct
62 Correct 1 ms 512 KB Output is correct
63 Correct 2 ms 468 KB Output is correct
64 Correct 2 ms 468 KB Output is correct
65 Correct 6 ms 460 KB Output is correct
66 Correct 4 ms 468 KB Output is correct
67 Correct 5 ms 456 KB Output is correct
68 Correct 6 ms 468 KB Output is correct
69 Correct 9 ms 516 KB Output is correct
70 Correct 9 ms 516 KB Output is correct
71 Correct 18 ms 468 KB Output is correct
72 Correct 9 ms 468 KB Output is correct
73 Correct 6 ms 468 KB Output is correct
74 Correct 5 ms 456 KB Output is correct
75 Correct 6 ms 468 KB Output is correct
76 Correct 5 ms 468 KB Output is correct
77 Correct 5 ms 468 KB Output is correct
78 Correct 5 ms 468 KB Output is correct
79 Correct 4 ms 468 KB Output is correct
80 Correct 5 ms 468 KB Output is correct
81 Correct 1414 ms 4388 KB Output is correct
82 Correct 1437 ms 4392 KB Output is correct
83 Correct 1459 ms 4388 KB Output is correct
84 Correct 1438 ms 4392 KB Output is correct
85 Correct 1430 ms 4388 KB Output is correct
86 Correct 1439 ms 4388 KB Output is correct
87 Correct 1281 ms 4392 KB Output is correct
88 Correct 45 ms 4328 KB Output is correct
89 Correct 46 ms 4352 KB Output is correct
90 Correct 185 ms 4340 KB Output is correct
91 Correct 194 ms 4340 KB Output is correct
92 Correct 554 ms 4360 KB Output is correct
93 Correct 568 ms 4308 KB Output is correct
94 Correct 1029 ms 4372 KB Output is correct
95 Correct 1014 ms 4416 KB Output is correct
96 Correct 1264 ms 4384 KB Output is correct
97 Correct 1306 ms 4388 KB Output is correct
98 Correct 864 ms 4376 KB Output is correct
99 Correct 888 ms 4372 KB Output is correct
100 Correct 890 ms 4372 KB Output is correct
101 Correct 945 ms 4372 KB Output is correct
102 Correct 850 ms 4376 KB Output is correct
103 Correct 827 ms 4372 KB Output is correct
104 Correct 897 ms 4368 KB Output is correct
105 Correct 607 ms 4372 KB Output is correct