oj.uz

Submission #300173

# Submission time Handle Problem Language Result Execution time Memory
300173 2020-09-16T22:08:22 Z model_code Carnival Tickets (IOI20_tickets) C++17
100 / 100
 1199 ms 63212 KB 
// sy-full
#include "tickets.h"
#include <vector>
#include <algorithm>
#include <queue>

using namespace std;

typedef long long int lli;
typedef pair<lli, lli> pii;

long long find_maximum(int k, vector<vector<int>> d) {
    // Number of companies
    int c = d.size();
    // tickets per company
	int s = d[0].size();

    // Sort each company's tickets by their distance
    // o[company][place] => index of ship which is <place>th from left
    vector<vector<int>> o;
    o.resize(c);
    for (int i = 0; i < c; i++) {
        o[i].resize(s);
        for (int j = 0; j < s; j++) {
            o[i][j] = j;
        }
        sort(o[i].begin(), o[i].end(), [&](const int &a, const int &b) {
            return d[i][a] < d[i][b];
        });
    }

    // d_o(company, place) => distance of ship which is <place>th form left
    auto d_o = [&](const int &a, const int &b) {
        return d[a][o[a][b]];
    };

    // gain: (change to cost by turning a - into a +, company index)
    priority_queue<pii> gain;

    // Total cost of the arrangement
    lli cost = 0;

    // plus_count[company] => How many +s the company will send
    vector<int> plus_count;
    plus_count.resize(c, 0);

    for (int i = 0; i < c; i++) {
        for (int j = 0; j < k; j++) {
            // First incur cost of all -s
            cost -= d_o(i, j);
        }
        // Queue a possible - to +
        gain.push(
            pii(
                d_o(i, s - 1 - plus_count[i])
                + d_o(i, k - 1 - plus_count[i]),
                i
            )
        );
    }

    // Take ck/2 +s
    for (int i = 0; i < c * k / 2; i++) {
        pii top = gain.top(); gain.pop();
        cost += top.first;

        // If the company hasnt reached k +s, queue another possible +
        int this_company = top.second;
        plus_count[this_company]++;
        if (plus_count[this_company] < k) {
            gain.push(
                pii(
                    d_o(this_company, s - 1 - plus_count[this_company])
                    + d_o(this_company, k - 1 - plus_count[this_company]),
                    this_company
                )
            );
        }
    }

    // Empty out the priority queue, will use again later
    while (!gain.empty()) gain.pop();

    // gain: (+s remaining, company index)
    for (int i = 0; i < c; i++) {
        gain.push(pii(plus_count[i], i));
    }

    // minus_count[company] => How many -s the company has sent so far
    vector<int> minus_count;
    minus_count.resize(c, 0);

    // Prepare answer vector dimensions and fill with -1s
    vector<vector<int>> answer;
    answer.resize(c);
    for (int i = 0; i < c; i++) {
        answer[i].resize(s, -1);
    }

    // take[company] => Does this company send a + in this days
    vector<int> take;
    take.resize(c, 0);

    // Simulate k days of tickets
    for (int i = 0; i < k; i++) {
        // Pick c/2 companies with the most +s left
        for (int j = 0; j < c / 2; j ++) {
            take[gain.top().second] = 1;
            gain.pop();
        }

        // Check if each company sent a - or +, and change answer accordingly
        for (int j = 0; j < c; j++) {
            if (take[j]) {
                // Company j sent a + this round, send the smallest +
                // Queue the company back
                answer[j][o[j][s - plus_count[j]]] = i;
                plus_count[j]--;
                gain.push(pii(plus_count[j], j));
            } else {
                // Company j sent a - this round, send the smallest -
                answer[j][o[j][minus_count[j]]] = i;
                minus_count[j]++;
            }
            take[j] = 0;
        }
    }

    // Return to grader
    allocate_tickets(answer);
    return cost;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 3 ms 768 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 32 ms 2816 KB Output is correct
6 Correct 801 ms 60352 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 29 ms 2808 KB Output is correct
6 Correct 762 ms 61256 KB Output is correct
7 Correct 853 ms 61668 KB Output is correct
8 Correct 5 ms 640 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 8 ms 896 KB Output is correct
13 Correct 25 ms 2428 KB Output is correct
14 Correct 25 ms 2432 KB Output is correct
15 Correct 864 ms 62204 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 42 ms 2808 KB Output is correct
6 Correct 9 ms 768 KB Output is correct
7 Correct 10 ms 1024 KB Output is correct
8 Correct 1198 ms 63116 KB Output is correct
9 Correct 1099 ms 58904 KB Output is correct
10 Correct 1145 ms 58944 KB Output is correct
11 Correct 1199 ms 63212 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 4 ms 512 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 4 ms 512 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 3 ms 512 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 4 ms 512 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 4 ms 512 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 31 ms 2816 KB Output is correct
14 Correct 40 ms 2816 KB Output is correct
15 Correct 35 ms 2808 KB Output is correct
16 Correct 40 ms 2808 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 3 ms 512 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 44 ms 2680 KB Output is correct
21 Correct 36 ms 2684 KB Output is correct
22 Correct 36 ms 2748 KB Output is correct
23 Correct 38 ms 2764 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 3 ms 768 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 4 ms 512 KB Output is correct
11 Correct 32 ms 2816 KB Output is correct
12 Correct 801 ms 60352 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 29 ms 2808 KB Output is correct
18 Correct 762 ms 61256 KB Output is correct
19 Correct 853 ms 61668 KB Output is correct
20 Correct 5 ms 640 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 0 ms 256 KB Output is correct
23 Correct 1 ms 256 KB Output is correct
24 Correct 8 ms 896 KB Output is correct
25 Correct 25 ms 2428 KB Output is correct
26 Correct 25 ms 2432 KB Output is correct
27 Correct 864 ms 62204 KB Output is correct
28 Correct 0 ms 256 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 4 ms 512 KB Output is correct
32 Correct 42 ms 2808 KB Output is correct
33 Correct 9 ms 768 KB Output is correct
34 Correct 10 ms 1024 KB Output is correct
35 Correct 1198 ms 63116 KB Output is correct
36 Correct 1099 ms 58904 KB Output is correct
37 Correct 1145 ms 58944 KB Output is correct
38 Correct 1199 ms 63212 KB Output is correct
39 Correct 0 ms 256 KB Output is correct
40 Correct 4 ms 512 KB Output is correct
41 Correct 3 ms 512 KB Output is correct
42 Correct 3 ms 512 KB Output is correct
43 Correct 4 ms 512 KB Output is correct
44 Correct 3 ms 512 KB Output is correct
45 Correct 1 ms 256 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 4 ms 512 KB Output is correct
48 Correct 5 ms 512 KB Output is correct
49 Correct 3 ms 512 KB Output is correct
50 Correct 3 ms 512 KB Output is correct
51 Correct 31 ms 2816 KB Output is correct
52 Correct 40 ms 2816 KB Output is correct
53 Correct 35 ms 2808 KB Output is correct
54 Correct 40 ms 2808 KB Output is correct
55 Correct 1 ms 384 KB Output is correct
56 Correct 3 ms 512 KB Output is correct
57 Correct 2 ms 384 KB Output is correct
58 Correct 44 ms 2680 KB Output is correct
59 Correct 36 ms 2684 KB Output is correct
60 Correct 36 ms 2748 KB Output is correct
61 Correct 38 ms 2764 KB Output is correct
62 Correct 91 ms 7032 KB Output is correct
63 Correct 94 ms 7072 KB Output is correct
64 Correct 133 ms 7288 KB Output is correct
65 Correct 444 ms 27588 KB Output is correct
66 Correct 525 ms 27900 KB Output is correct
67 Correct 13 ms 1024 KB Output is correct
68 Correct 6 ms 768 KB Output is correct
69 Correct 780 ms 60324 KB Output is correct
70 Correct 993 ms 61232 KB Output is correct
71 Correct 1167 ms 63192 KB Output is correct
72 Correct 920 ms 60800 KB Output is correct
73 Correct 1124 ms 60920 KB Output is correct
74 Correct 822 ms 59336 KB Output is correct
75 Correct 1034 ms 59352 KB Output is correct