oj.uz

Submission #305234

# Submission time Handle Problem Language Result Execution time Memory
305234 2020-09-22T18:56:02 Z Vimmer Carnival Tickets (IOI20_tickets) C++14
100 / 100
 1166 ms 62500 KB 
#include <bits/stdc++.h>
#include "tickets.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

#define N 1005
#define PB push_back
#define sz(x) int(x.size())
#define P 31
#define F first
#define M ll(1e9 + 7)
#define S second
#define all(x) x.begin(), x.end()
#define endl '\n'

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

using namespace std;
//using namespace __gnu_pbds;

typedef long long ll;

//typedef tree<int, null_type, less_equal <int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

ll mlt(ll a, ll b) {return (a * b) % M;}
ll sm(ll a, ll b) {return (a + b) % M;}

ll find_maximum(int k, vector<vector<int> > x)
{
    int n = sz(x);

    int m = sz(x[0]);

    vector <vector <int> > r;

    r.resize(n);

    int lft[n];

    memset(lft, 0, sizeof(lft));

    for (int i = 0; i < n; i++)
        r[i].resize(m, -1);


    ll ans = 0;

    vector <array <int, 2> > gr; gr.clear();

    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < k; j++) ans -= x[i][j];

        for (int j = 0; j < k; j++) gr.PB({x[i][k - j - 1] + x[i][m - j - 1], i});
    }

    sort(all(gr));

    reverse(all(gr));

    int kol[n];

    memset(kol, 0, sizeof(kol));

    for (int i = 0; i < n * k / 2; i++)
    {
        ans += gr[i][0];

        kol[gr[i][1]]++;
    }

    for (int j = 0; j < k; j++)
    {
        vector <pair <int, int> > pr; pr.clear();

        for (int i = 0; i < n; i++) pr.PB({kol[i], i});

        sort(all(pr));

        reverse(all(pr));

        for (int i = 0; i < n / 2; i++)
        {
            kol[pr[i].S]--;

            r[pr[i].S][m - kol[pr[i].S] - 1] = j;
        }

        for (int i = n / 2; i < n; i++) r[pr[i].S][lft[pr[i].S]++] = j;
    }
    allocate_tickets(r);

    return ans;
}

//int main()
//{
//    cout << find_maximum(4, {{2, 2, 2, 2}, {0, 3, 3, 3}, {0, 3, 3, 3}, {0, 3, 3, 3}}) << endl;
//}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 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 1 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 38 ms 2424 KB Output is correct
6 Correct 763 ms 51448 KB Output is correct

Subtask #3
14.0 / 14.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 3 ms 512 KB Output is correct
5 Correct 28 ms 2424 KB Output is correct
6 Correct 899 ms 53460 KB Output is correct
7 Correct 798 ms 56344 KB Output is correct
8 Correct 4 ms 640 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 8 ms 904 KB Output is correct
13 Correct 26 ms 2296 KB Output is correct
14 Correct 27 ms 2300 KB Output is correct
15 Correct 827 ms 58748 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 44 ms 2804 KB Output is correct
6 Correct 7 ms 768 KB Output is correct
7 Correct 9 ms 1024 KB Output is correct
8 Correct 1133 ms 62500 KB Output is correct
9 Correct 1089 ms 58264 KB Output is correct
10 Correct 1079 ms 58328 KB Output is correct
11 Correct 1139 ms 62376 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 3 ms 512 KB Output is correct
3 Correct 3 ms 436 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 3 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 3 ms 512 KB Output is correct
3 Correct 3 ms 436 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 3 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 2424 KB Output is correct
14 Correct 33 ms 2428 KB Output is correct
15 Correct 37 ms 2448 KB Output is correct
16 Correct 45 ms 2804 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 36 ms 2684 KB Output is correct
21 Correct 38 ms 2544 KB Output is correct
22 Correct 39 ms 2672 KB Output is correct
23 Correct 42 ms 2668 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 768 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 1 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 38 ms 2424 KB Output is correct
12 Correct 763 ms 51448 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 3 ms 512 KB Output is correct
17 Correct 28 ms 2424 KB Output is correct
18 Correct 899 ms 53460 KB Output is correct
19 Correct 798 ms 56344 KB Output is correct
20 Correct 4 ms 640 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 0 ms 256 KB Output is correct
24 Correct 8 ms 904 KB Output is correct
25 Correct 26 ms 2296 KB Output is correct
26 Correct 27 ms 2300 KB Output is correct
27 Correct 827 ms 58748 KB Output is correct
28 Correct 1 ms 256 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 3 ms 512 KB Output is correct
32 Correct 44 ms 2804 KB Output is correct
33 Correct 7 ms 768 KB Output is correct
34 Correct 9 ms 1024 KB Output is correct
35 Correct 1133 ms 62500 KB Output is correct
36 Correct 1089 ms 58264 KB Output is correct
37 Correct 1079 ms 58328 KB Output is correct
38 Correct 1139 ms 62376 KB Output is correct
39 Correct 0 ms 256 KB Output is correct
40 Correct 3 ms 512 KB Output is correct
41 Correct 3 ms 436 KB Output is correct
42 Correct 4 ms 512 KB Output is correct
43 Correct 3 ms 512 KB Output is correct
44 Correct 3 ms 512 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 3 ms 512 KB Output is correct
48 Correct 3 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 2424 KB Output is correct
52 Correct 33 ms 2428 KB Output is correct
53 Correct 37 ms 2448 KB Output is correct
54 Correct 45 ms 2804 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 36 ms 2684 KB Output is correct
59 Correct 38 ms 2544 KB Output is correct
60 Correct 39 ms 2672 KB Output is correct
61 Correct 42 ms 2668 KB Output is correct
62 Correct 85 ms 6172 KB Output is correct
63 Correct 89 ms 6136 KB Output is correct
64 Correct 120 ms 7272 KB Output is correct
65 Correct 405 ms 24032 KB Output is correct
66 Correct 482 ms 27860 KB Output is correct
67 Correct 9 ms 1024 KB Output is correct
68 Correct 7 ms 768 KB Output is correct
69 Correct 743 ms 51576 KB Output is correct
70 Correct 927 ms 53464 KB Output is correct
71 Correct 1166 ms 62404 KB Output is correct
72 Correct 1012 ms 59520 KB Output is correct
73 Correct 1081 ms 59072 KB Output is correct
74 Correct 832 ms 52556 KB Output is correct
75 Correct 952 ms 52260 KB Output is correct