oj.uz

Submission #487674

# Submission time Handle Problem Language Result Execution time Memory
487674 2021-11-16T11:39:26 Z alextodoran Carnival Tickets (IOI20_tickets) C++17
100 / 100
 683 ms 93740 KB 
/**
 ____ ____ ____ ____ ____
||a |||t |||o |||d |||o ||
||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|

**/

#include <bits/stdc++.h>
#include "tickets.h"

using namespace std;

typedef long long ll;

void allocate_tickets (vector <vector <int>> sol);

ll find_maximum (int k, vector <vector <int>> x)
{
    int n = (int) x.size();
    int m = (int) x[0].size();
    int t = m - k;

    vector <vector <ll>> sum (n, vector <ll> (m - t + 1));
    for(int i = 0; i < n; i++)
    {
        sum[i][0] = 0;
        for(int j = t; j < m; j++)
            sum[i][0] += x[i][j];
        for(int j = 1; j < m - t + 1; j++)
            sum[i][j] = sum[i][j - 1] - x[i][j - 1] - x[i][j + t - 1];
    }

    vector <int> pos (n);
    priority_queue <pair <ll, int>> q;
    for(int i = 0; i < n; i++)
    {
        pos[i] = 0;
        if(pos[i] + 1 < (int) sum[i].size())
            q.push({sum[i][pos[i] + 1] - sum[i][pos[i]], i});
    }

    for(int it = 1; it <= k * n / 2; it++)
    {
        int i = q.top().second;
        q.pop();

        pos[i]++;
        if(pos[i] + 1 < (int) sum[i].size())
            q.push({sum[i][pos[i] + 1] - sum[i][pos[i]], i});
    }

    ll answer = 0;
    for(int i = 0; i < n; i++)
        answer += sum[i][pos[i]];

    vector <int> A (n);
    vector <int> B (n);

    for(int i = 0; i < n; i++)
    {
        A[i] = pos[i] - 1;
        B[i] = pos[i] + t;
    }

    vector <vector <int>> sol (n, vector <int> (m, -1));

    vector <int> p (n);
    for(int i = 0; i < n; i++)
        p[i] = i;

    for(int step = 0; step < k; step++)
    {
        sort(p.begin(), p.end(), [&] (const int &i, const int &j)
        {
            return A[i] > A[j];
        });
        for(int i = 0; i < n / 2; i++)
        {
            sol[p[i]][A[p[i]]] = step;
            A[p[i]]--;
        }
        for(int i = n / 2; i < n; i++)
        {
            sol[p[i]][B[p[i]]] = step;
            B[p[i]]++;
        }
    }

    allocate_tickets(sol);

    return answer;
}

Subtask #1
11.0 / 11.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 0 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 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 332 KB Output is correct
5 Correct 32 ms 2360 KB Output is correct
6 Correct 462 ms 51420 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 18 ms 2672 KB Output is correct
6 Correct 452 ms 61288 KB Output is correct
7 Correct 474 ms 64476 KB Output is correct
8 Correct 3 ms 588 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 9 ms 880 KB Output is correct
13 Correct 15 ms 2464 KB Output is correct
14 Correct 16 ms 2516 KB Output is correct
15 Correct 479 ms 67512 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 2 ms 464 KB Output is correct
5 Correct 26 ms 4020 KB Output is correct
6 Correct 4 ms 848 KB Output is correct
7 Correct 5 ms 1200 KB Output is correct
8 Correct 674 ms 93720 KB Output is correct
9 Correct 664 ms 87492 KB Output is correct
10 Correct 640 ms 87596 KB Output is correct
11 Correct 683 ms 93740 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 1 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 464 KB Output is correct
5 Correct 2 ms 464 KB Output is correct
6 Correct 3 ms 464 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 2 ms 436 KB Output is correct
10 Correct 2 ms 464 KB Output is correct
11 Correct 2 ms 464 KB Output is correct
12 Correct 2 ms 464 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 1 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 464 KB Output is correct
5 Correct 2 ms 464 KB Output is correct
6 Correct 3 ms 464 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 2 ms 436 KB Output is correct
10 Correct 2 ms 464 KB Output is correct
11 Correct 2 ms 464 KB Output is correct
12 Correct 2 ms 464 KB Output is correct
13 Correct 20 ms 3212 KB Output is correct
14 Correct 21 ms 3184 KB Output is correct
15 Correct 23 ms 3600 KB Output is correct
16 Correct 27 ms 3956 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 2 ms 464 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 26 ms 3100 KB Output is correct
21 Correct 23 ms 3584 KB Output is correct
22 Correct 21 ms 3276 KB Output is correct
23 Correct 28 ms 3792 KB Output is correct

Subtask #7
10.0 / 10.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 0 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 0 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 32 ms 2360 KB Output is correct
12 Correct 462 ms 51420 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 18 ms 2672 KB Output is correct
18 Correct 452 ms 61288 KB Output is correct
19 Correct 474 ms 64476 KB Output is correct
20 Correct 3 ms 588 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 9 ms 880 KB Output is correct
25 Correct 15 ms 2464 KB Output is correct
26 Correct 16 ms 2516 KB Output is correct
27 Correct 479 ms 67512 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 2 ms 464 KB Output is correct
32 Correct 26 ms 4020 KB Output is correct
33 Correct 4 ms 848 KB Output is correct
34 Correct 5 ms 1200 KB Output is correct
35 Correct 674 ms 93720 KB Output is correct
36 Correct 664 ms 87492 KB Output is correct
37 Correct 640 ms 87596 KB Output is correct
38 Correct 683 ms 93740 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 2 ms 332 KB Output is correct
42 Correct 2 ms 464 KB Output is correct
43 Correct 2 ms 464 KB Output is correct
44 Correct 3 ms 464 KB Output is correct
45 Correct 1 ms 208 KB Output is correct
46 Correct 1 ms 336 KB Output is correct
47 Correct 2 ms 436 KB Output is correct
48 Correct 2 ms 464 KB Output is correct
49 Correct 2 ms 464 KB Output is correct
50 Correct 2 ms 464 KB Output is correct
51 Correct 20 ms 3212 KB Output is correct
52 Correct 21 ms 3184 KB Output is correct
53 Correct 23 ms 3600 KB Output is correct
54 Correct 27 ms 3956 KB Output is correct
55 Correct 1 ms 336 KB Output is correct
56 Correct 2 ms 464 KB Output is correct
57 Correct 1 ms 336 KB Output is correct
58 Correct 26 ms 3100 KB Output is correct
59 Correct 23 ms 3584 KB Output is correct
60 Correct 21 ms 3276 KB Output is correct
61 Correct 28 ms 3792 KB Output is correct
62 Correct 55 ms 8376 KB Output is correct
63 Correct 71 ms 8440 KB Output is correct
64 Correct 69 ms 10628 KB Output is correct
65 Correct 251 ms 37036 KB Output is correct
66 Correct 277 ms 41476 KB Output is correct
67 Correct 8 ms 1104 KB Output is correct
68 Correct 6 ms 796 KB Output is correct
69 Correct 456 ms 73248 KB Output is correct
70 Correct 527 ms 82976 KB Output is correct
71 Correct 613 ms 93648 KB Output is correct
72 Correct 532 ms 77112 KB Output is correct
73 Correct 588 ms 89388 KB Output is correct
74 Correct 471 ms 68444 KB Output is correct
75 Correct 617 ms 81076 KB Output is correct