oj.uz

Submission #576678

# Submission time Handle Problem Language Result Execution time Memory
576678 2022-06-13T09:11:36 Z MadokaMagicaFan Carnival Tickets (IOI20_tickets) C++14
100 / 100
 1036 ms 134856 KB 
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using pi = pair<int,int>;

const ll inf = 1e10;

#define all(v)          v.begin(),v.end()
#define sort(v)         sort(all(v))
#define endl            '\n'
#define forn(i,n)       for(int i = 0; i < n; ++i)
#define forbe(i,b,e)    for(int i = b; i < e; ++i)
#define forr(i,n)       for(int i = n-1; i >= 0; --i)
#define sz(v)           ((int)v.size())
#define pb              push_back
#define f               first
#define s               second

//#define ONTST

const int N = 1505;
const int M = 1505;

void allocate_tickets(vector<vi>s);


using pl = pair<ll,int>;

ll subtaskidk(int k, vector<vi> &x) {
    int n = sz(x);
    int m = sz(x[0]);
    vector<vi> s(n);
    vector<pair<ll,int>> vals;
    forn(i,n) s[i].assign(m,-1);
    vector<vector<pair<ll,int>>> sval(n);

    int topp[N];
    int botp[N];

    forn(i,n) {
        forn(j,m) {
            sval[i].pb({x[i][j], j});
        }
        sort(sval[i]);
    }

    bitset<N*M> c;
    bitset<N*M> z;

    forn(i,n) {
        if (i < (n>>1)) {
            topp[i] = m-1;
            botp[i] = k;
        } else {
            topp[i] = m-1-k;
            botp[i] = 0;
        }
    }

    priority_queue<pl> q1;
    priority_queue<pl, vector<pl>, greater<pl>> q2;
    
    forn(i,n) {
        if (botp[i])    q1.push({sval[i][ botp[i]-1 ].f + sval[i][ topp[i] ].f, i});
        else            q1.push({-inf,i});

        if (topp[i]<m-1)    q2.push({sval[i][ botp[i] ].f + sval[i][ topp[i]+1 ].f, i});
        else                q2.push({inf,i});
    }
    while (sz(q1)) {
        auto u1 = q1.top();
        auto u2 = q2.top();

        if (u1.f <= u2.f)
            break;
        
        --botp[u1.s];
        --topp[u1.s];
        ++botp[u2.s];
        ++topp[u2.s];
        q1.pop();
        q2.pop();

        int i = u1.s;
        if (botp[i])    q1.push({sval[i][ botp[i]-1 ].f + sval[i][ topp[i] ].f, i});
        else            q1.push({-inf,i});

        i = u2.s;
        if (topp[i]<m-1)    q2.push({sval[i][ botp[i] ].f + sval[i][ topp[i]+1 ].f, i});
        else                q2.push({inf,i});
    }

    ll ans = 0;
    forn(i ,n) {
        for(int j = m-1; j > topp[i]; --j) c[ i*m + sval[i][j].s ] = 1;
        for(int j = m-1; j > topp[i]; --j) ans += sval[i][j].f;
        for(int j = 0; j < botp[i]; ++j)  z[ i*m + sval[i][j].s ] = 1;
        for(int j = 0; j < botp[i]; ++j)  ans -= sval[i][j].f;
    }

    forn(i,n) {
        forn(j,m) {
            if (c[ i*m + j ]) {
                vals.pb({x[i][j] * 2 + 1,i * m + j});
            } else {
                vals.pb({x[i][j] * 2,i * m + j});
            }
        }
    }
    sort(vals);

    forn(i,n) {
        topp[i] = m-1;
        botp[i] = 0;
    }

    bitset<N> up;
    bitset<N> us;

    int cnt;
    int ucnt;
    int u = 0;
    int str = 0;
    int ind;

    queue<int> b[N];
    queue<int> t[N];

    int bcnt = 0;
    int rcnt = 0;
    while (u < k) {
        cnt = 0;
        ucnt = 0;
        rcnt = 0;
        forn(i,n) {
            up[i] = 0;
            us[i] = 0;
            if (sz(t[i])) {
                up[i] = 1;
                us[i] = 1;
                ++cnt;
                ++ucnt;
            } else if (sz(b[i])) {
                us[i] = 1;
                ++cnt;
            }
        }
        while (cnt < n || ucnt < (n>>1)) {
            ind = vals[str].s;
            ++str;
            if (c[ ind ]) {
                t[ind/m].push(ind);
                if (!up[ind/m])
                    ++ucnt;
                up[ind/m] = 1;
                if (!us[ind/m]) {
                    us[ind/m] = 1;
                    ++cnt;
                }
            }

            if (z[ ind ]) {
                ++bcnt;
                b[ind/m].push(ind);
                if (!us[ind/m]) {
                    us[ind/m] = 1;
                    ++cnt;
                }
            }
        }
        forn(i,n) {
            if (up[i] && (sz(b[i]) == 0)) {
                s[i][t[i].front()%m] = u;
                t[i].pop();
                ++rcnt;
                us[i] = 0;
            }
        }
        
        forn(i,n) {
            if (!us[i]) continue;
            if (up[i] && rcnt < (n>>1)) {
                s[i][t[i].front()%m] = u;
                t[i].pop();
                ++rcnt;
            } else {
                s[i][b[i].front()%m] = u;
                b[i].pop();
            }
        }

        ++u;
    }

    allocate_tickets(s);

    return ans;
}


