oj.uz

Submission #418891

# Submission time Handle Problem Language Result Execution time Memory
418891 2021-06-06T07:32:53 Z usachevd0 Carnival Tickets (IOI20_tickets) C++17
100 / 100
 1299 ms 129508 KB 
#include <bits/stdc++.h>
#ifndef LOCAL
    #include "tickets.h"
#endif

using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define Time (clock() * 1.0 / CLOCKS_PER_SEC)
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
using ld = long double;
template<typename T1, typename T2> bool chkmin(T1& x, T2 y) {
    return y < x ? (x = y, true) : false;
}
template<typename T1, typename T2> bool chkmax(T1& x, T2 y) {
    return y > x ? (x = y, true) : false;
}
void debug_out() {
    cerr << endl;
}
template<typename T1, typename... T2> void debug_out(T1 A, T2... B) {
    cerr << ' ' << A;
    debug_out(B...);
}
template<typename T> void mdebug_out(T* a, int n) {
    for (int i = 0; i < n; ++i)
        cerr << a[i] << ' ';
    cerr << endl;
}
#ifdef LOCAL
    #define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
    #define mdebug(a, n) cerr << #a << ": ", mdebug_out(a, n)
#else
    #define debug(...) 1337
    #define mdebug(a, n) 1337
#endif
template<typename T> ostream& operator << (ostream& stream, const vector<T>& v) {
    for (auto& e : v)
        stream << e << ' ';
    return stream;
}
template<typename T1, typename T2> ostream& operator << (ostream& stream, const pair<T1, T2>& p) {
    return stream << p.first << ' ' << p.second;
}


const ll INF64 = 1e18;
const int maxN = 1503;


void allocate_tickets(vector<vector<int>> cert);
ll find_maximum(int k, vector<vector<int>> X) {
    int n = X.size(), m = X[0].size();
    vector<pii> vals[n];
    vector<ll> pref[n], suff[n];
    vector<ll> f[n];
    for (int i = 0; i < n; ++i) {
        vals[i].resize(m);
        for (int j = 0; j < m; ++j)
            vals[i][j] = {X[i][j], j};
        sort(all(vals[i]));
        pref[i].assign(m + 1, 0);
        for (int j = 0; j < m; ++j)
            pref[i][j + 1] = pref[i][j] + vals[i][j].fi;
        suff[i].assign(m + 1, 0);
        for (int j = m - 1; j >= 0; --j)
            suff[i][j] = suff[i][j + 1] + vals[i][j].fi;
        f[i].resize(k + 1);
        for (int l = 0; l <= k; ++l)
            f[i][l] = suff[i][m - (k - l)] - pref[i][l];
    }
    
    vector<int> L(n, 0);
    multiset<pli> q;
    ll ans = 0;
    for (int i = 0; i < n; ++i) {
        ans += f[i][0];
        q.insert({f[i][0] - f[i][1], i});
    }
    for (int t = 0; t < n / 2 * k; ++t) {
        int i = q.begin()->se;
        q.erase(q.begin());
        ans += f[i][L[i] + 1] - f[i][L[i]];
        ++L[i];
        if (L[i] < k)
            q.insert({f[i][L[i]] - f[i][L[i] + 1], i});
    }
    
    vector<int> S(n);
    for (int i = 0; i < n; ++i)
        S[i] = k - L[i];
    vector<vector<int>> cert(n, vector<int>(m, -1));
    multiset<pii> pq;
    for (int i = 0; i < n; ++i)
        pq.insert({-L[i], i});
    for (int d = 0; d < k; ++d) {
        vector<int> small(n, 0);
        for (int t = 0; t < n / 2; ++t) {
            int i = pq.begin()->se;
            pq.erase(pq.begin());
            small[i] = 1;
        }
        for (int i = 0; i < n; ++i)
            if (small[i]) {
                int j = vals[i][--L[i]].se;
                cert[i][j] = d;
                pq.insert({-L[i], i});
            } else {
                int j = vals[i][m - S[i]].se;
                --S[i];
                cert[i][j] = d;
            }
    }
    allocate_tickets(cert);
    return ans;
}


#ifdef LOCAL

static int n;
static int m;
static int k;
static std::vector<std::vector<int>> d;
static std::vector<std::vector<int>> x;
static int called = 0;

static void check(bool cond, std::string message) {
    if (!cond) {
        printf("%s\n", message.c_str());
        exit(0);
    }
}


void allocate_tickets( std::vector<std::vector<int>> _d) {
    check(!called, "allocate_tickets called more than once");
    d = _d;
    check((int)d.size() == n, "allocate_tickets called with parameter of wrong size");
    for (int i = 0; i < n; i++) {
        check((int)d[i].size() == m, "allocate_tickets called with parameter of wrong size");
    }
    called = 1;
}

int main() {
    freopen("in", "r", stdin);
    
    assert(scanf("%d %d %d", &n, &m, &k) == 3);
    x.resize(n);
    for (int i = 0; i < n; i++) {
        x[i].resize(m);
        for (int j=0; j < m; j++) {
            assert(scanf("%d", &x[i][j]) == 1);
        }
    }
    fclose(stdin);

    long long answer = find_maximum(k, x);
    check(called, "failure to call allocate_tickets");
    printf("%lld\n", answer);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (j) printf(" ");
            printf("%d", d[i][j]);
        }
        printf("\n");
    }
    fclose(stdout);
    return 0;
}


