oj.uz

Submission #640741

# Submission time Handle Problem Language Result Execution time Memory
640741 2022-09-15T07:23:09 Z peter940324 Let's Win the Election (JOI22_ho_t3) C++17
10 / 100
 17 ms 368 KB 
#include<bits/stdc++.h>
using namespace std;

#define int long long
#define double long double
#define IO ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);

#define pii pair<int,int>
#define ff first
#define ss second
#define mp make_pair

#define pb push_back
#define pf push_front
#define all(x) x.begin(),x.end()

#define de(x) cout << #x << ' ' << x << '\n';
template<class T> void prt(T l,T r){
  while(l!=r) cout << *l << ' ',l++;
  cout << '\n';
}

const int N=1e6+5,M=1e9+7,INF=1e18;

signed main(){
  IO
	int n,k;cin >> n >> k;
	vector<double> a(n),b(n);
	for(int i=0;i<n;i++) cin >> a[i] >> b[i];
	int cnt=n;
	for(int i=0;i<n;i++) if(b[i]==-1) b[i]=INF,cnt--;
	double ans=INF;
	for(double c=0;c<=min(cnt,k);c++){
		vector<int> is(n,0);
		vector<pair<pii,int> > v(n);
		for(int i=0;i<n;i++){
			v[i]=mp(mp(a[i],b[i]),i);
		}
		sort(all(v),[](pair<pii,int> aa,pair<pii,int> bb){
			if(aa.ff.ss==bb.ff.ss) return aa.ff.ff>bb.ff.ff;
			else return aa.ff.ss<bb.ff.ss;
		});
		double sum=0;
		double cc=0;
		for(double j=0;j<c;j++){
			sum+=v[j].ff.ss/(j+1);
			is[v[j].ss]=1;
			cc++;
		}
		sort(all(v),[](pair<pii,int> aa,pair<pii,int> bb){
			return aa.ff.ff<bb.ff.ff;
		});
		for(int i=0;i<n;i++){
			if(is[v[i].ss]) continue;
			cc++;
			sum+=v[i].ff.ff/(c+1);
			if(cc==k) break;
		}
		ans=min(ans,sum);
	}
	cout << setprecision(12) << fixed;
	cout << ans << '\n';
  return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory 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 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory 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 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 5 ms 340 KB Output is correct
13 Correct 5 ms 364 KB Output is correct
14 Correct 3 ms 340 KB Output is correct
15 Correct 11 ms 360 KB Output is correct
16 Correct 9 ms 364 KB Output is correct
17 Correct 3 ms 340 KB Output is correct
18 Correct 12 ms 368 KB Output is correct
19 Correct 9 ms 340 KB Output is correct
20 Correct 3 ms 340 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory 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 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Incorrect 0 ms 212 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 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 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Incorrect 0 ms 212 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 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 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Incorrect 0 ms 212 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 17 ms 364 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 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 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 5 ms 340 KB Output is correct
13 Correct 5 ms 364 KB Output is correct
14 Correct 3 ms 340 KB Output is correct
15 Correct 11 ms 360 KB Output is correct
16 Correct 9 ms 364 KB Output is correct
17 Correct 3 ms 340 KB Output is correct
18 Correct 12 ms 368 KB Output is correct
19 Correct 9 ms 340 KB Output is correct
20 Correct 3 ms 340 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Incorrect 0 ms 212 KB Output isn't correct
30 Halted 0 ms 0 KB -