oj.uz

Submission #964986

# Submission time Handle Problem Language Result Execution time Memory
964986 2024-04-18T01:35:09 Z fzyzzz_z Hiring (IOI09_hiring) C++17
65 / 100
 508 ms 21808 KB 
#include <bits/stdc++.h>
using namespace std; 

using ll = long long; 
#define fs first
#define sc second 

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int n; 
	ll k; 
	cin >> n >> k; 
	vector<pair<int, int>> a(n); 
	vector<int> ord(n); 

	for (int i = 0; i < n; ++i) {
		cin >> a[i].sc >> a[i].fs; 
		ord[i] = i; 
	}

	sort(ord.begin(), ord.end(), [&](int & x, int & y){
		if (a[x].fs * a[y].sc == a[x].sc * a[y].fs) return a[x].sc < a[y].sc; 
		return (a[y].fs * a[x].sc <= a[y].sc * a[x].fs); 
	});

	set<pair<int, int>> st; 
	int ans = 0, at = 0; 
	ll cs = 0; 
	ll tcb = 1, tct = 0; 

	for (int i = 0; i < n; ++i) {
		int x = a[ord[i]].fs, y = a[ord[i]].sc; 
		cs += x; 
		st.insert({x, i}); 

		while (cs * y > k * x) {
			pair<int, int> v = *st.rbegin(); 
			cs -= v.fs; 
			st.erase(v); 
		}

		if (st.size() > ans) {
			ans = st.size(); 
			tct = cs * y; 
			tcb = x; 
			at = i; 
		} else if (cs * y / tcb > tct / x && st.size() == ans) {
			tct = cs * y; 
			tcb = x; 
			at = i; 
		}
	}

	st.clear(); 
	cs = 0; 
	for (int i = 0; i < n; ++i) {
		int x = a[ord[i]].fs, y = a[ord[i]].sc; 
		cs += x; 
		st.insert({x, ord[i]}); 

		while (cs * y > k * x) {
			pair<int, int> v = *st.rbegin(); 
			cs -= v.fs; 
			st.erase(v); 
		}

		if (at == i) {
			cout << ans << "\n";
			ll tot = 0, m0 = 1, m1 = 0; 
			for (auto v: st) {
				cout << v.sc + 1 << "\n"; 

				tot += a[v.sc].fs; 
				if (m1 * a[v.sc].fs < m0 * a[v.sc].sc) {
					m1 = a[v.sc].sc; 
					m0 = a[v.sc].fs; 
				}
				assert(tot * m1 <= k * m0); 
			}
			return 0; 
		}
	}

	assert(false); 

	return 0; 
}

Compilation message

hiring.cpp: In function 'int main()':
hiring.cpp:44:17: warning: comparison of integer expressions of different signedness: 'std::set<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   44 |   if (st.size() > ans) {
      |       ~~~~~~~~~~^~~~~
hiring.cpp:49:50: warning: comparison of integer expressions of different signedness: 'std::set<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   49 |   } else if (cs * y / tcb > tct / x && st.size() == ans) {
      |                                        ~~~~~~~~~~^~~~~~

Subtask #1
22.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Partially correct 1 ms 348 KB Partially correct
5 Partially correct 0 ms 344 KB Partially correct
6 Correct 1 ms 348 KB Output is correct
7 Partially correct 1 ms 348 KB Partially correct
8 Partially correct 2 ms 348 KB Partially correct
9 Correct 3 ms 640 KB Output is correct
10 Correct 3 ms 816 KB Output is correct
11 Partially correct 3 ms 604 KB Partially correct
12 Partially correct 4 ms 856 KB Partially correct
13 Partially correct 3 ms 604 KB Partially correct
14 Correct 7 ms 860 KB Output is correct
15 Partially correct 8 ms 980 KB Partially correct

Subtask #2
22.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Partially correct 1 ms 600 KB Partially correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 10 ms 1296 KB Output is correct
5 Partially correct 24 ms 2396 KB Partially correct
6 Partially correct 271 ms 12112 KB Partially correct
7 Correct 298 ms 16720 KB Output is correct

Subtask #3
3.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Partially correct 1 ms 348 KB Partially correct
3 Correct 1 ms 344 KB Output is correct

Subtask #4
3.0 / 6.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 348 KB Partially correct
2 Partially correct 1 ms 348 KB Partially correct
3 Correct 1 ms 348 KB Output is correct

Subtask #5
3.0 / 6.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 348 KB Partially correct
2 Partially correct 1 ms 348 KB Partially correct
3 Correct 1 ms 344 KB Output is correct

Subtask #6
3.0 / 6.0

# Verdict Execution time Memory Grader output
1 Partially correct 81 ms 4868 KB Partially correct
2 Partially correct 90 ms 4948 KB Partially correct
3 Correct 84 ms 4948 KB Output is correct

Subtask #7
3.0 / 6.0

# Verdict Execution time Memory Grader output
1 Partially correct 104 ms 8528 KB Partially correct
2 Partially correct 102 ms 8532 KB Partially correct
3 Correct 133 ms 8400 KB Output is correct

Subtask #8
3.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 384 ms 18620 KB Output is correct
2 Partially correct 371 ms 18584 KB Partially correct
3 Correct 397 ms 18676 KB Output is correct

Subtask #9
3.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 508 ms 21808 KB Output is correct
2 Partially correct 428 ms 21600 KB Partially correct
3 Correct 467 ms 21664 KB Output is correct