oj.uz

Submission #532016

# Submission time Handle Problem Language Result Execution time Memory
532016 2022-03-02T03:39:47 Z Haruto810198 Let's Win the Election (JOI22_ho_t3) C++17
10 / 100
 38 ms 340 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long
#define double long double

#define FOR(i, l, r, d) for(int i=(l); i<=(r); i+=(d))
#define szof(x) ((int)(x).size())

#define vi vector<int>
#define pii pair<int, int>

#define F first
#define S second

#define pb push_back
#define eb emplace_back
#define mkp make_pair

const int INF = INT_MAX;
const int LNF = INF*INF;
const int MOD = 1000000007;
const int mod = 998244353;
const double eps = 1e-12;

//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")

const int MAX = 510;

struct State{
	double A, B;	
};

int n, k;
State state[MAX];
double res;

bool cmp_by_A(State x, State y){
	if(x.A == y.A) return (x.B < y.B);
	return (x.A < y.A);
}

bool cmp_by_B(State x, State y){
	if(x.B == y.B) return (x.A < y.A);
	return (x.B < y.B);
}

signed main(){
	
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	
	cin>>n>>k;
	FOR(i, 1, n, 1){
		cin>>state[i].A>>state[i].B;
		if(state[i].B == -1) state[i].B = INF;
	}
	
	res = INF;
	// enum. n. of collaborators
	FOR(i, 0, k, 1){
		// i collaborators

		sort(state+1, state+n+1, cmp_by_B);
		sort(state+i+1, state+n+1, cmp_by_A);
		
		double sum = 0;
		double col = 1;
		FOR(j, 1, i, 1){
			sum += state[j].B / col;
			col += 1;
		}

		FOR(j, i+1, k, 1){
			sum += state[j].A / col;
		}

		res = min(res, sum);
		//cerr<<"i = "<<i<<" : sum = "<<sum<<endl;
	}

	cout<<fixed<<setprecision(12)<<res<<'\n';
	
	return 0;

}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 4 ms 204 KB Output is correct
6 Correct 9 ms 332 KB Output is correct
7 Correct 21 ms 336 KB Output is correct
8 Correct 22 ms 332 KB Output is correct
9 Correct 26 ms 332 KB Output is correct
10 Correct 20 ms 332 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 4 ms 204 KB Output is correct
6 Correct 9 ms 332 KB Output is correct
7 Correct 21 ms 336 KB Output is correct
8 Correct 22 ms 332 KB Output is correct
9 Correct 26 ms 332 KB Output is correct
10 Correct 20 ms 332 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 10 ms 332 KB Output is correct
13 Correct 14 ms 332 KB Output is correct
14 Correct 16 ms 336 KB Output is correct
15 Correct 19 ms 340 KB Output is correct
16 Correct 34 ms 332 KB Output is correct
17 Correct 27 ms 332 KB Output is correct
18 Correct 22 ms 332 KB Output is correct
19 Correct 31 ms 332 KB Output is correct
20 Correct 28 ms 332 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Incorrect 0 ms 204 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 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Incorrect 0 ms 204 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 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Incorrect 0 ms 204 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

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