oj.uz

Submission #300751

# Submission time Handle Problem Language Result Execution time Memory
300751 2020-09-17T13:09:17 Z CodePlatina Carnival Tickets (IOI20_tickets) C++14
100 / 100
 1380 ms 74608 KB 
#include "tickets.h"
#include <vector>
#include <algorithm>
#include <string>
#include <utility>
#include <iostream>
#define pii pair<int, int>
#define piii pair<int, pii>
#define pll pair<long long, long long>
#define plll pair<long long, pll>
#define ff first
#define ss second
#define ee ss.ff
#define rr ss.ss

using namespace std;

long long find_maximum(int k, vector<vector<int>> x)
{
	int n = x.size();
	int m = x[0].size();
	vector<vector<int>> ret(n, vector<int>(m, -1));
	long long ans = 0;

//	int X[n], Y[n];
//	for(int i = 0; i < n; ++i) X[i] = min_element(x[i].begin(), x[i].end()) - x[i].begin(), Y[i] = max_element(x[i].begin(), x[i].end()) - x[i].begin(), ans += x[i][Y[i]];
//    vector<pii> tmp; for(int i = 0; i < n; ++i) tmp.push_back({x[i][X[i]] + x[i][Y[i]], i});
//    sort(tmp.begin(), tmp.end());
//    for(int i = 0; i < n / 2; ++i) ans -= tmp[i].ff, ret[tmp[i].ss][X[i]] = 0;
//    for(int i = n / 2; i < n; ++i) ret[tmp[i].ss][Y[i]] = 0;

    vector<int> lsX[n], lsY[n];
    vector<pii> tmp;
    for(int i = 0; i < n; ++i) for(int j = 0; j < k; ++j) ans += x[i][m - j - 1], tmp.push_back({x[i][j] + x[i][j + m - k], i});
    sort(tmp.begin(), tmp.end());
//    for(auto i : tmp) cout << i.ff << ' ' << i.ss << endl;
    int cnt[n]{};
    for(int i = 0; i < n * k / 2; ++i) ++cnt[tmp[i].ss], ans -= tmp[i].ff;
    for(int i = 0; i < n; ++i)
    {
        for(int j = 0; j < cnt[i]; ++j) lsX[i].push_back(j);
        for(int j = m - (k - cnt[i]); j < m; ++j) lsY[i].push_back(j);
    }

    for(int i = 0; i < k; ++i)
    {
        vector<pii> tmp2; for(int j = 0; j < n; ++j) tmp2.push_back({lsX[j].size(), j});
        sort(tmp2.begin(), tmp2.end());
        for(int j = 0; j < n / 2; ++j) ret[tmp2[j].ss][lsY[tmp2[j].ss].back()] = i, lsY[tmp2[j].ss].pop_back();
        for(int j = n / 2; j < n; ++j) ret[tmp2[j].ss][lsX[tmp2[j].ss].back()] = i, lsX[tmp2[j].ss].pop_back();
    }

	allocate_tickets(ret);
	return ans;
}

Subtask #1
11.0 / 11.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 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 896 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 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 48 ms 2428 KB Output is correct
6 Correct 773 ms 51576 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 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 43 ms 2808 KB Output is correct
6 Correct 766 ms 59592 KB Output is correct
7 Correct 808 ms 65480 KB Output is correct
8 Correct 6 ms 640 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 11 ms 1024 KB Output is correct
13 Correct 25 ms 2552 KB Output is correct
14 Correct 35 ms 2680 KB Output is correct
15 Correct 859 ms 68992 KB Output is correct

Subtask #4
14.0 / 14.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 1 ms 256 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 45 ms 3444 KB Output is correct
6 Correct 7 ms 776 KB Output is correct
7 Correct 9 ms 1152 KB Output is correct
8 Correct 1353 ms 74608 KB Output is correct
9 Correct 1212 ms 70424 KB Output is correct
10 Correct 1235 ms 69452 KB Output is correct
11 Correct 1380 ms 74420 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 4 ms 512 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 4 ms 512 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 4 ms 512 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 4 ms 512 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 4 ms 512 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 4 ms 512 KB Output is correct
13 Correct 31 ms 2424 KB Output is correct
14 Correct 33 ms 2428 KB Output is correct
15 Correct 40 ms 2800 KB Output is correct
16 Correct 46 ms 3444 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 3 ms 512 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 39 ms 2940 KB Output is correct
21 Correct 39 ms 2800 KB Output is correct
22 Correct 59 ms 3188 KB Output is correct
23 Correct 64 ms 3180 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 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 896 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 48 ms 2428 KB Output is correct
12 Correct 773 ms 51576 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 4 ms 512 KB Output is correct
17 Correct 43 ms 2808 KB Output is correct
18 Correct 766 ms 59592 KB Output is correct
19 Correct 808 ms 65480 KB Output is correct
20 Correct 6 ms 640 KB Output is correct
21 Correct 0 ms 256 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 1 ms 256 KB Output is correct
24 Correct 11 ms 1024 KB Output is correct
25 Correct 25 ms 2552 KB Output is correct
26 Correct 35 ms 2680 KB Output is correct
27 Correct 859 ms 68992 KB Output is correct
28 Correct 1 ms 256 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 4 ms 512 KB Output is correct
32 Correct 45 ms 3444 KB Output is correct
33 Correct 7 ms 776 KB Output is correct
34 Correct 9 ms 1152 KB Output is correct
35 Correct 1353 ms 74608 KB Output is correct
36 Correct 1212 ms 70424 KB Output is correct
37 Correct 1235 ms 69452 KB Output is correct
38 Correct 1380 ms 74420 KB Output is correct
39 Correct 1 ms 256 KB Output is correct
40 Correct 4 ms 512 KB Output is correct
41 Correct 3 ms 512 KB Output is correct
42 Correct 3 ms 512 KB Output is correct
43 Correct 3 ms 512 KB Output is correct
44 Correct 4 ms 512 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 4 ms 512 KB Output is correct
48 Correct 3 ms 512 KB Output is correct
49 Correct 3 ms 512 KB Output is correct
50 Correct 4 ms 512 KB Output is correct
51 Correct 31 ms 2424 KB Output is correct
52 Correct 33 ms 2428 KB Output is correct
53 Correct 40 ms 2800 KB Output is correct
54 Correct 46 ms 3444 KB Output is correct
55 Correct 1 ms 384 KB Output is correct
56 Correct 3 ms 512 KB Output is correct
57 Correct 2 ms 512 KB Output is correct
58 Correct 39 ms 2940 KB Output is correct
59 Correct 39 ms 2800 KB Output is correct
60 Correct 59 ms 3188 KB Output is correct
61 Correct 64 ms 3180 KB Output is correct
62 Correct 86 ms 6136 KB Output is correct
63 Correct 83 ms 6136 KB Output is correct
64 Correct 126 ms 8556 KB Output is correct
65 Correct 457 ms 26588 KB Output is correct
66 Correct 569 ms 32804 KB Output is correct
67 Correct 10 ms 1152 KB Output is correct
68 Correct 8 ms 776 KB Output is correct
69 Correct 765 ms 51720 KB Output is correct
70 Correct 949 ms 59596 KB Output is correct
71 Correct 1253 ms 74480 KB Output is correct
72 Correct 1115 ms 71612 KB Output is correct
73 Correct 1224 ms 70716 KB Output is correct
74 Correct 893 ms 58796 KB Output is correct
75 Correct 979 ms 58300 KB Output is correct