oj.uz

Submission #1088822

# Submission time Handle Problem Language Result Execution time Memory
1088822 2024-09-15T08:50:59 Z peacebringer1667 Let's Win the Election (JOI22_ho_t3) C++17
10 / 100
 10 ms 600 KB 
#include<bits/stdc++.h>
#define ll long long
#define ldb long double
#define fi first
#define se second
#define sza(a) (int)a.size()
#define pir pair<int,int>
#define pirll pair<ll,ll>
using namespace std;
const int maxn = 5e2 + 5;
const ll inf = 1e17;

void minimize(ldb &x,ldb y){
	x = min(x,y);
}

pair <ldb,ldb> a[maxn];
bool cmp(pair <ldb,ldb> x,pair <ldb,ldb> y){
	return (x.se < y.se);
}

void input(int n){
	for (int i = 1 ; i <= n ; i++){
		cin >> a[i].fi >> a[i].se;
	    if (a[i].se == -1) a[i].se = inf;
	}
	sort(a + 1,a + 1 + n,cmp);
}

ldb solve(int n,int k,int collab){
    ldb res = 0;
    int cnt = 1;
    
    for (int i = 1 ; i <= collab ; i++){
    	if (a[i].se == inf) return inf;
    	res += a[i].se/(ldb)cnt;
    	cnt++;
	}

	if (collab == k) return res;
	
	vector <ldb> lst;
	for (int i = collab + 1 ; i <= n ; i++)
	  lst.push_back(a[i].fi);
	sort(lst.begin(),lst.end());
	
	for (int i = 0 ; i < k - collab ; i++)
	   res += lst[i]/(ldb)cnt;
	return res;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
    
   // freopen("ELECTION.inp","r",stdin);
   // freopen("ELECTION.out","w",stdout);
    
	int n,k;
    cin >> n >> k;
    input(n);
    
    ldb res = inf;
    for (int collab = 0 ; collab <= k ; collab++)
      res = min(res,solve(n,k,collab));
    
    cout << fixed << setprecision(10) << res;

	return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 5 ms 504 KB Output is correct
14 Correct 4 ms 348 KB Output is correct
15 Correct 4 ms 460 KB Output is correct
16 Correct 7 ms 344 KB Output is correct
17 Correct 4 ms 348 KB Output is correct
18 Correct 5 ms 348 KB Output is correct
19 Correct 7 ms 496 KB Output is correct
20 Correct 4 ms 348 KB Output is correct

Subtask #3
0 / 11.0

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

Subtask #4
0 / 12.0

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

Subtask #5
0 / 33.0

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

Subtask #6
0 / 11.0

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

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 5 ms 504 KB Output is correct
14 Correct 4 ms 348 KB Output is correct
15 Correct 4 ms 460 KB Output is correct
16 Correct 7 ms 344 KB Output is correct
17 Correct 4 ms 348 KB Output is correct
18 Correct 5 ms 348 KB Output is correct
19 Correct 7 ms 496 KB Output is correct
20 Correct 4 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 460 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 600 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Incorrect 1 ms 348 KB Output isn't correct
30 Halted 0 ms 0 KB -