oj.uz

Submission #304780

# Submission time Handle Problem Language Result Execution time Memory
304780 2020-09-21T20:46:57 Z peti1234 Carnival Tickets (IOI20_tickets) C++17
100 / 100
 1184 ms 99128 KB 
#include <bits/stdc++.h>
#include "tickets.h"
using namespace std;
int n, m, kezd, db[1502], ki, ert;
long long sum;
vector<vector<pair<int, int> > > sz;
vector<vector<int>> sol;
vector<pair<int, int> > q;
long long find_maximum(int k, vector<vector<int> > x) {
    n=x.size(), m=x[0].size();
    sol.resize(n), sz.resize(n);
    for (int i=0; i<n; i++) {
        for (int j=0; j<m; j++) sol[i].push_back(-1), sz[i].push_back({x[i][j], j});
        sort(sz[i].begin(), sz[i].end());
        for (int j=0; j<k; j++) {
            sum-=sz[i][j].first;
            q.push_back({sz[i][m-k+j].first+sz[i][j].first, i});
        }
    }
    sort(q.rbegin(), q.rend());
    for (int i=0; i<n*k/2; i++) db[q[i].second]++, sum+=q[i].first;
    for (int i=0; i<n; i++) {
        for (int j=0; j<db[i]; j++) {
            ki=sz[i][m-1-j].second, ert=(kezd+j)%k;
            sol[i][ki]=ert;
        }
        kezd+=db[i];
        for (int j=0; j<k-db[i]; j++) {
            ki=sz[i][j].second, ert=(kezd+j)%k;
            sol[i][ki]=ert;
        }
    }
    allocate_tickets(sol);
    return sum;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 768 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 36 ms 3900 KB Output is correct
6 Correct 784 ms 78344 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 3 ms 640 KB Output is correct
5 Correct 31 ms 4348 KB Output is correct
6 Correct 708 ms 88252 KB Output is correct
7 Correct 730 ms 91452 KB Output is correct
8 Correct 4 ms 768 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 8 ms 1280 KB Output is correct
13 Correct 25 ms 3704 KB Output is correct
14 Correct 24 ms 3192 KB Output is correct
15 Correct 742 ms 94536 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 3 ms 640 KB Output is correct
5 Correct 42 ms 4592 KB Output is correct
6 Correct 7 ms 1024 KB Output is correct
7 Correct 9 ms 1280 KB Output is correct
8 Correct 1062 ms 99128 KB Output is correct
9 Correct 988 ms 93336 KB Output is correct
10 Correct 1056 ms 92148 KB Output is correct
11 Correct 1184 ms 98728 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 640 KB Output is correct
5 Correct 3 ms 640 KB Output is correct
6 Correct 4 ms 616 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 3 ms 640 KB Output is correct
10 Correct 3 ms 640 KB Output is correct
11 Correct 4 ms 640 KB Output is correct
12 Correct 5 ms 640 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 640 KB Output is correct
5 Correct 3 ms 640 KB Output is correct
6 Correct 4 ms 616 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 3 ms 640 KB Output is correct
10 Correct 3 ms 640 KB Output is correct
11 Correct 4 ms 640 KB Output is correct
12 Correct 5 ms 640 KB Output is correct
13 Correct 41 ms 3832 KB Output is correct
14 Correct 37 ms 3916 KB Output is correct
15 Correct 46 ms 4212 KB Output is correct
16 Correct 57 ms 4592 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 3 ms 640 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 40 ms 4364 KB Output is correct
21 Correct 39 ms 4256 KB Output is correct
22 Correct 38 ms 4588 KB Output is correct
23 Correct 43 ms 4460 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 768 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 36 ms 3900 KB Output is correct
12 Correct 784 ms 78344 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 3 ms 640 KB Output is correct
17 Correct 31 ms 4348 KB Output is correct
18 Correct 708 ms 88252 KB Output is correct
19 Correct 730 ms 91452 KB Output is correct
20 Correct 4 ms 768 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 0 ms 256 KB Output is correct
24 Correct 8 ms 1280 KB Output is correct
25 Correct 25 ms 3704 KB Output is correct
26 Correct 24 ms 3192 KB Output is correct
27 Correct 742 ms 94536 KB Output is correct
28 Correct 0 ms 256 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 3 ms 640 KB Output is correct
32 Correct 42 ms 4592 KB Output is correct
33 Correct 7 ms 1024 KB Output is correct
34 Correct 9 ms 1280 KB Output is correct
35 Correct 1062 ms 99128 KB Output is correct
36 Correct 988 ms 93336 KB Output is correct
37 Correct 1056 ms 92148 KB Output is correct
38 Correct 1184 ms 98728 KB Output is correct
39 Correct 1 ms 256 KB Output is correct
40 Correct 3 ms 512 KB Output is correct
41 Correct 3 ms 512 KB Output is correct
42 Correct 3 ms 640 KB Output is correct
43 Correct 3 ms 640 KB Output is correct
44 Correct 4 ms 616 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Correct 2 ms 384 KB Output is correct
47 Correct 3 ms 640 KB Output is correct
48 Correct 3 ms 640 KB Output is correct
49 Correct 4 ms 640 KB Output is correct
50 Correct 5 ms 640 KB Output is correct
51 Correct 41 ms 3832 KB Output is correct
52 Correct 37 ms 3916 KB Output is correct
53 Correct 46 ms 4212 KB Output is correct
54 Correct 57 ms 4592 KB Output is correct
55 Correct 2 ms 384 KB Output is correct
56 Correct 3 ms 640 KB Output is correct
57 Correct 2 ms 512 KB Output is correct
58 Correct 40 ms 4364 KB Output is correct
59 Correct 39 ms 4256 KB Output is correct
60 Correct 38 ms 4588 KB Output is correct
61 Correct 43 ms 4460 KB Output is correct
62 Correct 106 ms 8084 KB Output is correct
63 Correct 107 ms 8196 KB Output is correct
64 Correct 163 ms 10320 KB Output is correct
65 Correct 422 ms 35524 KB Output is correct
66 Correct 491 ms 40016 KB Output is correct
67 Correct 9 ms 1280 KB Output is correct
68 Correct 7 ms 1024 KB Output is correct
69 Correct 811 ms 78388 KB Output is correct
70 Correct 932 ms 88080 KB Output is correct
71 Correct 1086 ms 98704 KB Output is correct
72 Correct 937 ms 95408 KB Output is correct
73 Correct 1004 ms 94140 KB Output is correct
74 Correct 811 ms 86876 KB Output is correct
75 Correct 895 ms 85948 KB Output is correct