oj.uz

Submission #398511

# Submission time Handle Problem Language Result Execution time Memory
398511 2021-05-04T12:36:59 Z blue Carnival Tickets (IOI20_tickets) C++17
100 / 100
 1148 ms 84944 KB 
#include "tickets.h"
#include <vector>
#include <algorithm>
#include <set>
using namespace std;

int N, M, K;

vector< vector<int> > X;
vector<int> mv(1500, 0);

struct col
{
    int i;
};

bool operator < (col A, col B)
{
    int a = X[A.i][K-1 - mv[A.i]] + X[A.i][M-1 - mv[A.i]];
    int b = X[B.i][K-1 - mv[B.i]] + X[B.i][M-1 - mv[B.i]];

    if(a == b) return A.i < B.i;
    else return a > b;
}


vector<int> ct_top(1500), ct_bottom(1500);




long long find_maximum(int k, vector< vector<int> > x)
{
    X = x;
    K = k;
    N = x.size();
    M = x[0].size();

    set<col> S;
    for(int i = 0; i < N; i++) S.insert(col{i});

    for(int i = 0; i < N*K/2; i++)
    {
        // cerr << "move = " << i << '\n';
        // for(col q:S) cerr << q.i << ' ' << mv[q.i] << ' ' << X[q.i][K-1 - mv[q.i]] + X[q.i][M-1 - mv[q.i]] << '\n';

        int s = S.begin()->i;
        S.erase(S.begin());
        mv[s]++;
        if(mv[s] < K)
            S.insert(col{s});
    }

    // for(int i = 0; i < N; i++) cerr << mv[i] << ' ';
    // cerr << '\n';

    long long res = 0;
    for(int i = 0; i < N; i++)
    {
        for(int j = 0; j < K - mv[i]; j++)
            res -= X[i][j];

        for(int j = M - mv[i]; j < M; j++)
            res += X[i][j];
    }


    vector< vector<int> > s(N, vector<int>(M, -1));

    for(int i = 0; i < N; i++)
    {
        ct_top[i] = mv[i];
        ct_bottom[i] = K - ct_top[i];
    }

    vector<int> I(N);
    for(int i = 0; i < N; i++) I[i] = i;

    for(int k = 0; k < K; k++)
    {
        sort(I.begin(), I.end(), [] (int c1, int c2)
        {
            return ct_top[c1] < ct_top[c2];
        });

        for(int i = 0; i < N/2; i++)
        {
            s[I[i]][ct_bottom[I[i]] - 1] = k;
            ct_bottom[I[i]]--;
        }
        for(int i = N/2; i < N; i++)
        {
            s[I[i]][M - ct_top[I[i]]] = k;
            ct_top[I[i]]--;
        }
    }
    allocate_tickets(s);

    return res;
}

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 208 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 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 300 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 30 ms 3576 KB Output is correct
6 Correct 679 ms 82068 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 460 KB Output is correct
5 Correct 36 ms 2864 KB Output is correct
6 Correct 715 ms 65644 KB Output is correct
7 Correct 743 ms 66128 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 7 ms 972 KB Output is correct
13 Correct 23 ms 2472 KB Output is correct
14 Correct 29 ms 2512 KB Output is correct
15 Correct 692 ms 66600 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 40 ms 3604 KB Output is correct
6 Correct 6 ms 844 KB Output is correct
7 Correct 9 ms 1100 KB Output is correct
8 Correct 1119 ms 67092 KB Output is correct
9 Correct 1016 ms 62844 KB Output is correct
10 Correct 1024 ms 62928 KB Output is correct
11 Correct 1148 ms 67096 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 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 444 KB Output is correct
7 Correct 1 ms 332 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 444 KB Output is correct
11 Correct 4 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 3 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 444 KB Output is correct
7 Correct 1 ms 332 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 444 KB Output is correct
11 Correct 4 ms 460 KB Output is correct
12 Correct 3 ms 460 KB Output is correct
13 Correct 27 ms 3572 KB Output is correct
14 Correct 27 ms 3560 KB Output is correct
15 Correct 37 ms 3580 KB Output is correct
16 Correct 41 ms 3632 KB Output is correct
17 Correct 2 ms 372 KB Output is correct
18 Correct 3 ms 588 KB Output is correct
19 Correct 2 ms 460 KB Output is correct
20 Correct 31 ms 2972 KB Output is correct
21 Correct 35 ms 3468 KB Output is correct
22 Correct 35 ms 2984 KB Output is correct
23 Correct 38 ms 3472 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 208 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 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 300 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 30 ms 3576 KB Output is correct
12 Correct 679 ms 82068 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 460 KB Output is correct
17 Correct 36 ms 2864 KB Output is correct
18 Correct 715 ms 65644 KB Output is correct
19 Correct 743 ms 66128 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 7 ms 972 KB Output is correct
25 Correct 23 ms 2472 KB Output is correct
26 Correct 29 ms 2512 KB Output is correct
27 Correct 692 ms 66600 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 40 ms 3604 KB Output is correct
33 Correct 6 ms 844 KB Output is correct
34 Correct 9 ms 1100 KB Output is correct
35 Correct 1119 ms 67092 KB Output is correct
36 Correct 1016 ms 62844 KB Output is correct
37 Correct 1024 ms 62928 KB Output is correct
38 Correct 1148 ms 67096 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 3 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 444 KB Output is correct
45 Correct 1 ms 332 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 444 KB Output is correct
49 Correct 4 ms 460 KB Output is correct
50 Correct 3 ms 460 KB Output is correct
51 Correct 27 ms 3572 KB Output is correct
52 Correct 27 ms 3560 KB Output is correct
53 Correct 37 ms 3580 KB Output is correct
54 Correct 41 ms 3632 KB Output is correct
55 Correct 2 ms 372 KB Output is correct
56 Correct 3 ms 588 KB Output is correct
57 Correct 2 ms 460 KB Output is correct
58 Correct 31 ms 2972 KB Output is correct
59 Correct 35 ms 3468 KB Output is correct
60 Correct 35 ms 2984 KB Output is correct
61 Correct 38 ms 3472 KB Output is correct
62 Correct 74 ms 9420 KB Output is correct
63 Correct 76 ms 9356 KB Output is correct
64 Correct 113 ms 9616 KB Output is correct
65 Correct 381 ms 37120 KB Output is correct
66 Correct 460 ms 37548 KB Output is correct
67 Correct 10 ms 1088 KB Output is correct
68 Correct 6 ms 836 KB Output is correct
69 Correct 696 ms 82064 KB Output is correct
70 Correct 904 ms 82956 KB Output is correct
71 Correct 1072 ms 84944 KB Output is correct
72 Correct 782 ms 69164 KB Output is correct
73 Correct 1076 ms 82028 KB Output is correct
74 Correct 684 ms 67708 KB Output is correct
75 Correct 904 ms 80496 KB Output is correct