# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
970958 |
2024-04-27T16:02:38 Z |
Bilyana |
Hiring (IOI09_hiring) |
C++17 |
|
362 ms |
9224 KB |
#include <algorithm>
#include <iostream>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <list>
#include <set>
#include <vector>
#include <string>
#include <math.h>
#include <queue>
#define f first
#define s second
#define sz(a) ((float)a.size())
#define all(a) a.begin(), a.end()
#define pb push_back
#define eb emplace_back
using namespace std;
using ll = float;
template<class T, class T2> inline bool chkmax(T &x, const T2 & y) { return x < y ? x = y, 1 : 0; }
template<class T, class T2> inline bool chkmin(T &x, const T2 & y) { return x > y ? x = y, 1 : 0; }
template<class T, class T2> inline istream &operator>>(istream &is, pair<T, T2> &p) { is>>p.f>>p.s; return is; }
template<class T, class T2> inline ostream &operator<<(ostream &os, const pair<T, T2> &p) { os<<p.f<<' '<<p.s; return os; }
template<class T> inline istream &operator>>(istream &is, vector<T> &v) { for (auto &id : v) is>>id; return is; }
template<class T> inline ostream &operator<<(ostream &os, const vector<T> &v) { for (auto id : v) os<<id<<'\n'; return os; }
template<class T, class T2> inline ostream &operator<<(ostream &os, const map<T, T2> &m) { for (auto id : m) os<<id<<'\n'; return os; }
template<class T, class T2> inline ostream &operator<<(ostream &os, const unordered_map<T, T2> &um) { for (auto id : um) os<<id<<'\n'; return os; }
template<class T> inline ostream &operator<<(ostream &os, const list<T> &l) { for (auto id : l) os<<id<<' '; return os; }
template<class T> inline ostream &operator<<(ostream &os, const set<T> &s) { for (auto id : s) os<<id<<' '; return os; }
template<class T> inline ostream &operator<<(ostream &os, const unordered_set<T> &us) { for (auto id : us) os<<id<<' '; return os; }
const float INF = 1e18;
const bool hasTests = 1;
float n;
float w;
vector<pair<float, float>> k;
vector<int> ansWork;
void input() {
cin >> n >> w;
k.resize(n);
cin >> k;
}
void output() {
cout << ansWork.size() << endl;
cout << ansWork;
}
void solve() {
vector<int> perm (n);
for (int i=0; i<n; i++) {
perm[i] = i;
}
sort(perm.begin(), perm.end(), [&](auto l, auto r) {
if ((float)k[l].f / k[l].s == (float)k[r].f / k[r].s) {
return k[l].s < k[r].s;
}
return (float)k[l].f / k[l].s < (float)k[r].f / k[r].s;
});
float ans = 0;
float bestWork = 0;
float bestMoney = 0;
float sz = 0;
float qu = 0;
float money = 0;
float tot = 0;
priority_queue<float> curr;
float i = 0;
for (auto temp : perm) {
auto work = k[temp];
qu += work.s;
money = (float)work.f / work.s;
sz++;
curr.push(work.s);
tot = (float)qu * money;
while (!curr.empty() && tot > w) {
qu -= curr.top();
curr.pop();
tot = (float)qu * money;
sz--;
}
if ((sz > bestWork) || (sz == bestWork && tot < bestMoney)) {
bestWork = sz;
bestMoney = tot;
ans = i;
}
i++;
}
qu = 0;
for (float i=0; i<=ans; i++) {
ansWork.push_back(perm[i]);
qu += k[perm[i]].second;
}
money = (float)k[perm[ans]].first / k[perm[ans]].second;
sort(ansWork.begin(), ansWork.end(), [&](auto l, auto r) {
return k[l].s < k[r].s;
});
tot = (float)money * qu;
while (tot > w && !ansWork.empty()) {
qu -= k[ansWork.back()].s;
tot -= (float)money * qu;
ansWork.pop_back();
}
for (auto& curr : ansWork) {
curr++;
}
}
void start() {
input();
solve();
//cout<<"Case #"<<i<<": ";
output();
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
start();
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
500 KB |
Output is correct |
2 |
Correct |
1 ms |
372 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
5 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
6 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
7 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
8 |
Correct |
3 ms |
348 KB |
Output is correct |
9 |
Incorrect |
3 ms |
560 KB |
Output isn't correct |
10 |
Incorrect |
3 ms |
348 KB |
Output isn't correct |
11 |
Incorrect |
4 ms |
600 KB |
Output isn't correct |
12 |
Incorrect |
4 ms |
600 KB |
Output isn't correct |
13 |
Incorrect |
5 ms |
348 KB |
Output isn't correct |
14 |
Incorrect |
8 ms |
604 KB |
Output isn't correct |
15 |
Incorrect |
9 ms |
604 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
4 |
Incorrect |
12 ms |
604 KB |
Output isn't correct |
5 |
Incorrect |
31 ms |
1612 KB |
Output isn't correct |
6 |
Incorrect |
224 ms |
5372 KB |
Output isn't correct |
7 |
Incorrect |
257 ms |
7764 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
81 ms |
2544 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
141 ms |
4184 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
312 ms |
8416 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
362 ms |
9224 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |