oj.uz

Submission #478998

# Submission time Handle Problem Language Result Execution time Memory
478998 2021-10-09T10:51:48 Z khoabright Carnival Tickets (IOI20_tickets) C++17
100 / 100
 868 ms 98048 KB 
#include <bits/stdc++.h>
using namespace std;

//#define int long long 
#define ff first
#define ss second
#define pii pair<int, int>
#define all(x) x.begin(), x.end()
#define rep(i, a, b) for (int i = (int)a; i <= (int)b; ++i)
#define rep1(i, a, b) for (int i = (int)a; i >= (int)b; --i)
#define mp make_pair
#define vii vector<vector<int>>
#define ll long long 

const int N = 2e5 + 5;  
const ll inf = 2e9 + 5;

void allocate_tickets(vii a);
// void allocate_tickets(vii a) {
//     int n = a.size(), m = a[0].size();
//     rep(i, 0, n - 1) {
//         rep(j, 0, m - 1) {
//             cout << a[i][j] << ' ';
//         }
//         cout << '\n';
//     }
// }

struct ticket{
    int color, order, value;
};

bool operator < (const ticket &x, const ticket &y) {
    if (x.value == y.value) {
        return mp(x.color, x.order) < mp(y.color, y.order);
    }
    return x.value < y.value;
}  

ll find_maximum(int k, vii a) {
    function<int()> sub1 = [&]() {
        int n = a.size();
        vector<int> v(n);
        rep(i, 0, n - 1) v[i] = a[i][0];
        sort(all(v));
        int bound = v[n / 2];
        int prize = 0;
        rep(i, 0, n - 1) prize += abs(v[i] - bound);
        rep(i, 0, n - 1) a[i][0] = 0;
        allocate_tickets(a);
        return prize;
    };

    function<ll()> sub2 = [&]() {
        int n = a.size(), m = a[0].size();
        vii allo(n, vector<int> (m));
        
        ll prize = 0;
        vector<ticket> Replace;
        vector<int> Plus(n + 1, k);

        rep(i, 0, n - 1) {
            rep1(j, m - 1, m - k) {
                prize += a[i][j];
                allo[i][j] = 1;
            }

            rep(j, 0, k - 1) {
                ticket tmp;
                tmp.color = i;
                tmp.order = j;
                tmp.value = a[i][j] + a[i][m - k + j];
                Replace.push_back(tmp);
            }
        }

        sort(all(Replace));
        
        //cout<<"prize,m="<<prize<<' '<<m<<'\n';
        rep(i, 1, k * (n / 2)) {
            auto [color, order, value] = Replace[i - 1];
            //cout<<"123="<<color<<' '<<order<<' '<<value<<'\n';
            prize -= value;

            --Plus[color];            
            allo[color][m - k + order] = 0;
            allo[color][order] = -1;
        }

        vector<int> v(n);
        rep(i, 0, n - 1) v[i] = i;

        sort(all(v), [&](int x, int y) {
            return Plus[x] < Plus[y];
        });


        vector<int> cnt(k);
        // cout<<'\n';
        // rep(i, 0, n - 1) {
        //     rep(j, 0, m - 1) {
        //         cout << allo[i][j] << ' ';
        //     }
        //     cout << '\n';
        // }
        // cout<<'\n';

        int start = -1;
        rep(ii, 0, n - 1) {
            int i = v[ii];
            while (start < k && cnt[start] >= n / 2) {++start;}
            //cout<<"i,start="<<i<<' '<<start<<'\n';

            vector<bool> used(m);

            rep(j, 0, m - 1) {
                if (allo[i][j] != -1) break;
                start = (start + 1) % k;
                allo[i][j] = start + 1;
                used[start] = 1;
            }

            int fin = 0;
            rep1(j, m - 1, 0) {
                if (allo[i][j] != 1) break;
                while (fin < k && used[fin]) ++ fin;
                if (fin >= k) break;
                allo[i][j] = fin + 1;
                ++fin;
            }
        }
        

        rep(i, 0, n - 1) rep(j, 0, m - 1) --allo[i][j];
    
        allocate_tickets(allo);
        return prize;
    };

    return sub2();
}

// signed main() {
//     //freopen("ticket.inp", "r", stdin);
//     int n, m, k; cin >> n >> m >> k;
//     vii a(n, vector<int> (m));
//     rep(i, 0, n - 1) rep(j, 0, m - 1) cin >> a[i][j];   
//     cout << find_maximum(k, a);
// }

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 716 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 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 23 ms 2296 KB Output is correct
6 Correct 556 ms 51312 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 0 ms 204 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 24 ms 2728 KB Output is correct
6 Correct 640 ms 62204 KB Output is correct
7 Correct 631 ms 66556 KB Output is correct
8 Correct 3 ms 720 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 6 ms 860 KB Output is correct
13 Correct 20 ms 2508 KB Output is correct
14 Correct 21 ms 2568 KB Output is correct
15 Correct 672 ms 70324 KB Output is correct