// int32_t main() {
//     #ifdef LOCAL
//         freopen("in", "r", stdin);
//     #endif
//     ios::sync_with_stdio(0);
//     cin.tie(0);
    
    
    
    
//     return 0;
// }
#endif

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 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 3 ms 1100 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 3 ms 588 KB Output is correct
5 Correct 31 ms 5360 KB Output is correct
6 Correct 759 ms 109116 KB Output is correct

Subtask #3
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 588 KB Output is correct
5 Correct 32 ms 5028 KB Output is correct
6 Correct 815 ms 118676 KB Output is correct
7 Correct 911 ms 122112 KB Output is correct
8 Correct 6 ms 844 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 9 ms 1484 KB Output is correct
13 Correct 27 ms 4480 KB Output is correct
14 Correct 28 ms 4332 KB Output is correct
15 Correct 912 ms 124984 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 588 KB Output is correct
5 Correct 45 ms 5292 KB Output is correct
6 Correct 7 ms 1228 KB Output is correct
7 Correct 10 ms 1740 KB Output is correct
8 Correct 1250 ms 127320 KB Output is correct
9 Correct 1175 ms 119592 KB Output is correct
10 Correct 1175 ms 119584 KB Output is correct
11 Correct 1284 ms 127332 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 3 ms 588 KB Output is correct
3 Correct 3 ms 588 KB Output is correct
4 Correct 3 ms 588 KB Output is correct
5 Correct 3 ms 588 KB Output is correct
6 Correct 3 ms 588 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 588 KB Output is correct
10 Correct 3 ms 588 KB Output is correct
11 Correct 4 ms 588 KB Output is correct
12 Correct 3 ms 588 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 3 ms 588 KB Output is correct
3 Correct 3 ms 588 KB Output is correct
4 Correct 3 ms 588 KB Output is correct
5 Correct 3 ms 588 KB Output is correct
6 Correct 3 ms 588 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 588 KB Output is correct
10 Correct 3 ms 588 KB Output is correct
11 Correct 4 ms 588 KB Output is correct
12 Correct 3 ms 588 KB Output is correct
13 Correct 29 ms 4548 KB Output is correct
14 Correct 36 ms 4520 KB Output is correct
15 Correct 36 ms 4872 KB Output is correct
16 Correct 46 ms 5188 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 3 ms 716 KB Output is correct
19 Correct 2 ms 556 KB Output is correct
20 Correct 36 ms 5120 KB Output is correct
21 Correct 39 ms 5732 KB Output is correct
22 Correct 40 ms 5332 KB Output is correct
23 Correct 41 ms 5844 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 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 3 ms 1100 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 3 ms 588 KB Output is correct
11 Correct 31 ms 5360 KB Output is correct
12 Correct 759 ms 109116 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 3 ms 588 KB Output is correct
17 Correct 32 ms 5028 KB Output is correct
18 Correct 815 ms 118676 KB Output is correct
19 Correct 911 ms 122112 KB Output is correct
20 Correct 6 ms 844 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 9 ms 1484 KB Output is correct
25 Correct 27 ms 4480 KB Output is correct
26 Correct 28 ms 4332 KB Output is correct
27 Correct 912 ms 124984 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 588 KB Output is correct
32 Correct 45 ms 5292 KB Output is correct
33 Correct 7 ms 1228 KB Output is correct
34 Correct 10 ms 1740 KB Output is correct
35 Correct 1250 ms 127320 KB Output is correct
36 Correct 1175 ms 119592 KB Output is correct
37 Correct 1175 ms 119584 KB Output is correct
38 Correct 1284 ms 127332 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 3 ms 588 KB Output is correct
41 Correct 3 ms 588 KB Output is correct
42 Correct 3 ms 588 KB Output is correct
43 Correct 3 ms 588 KB Output is correct
44 Correct 3 ms 588 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 588 KB Output is correct
48 Correct 3 ms 588 KB Output is correct
49 Correct 4 ms 588 KB Output is correct
50 Correct 3 ms 588 KB Output is correct
51 Correct 29 ms 4548 KB Output is correct
52 Correct 36 ms 4520 KB Output is correct
53 Correct 36 ms 4872 KB Output is correct
54 Correct 46 ms 5188 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 3 ms 716 KB Output is correct
57 Correct 2 ms 556 KB Output is correct
58 Correct 36 ms 5120 KB Output is correct
59 Correct 39 ms 5732 KB Output is correct
60 Correct 40 ms 5332 KB Output is correct
61 Correct 41 ms 5844 KB Output is correct
62 Correct 88 ms 14404 KB Output is correct
63 Correct 79 ms 14572 KB Output is correct
64 Correct 123 ms 16580 KB Output is correct
65 Correct 430 ms 60864 KB Output is correct
66 Correct 595 ms 65216 KB Output is correct
67 Correct 10 ms 1868 KB Output is correct
68 Correct 7 ms 1252 KB Output is correct
69 Correct 739 ms 109236 KB Output is correct
70 Correct 959 ms 118816 KB Output is correct
71 Correct 1299 ms 129508 KB Output is correct
72 Correct 1072 ms 128360 KB Output is correct
73 Correct 1197 ms 123840 KB Output is correct
74 Correct 881 ms 119880 KB Output is correct
75 Correct 1029 ms 115628 KB Output is correct