oj.uz

Submission #422104

# Submission time Handle Problem Language Result Execution time Memory
422104 2021-06-09T17:42:11 Z idk321 Carnival Tickets (IOI20_tickets) C++17
100 / 100
 1285 ms 77028 KB 
#include "tickets.h"
#include <vector>

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const ll INF = 1000000000000000000LL;

struct Comp
{
    bool operator() (const array<int, 4>& ar1, const array<int, 4>& ar2) const
    {
        return ar1[3] < ar2[3];
    }
};

long long find_maximum(int k, std::vector<std::vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	vector<vector<int>> answer;
    answer.resize(n, vector<int>(m, -1));



    priority_queue<array<int, 4>, vector<array<int, 4>>, Comp> pq;
    vector<vector<int>> type(n, vector<int>(m));
    ll res = 0;
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < k; j++)
        {
            res -= x[i][j];
            type[i][j] = -1;
        }
        ll sum = 0;

        pq.push({k - 1, m - 1, i, x[i][k - 1] + x[i][m - 1]});
    }

    for (int i = 0; i < n * k / 2; i++)
    {
        auto cur = pq.top();
        pq.pop();
        res += cur[3];
        type[cur[2]][cur[0]] = 0;
        type[cur[2]][cur[1]] = 1;
        if (cur[0] != 0 && type[cur[2]][cur[0] - 1] == -1)
        {
            pq.push({cur[0] - 1, cur[1] - 1, cur[2], x[cur[2]][cur[1] - 1] + x[cur[2]][cur[0] - 1]});
        }
    }

    vector<vector<int>> small(n);
    vector<vector<int>> big(n);
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            if (type[i][j] == -1) small[i].push_back(j);
            if (type[i][j] == 1) big[i].push_back(j);
        }
    }


    ll sumSmall = 0;
    ll sumBig =0;
    for (int i = 0; i < n; i++)
    {
        sumSmall += small[i].size();
        sumBig += big[i].size();
    }


    for (int a = 0; a < k; a++)
    {
        vector<array<int, 3>> byFreq;
        for (int i = 0; i < n; i++)
        {
            byFreq.push_back({small[i].size(), big[i].size(), i});
        }
        sort(byFreq.rbegin(), byFreq.rend());
        for (int i = 0; i < n / 2; i++)
        {
            int y = byFreq[i][2];
            answer[y][small[y].back()] = a;
            small[y].pop_back();
        }
        for (int i = n / 2; i < n; i++)
        {
            int y = byFreq[i][2];

            answer[y][big[y].back()] = a;
            big[y].pop_back();
        }
    }

    allocate_tickets(answer);
	return res;
}

/*
5 3 1
1 8 1000
1 3 4
3 5 6
2 5 7
1 5 10
*/

Compilation message

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:36:12: warning: unused variable 'sum' [-Wunused-variable]
   36 |         ll sum = 0;
      |            ^~~
tickets.cpp:80:44: warning: narrowing conversion of '(& small.std::vector<std::vector<int> >::operator[](((std::vector<std::vector<int> >::size_type)i)))->std::vector<int>::size()' from 'std::vector<int>::size_type' {aka 'long unsigned int'} to 'int' [-Wnarrowing]
   80 |             byFreq.push_back({small[i].size(), big[i].size(), i});
      |                               ~~~~~~~~~~~~~^~
tickets.cpp:80:59: warning: narrowing conversion of '(& big.std::vector<std::vector<int> >::operator[](((std::vector<std::vector<int> >::size_type)i)))->std::vector<int>::size()' from 'std::vector<int>::size_type' {aka 'long unsigned int'} to 'int' [-Wnarrowing]
   80 |             byFreq.push_back({small[i].size(), big[i].size(), i});
      |                                                ~~~~~~~~~~~^~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 844 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 26 ms 2748 KB Output is correct
6 Correct 655 ms 60544 KB Output is correct

