oj.uz

Submission #446474

# Submission time Handle Problem Language Result Execution time Memory
446474 2021-07-22T05:08:15 Z JerryLiu06 Hiring (IOI09_hiring) C++17
100 / 100
 425 ms 9176 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
using ll = long long;
using ld = long double;
using db = double;
using str = string;
 
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
 
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vpd = vector<pd>;
 
#define mp make_pair
#define f first
#define s second
 
#define sz(x) (int)(x).size()
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert 
#define ft front()
#define bk back()
#define pb push_back
#define pf push_front
 
#define lb lower_bound
#define ub upper_bound
 
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define R0F(i, a) ROF(i, 0, a)
#define EACH(a, x) for (auto& a : x)
 
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); }
ll fdiv(ll a, ll b) { return a / b - ((a ^ b) < 0 && a % b); }
 
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
 
template<class T> void remDup(vector<T>& v) { sor(v); v.erase(unique(all(v)), v.end()); }
 
const int MOD = 1e9 + 7;
const int MX = 5e5 + 10;
const ll INF = 1e18;

struct frac {
	ll n, d; frac(ll _n, ll _d) { n = _n, d = _d; if (d < 0) n *= -1, d *= -1; }

	frac(ll _n) : frac(_n,1) {} frac() : frac(0) {}

	friend frac abs(frac F) { return frac(abs(F.n), F.d); }

	friend bool operator<(const frac& l, const frac& r) { return l.n * r.d < r.n * l.d; }
    friend bool operator>(const frac& l, const frac& r) { return l.n * r.d > r.n * l.d; }
	friend bool operator==(const frac& l, const frac& r) { return l.n == r.n && l.d == r.d; }
	friend bool operator!=(const frac& l, const frac& r) { return !(l == r); }
 
	frac operator-() const { return frac(-n, d); }
	friend frac operator+(const frac& l, const frac& r) { return frac(l.n * r.d + r.n * l.d, l.d * r.d); }
	friend frac operator-(const frac& l, const frac& r) { return frac(l.n * r.d - r.n * l.d, l.d * r.d); }

	friend frac operator*(const frac& l, const frac& r) { return frac(l.n * r.n, l.d * r.d); }
	friend frac operator*(const frac& l, int r) { return l * frac(r, 1); }
	friend frac operator*(int r, const frac& l) { return l * r; }

	friend frac operator/(const frac& l, const frac& r) { return l * frac(r.d, r.n); }
	friend frac operator/(const frac& l, const int& r) { return l / frac(r, 1); }
	friend frac operator/(const int& l, const frac& r) { return frac(l, 1) / r; }
 
	friend frac& operator+=(frac& l, const frac& r) { return l = l + r; }
	friend frac& operator-=(frac& l, const frac& r) { return l = l - r; }
	template<class T> friend frac& operator*=(frac& l, const T& r) { return l = l * r; }
	template<class T> friend frac& operator/=(frac& l, const T& r) { return l = l / r; }
};
 
int N; ll W; int S[MX], Q[MX]; vi A; priority_queue<pi> PQ; 

ll tot = 0; int maxSize = 0; frac ans = 1; int indMax = 0;
 
int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);
 
    cin >> N >> W; FOR(i, 1, N + 1) cin >> S[i] >> Q[i];
 
    A.rsz(N); iota(all(A), 1); sort(all(A), [&](int a, int b) { return frac(S[a], Q[a]) < frac(S[b], Q[b]); });
        
    EACH(C, A) {
        PQ.push({Q[C], C}); tot += Q[C];
 
        while (frac(tot * S[C], Q[C]) > frac(W)) {
            tot -= PQ.top().f; PQ.pop();
        }
        if (sz(PQ) > maxSize || (sz(PQ) == maxSize && frac(tot * S[C], Q[C]) < frac(ans))) {
            maxSize = sz(PQ); ans = frac(tot * S[C], Q[C]); indMax = C;
        }
    }
    while (!PQ.empty()) PQ.pop(); tot = 0;
  
    if (maxSize == 0) { cout << "0" << "\n"; return 0; }
 
    EACH(C, A) {
        PQ.push({Q[C], C}); tot += Q[C];
 
        while (frac(tot * S[C], Q[C]) > frac(W)) {
            tot -= PQ.top().f; PQ.pop();
        }
        if (C == indMax) {
            cout << sz(PQ) << "\n";
 
            while (!PQ.empty()) {
                cout << PQ.top().s << "\n";
 
                PQ.pop();
            }
            break;
        }
    }
}

Compilation message

hiring.cpp: In function 'int main()':
hiring.cpp:110:5: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
  110 |     while (!PQ.empty()) PQ.pop(); tot = 0;
      |     ^~~~~
hiring.cpp:110:35: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
  110 |     while (!PQ.empty()) PQ.pop(); tot = 0;
      |                                   ^~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 216 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 3 ms 332 KB Output is correct
10 Correct 3 ms 340 KB Output is correct
11 Correct 3 ms 332 KB Output is correct
12 Correct 5 ms 460 KB Output is correct
13 Correct 4 ms 460 KB Output is correct
14 Correct 8 ms 588 KB Output is correct
15 Correct 9 ms 612 KB Output is correct

Subtask #2
28.0 / 28.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 332 KB Output is correct
4 Correct 11 ms 716 KB Output is correct
5 Correct 30 ms 1344 KB Output is correct
6 Correct 230 ms 5308 KB Output is correct
7 Correct 295 ms 7276 KB Output is correct

Subtask #3
6.0 / 6.0

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

Subtask #4
6.0 / 6.0

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

Subtask #5
6.0 / 6.0

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

Subtask #6
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 2248 KB Output is correct
2 Correct 84 ms 2304 KB Output is correct
3 Correct 80 ms 2256 KB Output is correct

Subtask #7
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 135 ms 3748 KB Output is correct
2 Correct 134 ms 3736 KB Output is correct
3 Correct 129 ms 3824 KB Output is correct

Subtask #8
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 362 ms 7992 KB Output is correct
2 Correct 369 ms 8024 KB Output is correct
3 Correct 351 ms 8020 KB Output is correct

Subtask #9
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 419 ms 9172 KB Output is correct
2 Correct 414 ms 9176 KB Output is correct
3 Correct 425 ms 9164 KB Output is correct