Subtask #4
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 0 ms 204 KB Output is correct
4 Correct 3 ms 592 KB Output is correct
5 Correct 34 ms 4036 KB Output is correct
6 Correct 6 ms 920 KB Output is correct
7 Correct 6 ms 1168 KB Output is correct
8 Correct 843 ms 98012 KB Output is correct
9 Correct 828 ms 94848 KB Output is correct
10 Correct 803 ms 94884 KB Output is correct
11 Correct 814 ms 98048 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 432 KB Output is correct
5 Correct 2 ms 436 KB Output is correct
6 Correct 3 ms 588 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 3 ms 452 KB Output is correct
10 Correct 2 ms 464 KB Output is correct
11 Correct 3 ms 464 KB Output is correct
12 Correct 3 ms 592 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 432 KB Output is correct
5 Correct 2 ms 436 KB Output is correct
6 Correct 3 ms 588 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 3 ms 452 KB Output is correct
10 Correct 2 ms 464 KB Output is correct
11 Correct 3 ms 464 KB Output is correct
12 Correct 3 ms 592 KB Output is correct
13 Correct 23 ms 3236 KB Output is correct
14 Correct 25 ms 3224 KB Output is correct
15 Correct 29 ms 3400 KB Output is correct
16 Correct 34 ms 4028 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 4 ms 464 KB Output is correct
19 Correct 2 ms 336 KB Output is correct
20 Correct 27 ms 3000 KB Output is correct
21 Correct 31 ms 3516 KB Output is correct
22 Correct 29 ms 3272 KB Output is correct
23 Correct 33 ms 3848 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 0 ms 204 KB Output is correct
3 Correct 1 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 716 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 23 ms 2296 KB Output is correct
12 Correct 556 ms 51312 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 2 ms 460 KB Output is correct
17 Correct 24 ms 2728 KB Output is correct
18 Correct 640 ms 62204 KB Output is correct
19 Correct 631 ms 66556 KB Output is correct
20 Correct 3 ms 720 KB Output is correct
21 Correct 1 ms 208 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 1 ms 208 KB Output is correct
24 Correct 6 ms 860 KB Output is correct
25 Correct 20 ms 2508 KB Output is correct
26 Correct 21 ms 2568 KB Output is correct
27 Correct 672 ms 70324 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 3 ms 592 KB Output is correct
32 Correct 34 ms 4036 KB Output is correct
33 Correct 6 ms 920 KB Output is correct
34 Correct 6 ms 1168 KB Output is correct
35 Correct 843 ms 98012 KB Output is correct
36 Correct 828 ms 94848 KB Output is correct
37 Correct 803 ms 94884 KB Output is correct
38 Correct 814 ms 98048 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 2 ms 332 KB Output is correct
41 Correct 2 ms 332 KB Output is correct
42 Correct 2 ms 432 KB Output is correct
43 Correct 2 ms 436 KB Output is correct
44 Correct 3 ms 588 KB Output is correct
45 Correct 1 ms 208 KB Output is correct
46 Correct 1 ms 300 KB Output is correct
47 Correct 3 ms 452 KB Output is correct
48 Correct 2 ms 464 KB Output is correct
49 Correct 3 ms 464 KB Output is correct
50 Correct 3 ms 592 KB Output is correct
51 Correct 23 ms 3236 KB Output is correct
52 Correct 25 ms 3224 KB Output is correct
53 Correct 29 ms 3400 KB Output is correct
54 Correct 34 ms 4028 KB Output is correct
55 Correct 1 ms 336 KB Output is correct
56 Correct 4 ms 464 KB Output is correct
57 Correct 2 ms 336 KB Output is correct
58 Correct 27 ms 3000 KB Output is correct
59 Correct 31 ms 3516 KB Output is correct
60 Correct 29 ms 3272 KB Output is correct
61 Correct 33 ms 3848 KB Output is correct
62 Correct 61 ms 8400 KB Output is correct
63 Correct 63 ms 8392 KB Output is correct
64 Correct 88 ms 10572 KB Output is correct
65 Correct 314 ms 35496 KB Output is correct
66 Correct 372 ms 41384 KB Output is correct
67 Correct 6 ms 1040 KB Output is correct
68 Correct 5 ms 920 KB Output is correct
69 Correct 564 ms 73352 KB Output is correct
70 Correct 700 ms 79576 KB Output is correct
71 Correct 868 ms 98024 KB Output is correct
72 Correct 816 ms 83756 KB Output is correct
73 Correct 819 ms 88092 KB Output is correct
74 Correct 649 ms 65536 KB Output is correct
75 Correct 686 ms 77828 KB Output is correct