Subtask #3
14.0 / 14.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 1 ms 204 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 29 ms 3148 KB Output is correct
6 Correct 760 ms 67704 KB Output is correct
7 Correct 867 ms 70960 KB Output is correct
8 Correct 4 ms 588 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 8 ms 972 KB Output is correct
13 Correct 28 ms 2756 KB Output is correct
14 Correct 27 ms 2756 KB Output is correct
15 Correct 915 ms 74048 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 41 ms 3408 KB Output is correct
6 Correct 6 ms 716 KB Output is correct
7 Correct 9 ms 1100 KB Output is correct
8 Correct 1204 ms 75264 KB Output is correct
9 Correct 1057 ms 71144 KB Output is correct
10 Correct 1058 ms 70220 KB Output is correct
11 Correct 1132 ms 75212 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Correct 3 ms 460 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 3 ms 460 KB Output is correct
6 Correct 3 ms 460 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 3 ms 460 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 3 ms 460 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Correct 3 ms 460 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 3 ms 460 KB Output is correct
6 Correct 3 ms 460 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 3 ms 460 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 3 ms 460 KB Output is correct
13 Correct 26 ms 2716 KB Output is correct
14 Correct 27 ms 2704 KB Output is correct
15 Correct 33 ms 2960 KB Output is correct
16 Correct 42 ms 3396 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 3 ms 460 KB Output is correct
19 Correct 2 ms 452 KB Output is correct
20 Correct 31 ms 2948 KB Output is correct
21 Correct 34 ms 3116 KB Output is correct
22 Correct 35 ms 3268 KB Output is correct
23 Correct 42 ms 3224 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 844 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 2 ms 460 KB Output is correct
11 Correct 26 ms 2748 KB Output is correct
12 Correct 655 ms 60544 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 3 ms 460 KB Output is correct
17 Correct 29 ms 3148 KB Output is correct
18 Correct 760 ms 67704 KB Output is correct
19 Correct 867 ms 70960 KB Output is correct
20 Correct 4 ms 588 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 8 ms 972 KB Output is correct
25 Correct 28 ms 2756 KB Output is correct
26 Correct 27 ms 2756 KB Output is correct
27 Correct 915 ms 74048 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 3 ms 460 KB Output is correct
32 Correct 41 ms 3408 KB Output is correct
33 Correct 6 ms 716 KB Output is correct
34 Correct 9 ms 1100 KB Output is correct
35 Correct 1204 ms 75264 KB Output is correct
36 Correct 1057 ms 71144 KB Output is correct
37 Correct 1058 ms 70220 KB Output is correct
38 Correct 1132 ms 75212 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 2 ms 460 KB Output is correct
41 Correct 3 ms 460 KB Output is correct
42 Correct 3 ms 460 KB Output is correct
43 Correct 3 ms 460 KB Output is correct
44 Correct 3 ms 460 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 3 ms 460 KB Output is correct
48 Correct 3 ms 460 KB Output is correct
49 Correct 3 ms 460 KB Output is correct
50 Correct 3 ms 460 KB Output is correct
51 Correct 26 ms 2716 KB Output is correct
52 Correct 27 ms 2704 KB Output is correct
53 Correct 33 ms 2960 KB Output is correct
54 Correct 42 ms 3396 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 3 ms 460 KB Output is correct
57 Correct 2 ms 452 KB Output is correct
58 Correct 31 ms 2948 KB Output is correct
59 Correct 34 ms 3116 KB Output is correct
60 Correct 35 ms 3268 KB Output is correct
61 Correct 42 ms 3224 KB Output is correct
62 Correct 74 ms 8832 KB Output is correct
63 Correct 78 ms 8896 KB Output is correct
64 Correct 118 ms 10256 KB Output is correct
65 Correct 402 ms 33876 KB Output is correct
66 Correct 490 ms 36416 KB Output is correct
67 Correct 9 ms 1228 KB Output is correct
68 Correct 6 ms 844 KB Output is correct
69 Correct 649 ms 62180 KB Output is correct
70 Correct 923 ms 69108 KB Output is correct
71 Correct 1285 ms 77028 KB Output is correct
72 Correct 997 ms 75256 KB Output is correct
73 Correct 1077 ms 74464 KB Output is correct
74 Correct 771 ms 67900 KB Output is correct
75 Correct 884 ms 67032 KB Output is correct