oj.uz

답안 #928538

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
928538 2024-02-16T15:36:12 Z boris_mihov Hiring (IOI09_hiring) C++17
60 / 100
 363 ms 21436 KB 
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>
#include <queue>
#include <set>

typedef long long llong;
const int MAXN = 500000 + 10;
const int INF  = 1e9;

int n;
llong s[MAXN];
llong q[MAXN];
int perm[MAXN];
std::priority_queue <std::pair <__int128,int>> pq;
__int128 sum;
__int128 w;
llong w1;

void solve()
{
    std::iota(perm + 1, perm + 1 + n, 1);
    std::sort(perm + 1, perm + 1 + n, [&](int x, int y)
    {
        return s[x] * q[y] < s[y] * q[x];
    });

    int ans = 0;
    int cnt = 0;
    int maxPos = 0;
    for (int i = 1 ; i <= n ; ++i)
    {
        pq.push({q[perm[i]], perm[i]});
        sum += q[perm[i]];
        cnt++;

        while (sum * s[perm[i]] > w * q[perm[i]])
        {
            cnt--;
            sum -= pq.top().first;
            pq.pop();
        }

        if (cnt > ans)
        {
            maxPos = i;
            ans = cnt;
        }
    }

    while (pq.size())
    {
        pq.pop();
    }

    sum = 0;
    cnt = 0;
    std::cout << ans << '\n';
    for (int i = 1 ; i <= maxPos ; ++i)
    {
        pq.push({q[perm[i]], perm[i]});
        sum += q[perm[i]];
        cnt++;

        while (sum * s[perm[i]] > w * q[perm[i]])
        {
            cnt--;
            sum -= pq.top().first;
            pq.pop();
        }
    }

    std::vector <int> sol;
    while (pq.size())
    {
        sol.push_back(pq.top().second);
        // std::cout << pq.top().second << '\n';
        pq.pop();
    }

    std::sort(sol.begin(), sol.end());
    for (const int &idx : sol)
    {
        std::cout << idx << '\n';
    }
}

void input()
{
    std::cin >> n >> w1; w = w1;
    for (int i = 1 ; i <= n ; ++i)
    {
        std::cin >> s[i] >> q[i];
    }
}

void fastIOI()
{
    std::ios_base :: sync_with_stdio(0);
    std::cout.tie(nullptr);
    std::cin.tie(nullptr);
}

int main()
{
    fastIOI();
    input();
    solve();

    return 0;
}

Subtask #1
19.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 4444 KB Partially correct
2 Partially correct 1 ms 4444 KB Partially correct
3 Correct 1 ms 4444 KB Output is correct
4 Partially correct 1 ms 4444 KB Partially correct
5 Partially correct 1 ms 4444 KB Partially correct
6 Partially correct 1 ms 4444 KB Partially correct
7 Partially correct 1 ms 4444 KB Partially correct
8 Partially correct 2 ms 4444 KB Partially correct
9 Correct 2 ms 4700 KB Output is correct
10 Partially correct 3 ms 4696 KB Partially correct
11 Correct 3 ms 4444 KB Output is correct
12 Partially correct 5 ms 4956 KB Partially correct
13 Partially correct 4 ms 4444 KB Partially correct
14 Correct 7 ms 4876 KB Output is correct
15 Partially correct 8 ms 4952 KB Partially correct

Subtask #2
20.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Partially correct 1 ms 4444 KB Partially correct
3 Correct 2 ms 4444 KB Output is correct
4 Partially correct 9 ms 4952 KB Partially correct
5 Partially correct 22 ms 9440 KB Partially correct
6 Correct 171 ms 13392 KB Output is correct
7 Partially correct 249 ms 19140 KB Partially correct

Subtask #3
3.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 4696 KB Partially correct
2 Partially correct 1 ms 4444 KB Partially correct
3 Correct 1 ms 4444 KB Output is correct

Subtask #4
3.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Partially correct 1 ms 4444 KB Partially correct
3 Correct 1 ms 4444 KB Output is correct

Subtask #5
3.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Partially correct 1 ms 4444 KB Partially correct
3 Correct 1 ms 4444 KB Output is correct

Subtask #6
3.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 64 ms 10968 KB Partially correct
2 Partially correct 62 ms 10956 KB Partially correct
3 Correct 64 ms 10952 KB Output is correct

Subtask #7
3.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 100 ms 13116 KB Partially correct
2 Partially correct 99 ms 13512 KB Partially correct
3 Correct 102 ms 14148 KB Output is correct

Subtask #8
3.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 292 ms 19172 KB Output is correct
2 Partially correct 287 ms 18996 KB Partially correct
3 Correct 264 ms 18948 KB Output is correct

Subtask #9
3.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 363 ms 21152 KB Output is correct
2 Partially correct 330 ms 21436 KB Partially correct
3 Correct 332 ms 20820 KB Output is correct