ll find_maximum(int k, vector<vi>x) {
    return subtaskidk(k,x);
}

#ifdef ONPC
void allocate_tickets(vector<vi>s) {
    forn(i, sz(s)) {
        forn(j, sz(s[0])) {
            cout << s[i][j] << ' ';
        }
        cout << endl;
    }
}

void solve() {
    int n, m, k;
    cin >> n >> m >> k;
    vector<vi> x(n);
    forn(i,n) {
        x[i].assign(m,0);
    }

    forn(j,m) {
        forn(i,n) {
            cin >> x[i][j];
        }
    }

    cout << find_maximum(k, x) << endl;
}

int main() {
    freopen("input", "r", stdin);
//    ios_base::sync_with_stdio(0);cin.tie(0);
    solve();
}
#endif

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2772 KB Output is correct
2 Correct 2 ms 2772 KB Output is correct
3 Correct 2 ms 2772 KB Output is correct
4 Correct 2 ms 2900 KB Output is correct
5 Correct 2 ms 2900 KB Output is correct
6 Correct 3 ms 3412 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2772 KB Output is correct
2 Correct 2 ms 2772 KB Output is correct
3 Correct 2 ms 2772 KB Output is correct
4 Correct 4 ms 3284 KB Output is correct
5 Correct 30 ms 8516 KB Output is correct
6 Correct 754 ms 134740 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2772 KB Output is correct
2 Correct 2 ms 2772 KB Output is correct
3 Correct 2 ms 2772 KB Output is correct
4 Correct 4 ms 3284 KB Output is correct
5 Correct 30 ms 8604 KB Output is correct
6 Correct 716 ms 134760 KB Output is correct
7 Correct 771 ms 134856 KB Output is correct
8 Correct 5 ms 3412 KB Output is correct
9 Correct 2 ms 2900 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 9 ms 4308 KB Output is correct
13 Correct 27 ms 7620 KB Output is correct
14 Correct 25 ms 6844 KB Output is correct
15 Correct 787 ms 134820 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2772 KB Output is correct
2 Correct 2 ms 2772 KB Output is correct
3 Correct 2 ms 2772 KB Output is correct
4 Correct 5 ms 3284 KB Output is correct
5 Correct 41 ms 8692 KB Output is correct
6 Correct 7 ms 3664 KB Output is correct
7 Correct 9 ms 4048 KB Output is correct
8 Correct 1020 ms 134748 KB Output is correct
9 Correct 945 ms 130816 KB Output is correct
10 Correct 940 ms 130276 KB Output is correct
11 Correct 1036 ms 134760 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2772 KB Output is correct
2 Correct 4 ms 3284 KB Output is correct
3 Correct 3 ms 3284 KB Output is correct
4 Correct 4 ms 3284 KB Output is correct
5 Correct 4 ms 3284 KB Output is correct
6 Correct 4 ms 3284 KB Output is correct
7 Correct 2 ms 2900 KB Output is correct
8 Correct 3 ms 2900 KB Output is correct
9 Correct 4 ms 3284 KB Output is correct
10 Correct 4 ms 3284 KB Output is correct
11 Correct 5 ms 3316 KB Output is correct
12 Correct 4 ms 3284 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2772 KB Output is correct
2 Correct 4 ms 3284 KB Output is correct
3 Correct 3 ms 3284 KB Output is correct
4 Correct 4 ms 3284 KB Output is correct
5 Correct 4 ms 3284 KB Output is correct
6 Correct 4 ms 3284 KB Output is correct
7 Correct 2 ms 2900 KB Output is correct
8 Correct 3 ms 2900 KB Output is correct
9 Correct 4 ms 3284 KB Output is correct
10 Correct 4 ms 3284 KB Output is correct
11 Correct 5 ms 3316 KB Output is correct
12 Correct 4 ms 3284 KB Output is correct
13 Correct 31 ms 8484 KB Output is correct
14 Correct 32 ms 8484 KB Output is correct
15 Correct 38 ms 8496 KB Output is correct
16 Correct 46 ms 8640 KB Output is correct
17 Correct 2 ms 3028 KB Output is correct
18 Correct 4 ms 3284 KB Output is correct
19 Correct 3 ms 3028 KB Output is correct
20 Correct 36 ms 8396 KB Output is correct
21 Correct 35 ms 8332 KB Output is correct
22 Correct 39 ms 8392 KB Output is correct
23 Correct 39 ms 8340 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2772 KB Output is correct
2 Correct 2 ms 2772 KB Output is correct
3 Correct 2 ms 2772 KB Output is correct
4 Correct 2 ms 2900 KB Output is correct
5 Correct 2 ms 2900 KB Output is correct
6 Correct 3 ms 3412 KB Output is correct
7 Correct 2 ms 2772 KB Output is correct
8 Correct 2 ms 2772 KB Output is correct
9 Correct 2 ms 2772 KB Output is correct
10 Correct 4 ms 3284 KB Output is correct
11 Correct 30 ms 8516 KB Output is correct
12 Correct 754 ms 134740 KB Output is correct
13 Correct 1 ms 2772 KB Output is correct
14 Correct 2 ms 2772 KB Output is correct
15 Correct 2 ms 2772 KB Output is correct
16 Correct 4 ms 3284 KB Output is correct
17 Correct 30 ms 8604 KB Output is correct
18 Correct 716 ms 134760 KB Output is correct
19 Correct 771 ms 134856 KB Output is correct
20 Correct 5 ms 3412 KB Output is correct
21 Correct 2 ms 2900 KB Output is correct
22 Correct 2 ms 2772 KB Output is correct
23 Correct 2 ms 2772 KB Output is correct
24 Correct 9 ms 4308 KB Output is correct
25 Correct 27 ms 7620 KB Output is correct
26 Correct 25 ms 6844 KB Output is correct
27 Correct 787 ms 134820 KB Output is correct
28 Correct 2 ms 2772 KB Output is correct
29 Correct 2 ms 2772 KB Output is correct
30 Correct 2 ms 2772 KB Output is correct
31 Correct 5 ms 3284 KB Output is correct
32 Correct 41 ms 8692 KB Output is correct
33 Correct 7 ms 3664 KB Output is correct
34 Correct 9 ms 4048 KB Output is correct
35 Correct 1020 ms 134748 KB Output is correct
36 Correct 945 ms 130816 KB Output is correct
37 Correct 940 ms 130276 KB Output is correct
38 Correct 1036 ms 134760 KB Output is correct
39 Correct 1 ms 2772 KB Output is correct
40 Correct 4 ms 3284 KB Output is correct
41 Correct 3 ms 3284 KB Output is correct
42 Correct 4 ms 3284 KB Output is correct
43 Correct 4 ms 3284 KB Output is correct
44 Correct 4 ms 3284 KB Output is correct
45 Correct 2 ms 2900 KB Output is correct
46 Correct 3 ms 2900 KB Output is correct
47 Correct 4 ms 3284 KB Output is correct
48 Correct 4 ms 3284 KB Output is correct
49 Correct 5 ms 3316 KB Output is correct
50 Correct 4 ms 3284 KB Output is correct
51 Correct 31 ms 8484 KB Output is correct
52 Correct 32 ms 8484 KB Output is correct
53 Correct 38 ms 8496 KB Output is correct
54 Correct 46 ms 8640 KB Output is correct
55 Correct 2 ms 3028 KB Output is correct
56 Correct 4 ms 3284 KB Output is correct
57 Correct 3 ms 3028 KB Output is correct
58 Correct 36 ms 8396 KB Output is correct
59 Correct 35 ms 8332 KB Output is correct
60 Correct 39 ms 8392 KB Output is correct
61 Correct 39 ms 8340 KB Output is correct
62 Correct 83 ms 15784 KB Output is correct
63 Correct 83 ms 15932 KB Output is correct
64 Correct 106 ms 16032 KB Output is correct
65 Correct 402 ms 55044 KB Output is correct
66 Correct 437 ms 55440 KB Output is correct
67 Correct 9 ms 4048 KB Output is correct
68 Correct 7 ms 3664 KB Output is correct
69 Correct 742 ms 134832 KB Output is correct
70 Correct 881 ms 134840 KB Output is correct
71 Correct 1029 ms 134764 KB Output is correct
72 Correct 940 ms 132688 KB Output is correct
73 Correct 953 ms 132640 KB Output is correct
74 Correct 824 ms 132684 KB Output is correct
75 Correct 847 ms 132660 KB Output is correct